A UB COMPUTER scientist, Jin-Yi Cai, and a computer science graduate student, D. Sivakumar, have proven one of the oldest conjectures in the field of complexity theory. They did it using a combination ...

On Monday, July 19, 2021, in the middle of another strange pandemic summer, a leading computer scientist in the field of complexity theory tweeted out a public service message about an ...

We wanted to know whether computational complexity theory could accurately predict how much humans would struggle in a certain situation and how accurate their problem-solving would be.

But is there a simpler way? Questions like this one, about the most efficient way to solve problems, are at the heart of the branch of computer science known as computational complexity theory.

Algorithmic complexity and information theory are foundational disciplines that intersect to elucidate how data is structured, transmitted and computed.

Regan, 65, has made this question his life’s work, in a field of computer science known as complexity theory.

All the latest science news on complexity theory from Phys.org. Find the latest news, advancements, and breakthroughs.

Theoretical computer scientists are normally a fairly sedate bunch, but are humming with excitement after a potential breakthrough in a long-standing problem called graph isomorphism. The result ...