OpenAI claims to disprove the Exponential Time Hypothesis with a new algorithm showing subexponential performance for the ...

The original version of this story appeared in Quanta Magazine. Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price.

Quantum algorithm iQCC, run on a standard AMD CPU server without quantum hardware, outperforms every classical chemistry method for predicting phosphorescent OLED emitter properties. OTI Lumionics and ...

OpenAI claims their AI-generated algorithm can solve certain hard computing problems faster. Mathematicians are organizing an ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

In 2019, Google claimed it was the first to demonstrate a quantum computer performing a calculation beyond the abilities of today's most powerful supercomputers. But most of the time, creating a ...

Welcome to the Theoretical Computer Science (TCS) research group. Research in TCS (and in our group) encompasses diverse areas such as theory of computation, complexity, sublinear algorithms, ...

After looking at some advanced math concerning infinity, you can start to appreciate that algorithms, or programs, have a lot to do with math. The fact that the number of programs is smaller than the ...

Property testing in graph theory concerns the design of sublinear‐time algorithms that, given query access to a large graph, swiftly distinguish between the case where the graph satisfies a global ...