Approximating the Permanent via Nonabelian Determinants

Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials

Approximation algorithms and hardness for domination with propagation

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems

Approximation Algorithms for the Bipartite Multi-cut Problem

Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems

Approximation for Maximum Surjective Constraint Satisfaction Problems

Approximation Limits of Linear Programs (Beyond Hierarchies)

Approximation Resistant Predicates From Pairwise Independence

Approximation thresholds for combinatorial optimization problems

Arc-preserving subsequences of arc-annotated sequences

Are stable instances easy?

Arithmetic Circuits and the Hadamard Product of Polynomials

Arithmetic circuits: the chasm at depth four gets wider

Assessing Cognitive Randomness: A Kolmogorov Complexity Approach

Assisted Problem Solving and Decompositions of Finite Automata

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information

Attribute Estimation and Testing Quasi-Symmetry

Autómatas celulares elementales aplicados a la encriptación de datos

Average sensitivity and noise sensitivity of polynomial threshold functions