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
The Rise and Fall of the Church-Turing Thesis
The similarity metric
The space complexity of recognizing well-parenthesized expressions in the streaming model: the Index function revisited
The state complexity of L^2 and L^k
The surprizing complexity of generalized reachability games
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
The Threshold for Random k-SAT is 2^k ln2 - O(k)
The traveling salesman problem: A Linear programming formulation of
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
The Two Bicliques Problem is in NP intersection coNP
The zero exemplar distance problem
Theory of One Tape Linear Time Turing Machines