Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules
Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
Testing Graph Isomorphism in Parallel by Playing a Game
Tetravex is NP-complete
Tetris is Hard, Even to Approximate
The 3-satisfiability problem
The approximability of MAX CSP with fixed-value constraints
The approximability of three-valued MAX CSP
The Baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in Computer Science
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy
The central nature of the Hidden Subgroup problem
The Collapse of the Polynomial Hierarchy: NP = P (A Summary)
The communication complexity of XOR games via summing operators
The Complexity of 3SAT_N and the P versus NP Problem
The Complexity of Agreement
The Complexity of Approximately Counting Stable Matchings
The Complexity of Approximately Counting Stable Roommate Assignments
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)
The Complexity of Approximating Bounded-Degree Boolean \sharp CSP