The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
The Mixing Time of Glauber Dynamics for Colouring Regular Trees
The model checking problem for intuitionistic propositional logic with one variable is AC1-complete
The Multivariate Resultant is NP-hard in any Characteristic
The One-Way Communication Complexity of Group Membership
The P versus NP Brief
The P versus NP Problem
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
The Partition Bound for Classical Communication Complexity and Query Complexity
The Pattern Matrix Method (Journal Version)
The Phase Transition in Exact Cover
The Power of Depth 2 Circuits over Algebras
The Power of Linear Programming for Valued CSPs
The Power of Nondeterminism in Self-Assembly
The program complexity on Universal Turing Machines, and a proposal to find efficient n-bounded algorithms of NPC problems by machine enumeration
The Quantum Query Complexity of AC0
The Quantum Separability Problem for Gaussian States
The rapid points of a complex oscillation
The Recognition of Tolerance and Bounded Tolerance Graphs
The Remote Point Problem, Small Bias Space, and Expanding Generator Sets