Quantifiers and approximation

Existential second-order logic over strings

Journal of the ACM (JACM)

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

Polynomially bounded minimization problems that are hard to approximate

Nordic Journal of Computing

Search and Optimization Problems in Datalog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II

Towards a Predictive Computational Complexity Theory

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

On the semantics and expressive power of Datalog-like languages for NP search and optimization problems

Proceedings of the 2004 ACM symposium on Applied computing

Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning

Machine Learning

Approximating the minimum clique cover and other hard problems in subtree filament graphs

Discrete Applied Mathematics

The approximability of non-Boolean satisfiability problems and restricted integer programming

Theoretical Computer Science

Polynomial-TimeMaximisation Classes: Syntactic Hierarchy

Fundamenta Informaticae - Workshop on Combinatorial Algorithms

Frameworks for logically classifying polynomial-time optimisation problems

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications

Polynomial-TimeMaximisation Classes: Syntactic Hierarchy

Fundamenta Informaticae - Workshop on Combinatorial Algorithms