Towards a Predictive Computational Complexity Theory

Games against nature

Journal of Computer and System Sciences

The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986

Polynomial space counting problems

SIAM Journal on Computing

The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems

Journal of Computer and System Sciences

Quantifiers and approximation

Theoretical Computer Science - Special issue on structure in complexity theory

An algebraic theory of graph reduction

Journal of the ACM (JACM)

Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)

The complexity and approximability of finding maximum feasible subsystems of linear relations

Theoretical Computer Science

Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)

A dichotomy theorem for maximum generalized satisfiability problems

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)

Complexity of generalized satisfiability counting problems

Information and Computation

Finite languages for the representation of finite graphs

Journal of Computer and System Sciences

Towards a syntactic characterization of PTAS

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems

On Unapproximable Versions of NP-Complete Problems

SIAM Journal on Computing

Random Debaters and the Hardness of Approximating Stochastic Functions

SIAM Journal on Computing

Separators for sphere-packings and nearest neighbor graphs

Journal of the ACM (JACM)

Closure properties of constraints

Journal of the ACM (JACM)

K-sat on groups and undecidability

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)

The Complexity of Planar Counting Problems

SIAM Journal on Computing

On approximation algorithms for hierarchical MAX-SAT

Journal of Algorithms

NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems

SIAM Journal on Computing

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing

Subgraph isomorphism in planar graphs and related problems

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Optimization complexity of linear logic proof games

Theoretical Computer Science - Special issue on linear logic, 1

Satisfiability Is Quasilinear Complete in NQL

Journal of the ACM (JACM)

Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Complexity classifications of boolean constraint satisfaction problems

Complexity classifications of boolean constraint satisfaction problems

Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems

Information and Computation

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Nonserial Dynamic Programming

Nonserial Dynamic Programming

An Algebraic Model for Combinatorial Problems

SIAM Journal on Computing

The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing

Stochastic Boolean Satisfiability

Journal of Automated Reasoning

Dynamic Programming on Graphs with Bounded Treewidth

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming

Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming

On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming

Processing of Hierarchically Defined Graphs and Graph Families

Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative

Theory of Periodically Specified Problems: Complexity and Approximability

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity

The complexity of dynamic languages and dynamic optimization problems

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Local Tree-Width, Excluded Minors, and Approximation Algorithms

Combinatorica