An Almost Optimal Rank Bound for Depth-3 Identities
An analysis of a random algorithm for estimating all the matchings
An approximation algorithm for approximation rank
An approximation trichotomy for Boolean #CSP
An Average Analysis of Backtracking on Random Constraint Satisfaction Problems
An Average Case NP-complete Graph Problem
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
An effective Procedure for Speeding up Algorithms
An Elegant Argument that P is not NP
An Exact 2.9416^n Algorithm for the Three Domatic Number Problem
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
An Implicit Cover Problem in Wild Population Study
An Improved Exact Algorithm for the Domatic Number Problem
An Invariance Principle for Polytopes
An omega-power of a context-free language which is Borel above Delta^0_omega
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP
Analog models of computations \& Effective Church Turing Thesis: Efficient simulation of Turing machines by the General Purpose Analog Computer
Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem