Nearly Linear Time

The quasilinear isomorphism challenge

ACM SIGACT News

Performance of Neural Net Heuristics for Maximum Clique on DiverseHighly Compressible Graphs

Journal of Global Optimization

Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

On the Complexity of SAT

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Inductive Time-Space Lower Bounds for Sat and Related Problems

Computational Complexity

Yuri, logic, and computer science

Fields of logic and computation

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Nonuniform ACC Circuit Lower Bounds

Journal of the ACM (JACM)