Add to ORKGThis talk surveys work on classifying the complexity and approximability of problems residing in the Polynomial-Time Hierarchy, above the first level. Along the way, we highlight some prominent natural problems that are believed – but not yet known – to be Σ^p₂-complete. We describe how strong inapproximability results for certain Σ^p₂ optimization problems can be obtained using dispersers to build error-correcting codes. Finally we adapt a learning algorithm to produce approximation algorithms for these problems
We study computational complexity theory and define a class of optimization problems called OptP (O...
. In this paper we generalize the notion of polynomial-time approximation scheme preserving reducibi...
A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that giv...
This talk surveys work on classifying the complexity and approximability of problems residing in the...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
We overview recent results on the existence of polynomial time approximation schemes for some dense ...
AbstractWe define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are cla...
AbstractWe investigate the relationship between logical expressibility of NP optimization problems a...
An α-approximation algorithm is an algorithm guaranteed to output a solution that is within an α rat...
Polynomial optimization is the problem of minimizing a polynomial function subject to polynomial ine...
The main objective of the polynomial approximation is the development of polynomial time algorithms ...
We investigate the relationship between logical expressibility of NP optimization problems and thei...
AbstractWe introduce a formal framework for studying approximation properties of NP optimization (NP...
Many combinatorial optimization problems are often considered intractable to solve exactly or by app...
We study computational complexity theory and define a class of optimization problems called OptP (O...
. In this paper we generalize the notion of polynomial-time approximation scheme preserving reducibi...
A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that giv...
This talk surveys work on classifying the complexity and approximability of problems residing in the...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
We overview recent results on the existence of polynomial time approximation schemes for some dense ...
AbstractWe define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are cla...
AbstractWe investigate the relationship between logical expressibility of NP optimization problems a...
An α-approximation algorithm is an algorithm guaranteed to output a solution that is within an α rat...
Polynomial optimization is the problem of minimizing a polynomial function subject to polynomial ine...
The main objective of the polynomial approximation is the development of polynomial time algorithms ...
We investigate the relationship between logical expressibility of NP optimization problems and thei...
AbstractWe introduce a formal framework for studying approximation properties of NP optimization (NP...
Many combinatorial optimization problems are often considered intractable to solve exactly or by app...
We study computational complexity theory and define a class of optimization problems called OptP (O...
. In this paper we generalize the notion of polynomial-time approximation scheme preserving reducibi...
A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that giv...