Add to ORKGWe study the relationship between the computationally defined class NCX of all optimization problems that are approximable within constant ratio in NC and syntactically defined classes MAXSNP and MAXNP. A simple observation shows that any problem in MAXSNP is constant approximable in NC. We show that MAXNP is also contained in NCX
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational...
AbstractFixed-parameter tractability of NP optimization problems is studied by relating it to approx...
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational...
We study the relationship between the computationally defined class NCX of all optimization problems...
In this paper we deal with the class NCX of NP Optimization problems that are approximable within co...
AbstractWe define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are cla...
We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of ...
In this paper we deal with the class NCX of NP Optimization problems that are approximable within co...
We investigate the relationship between logical expressibility of NP optimization problems and thei...
AbstractWe investigate the relationship between logical expressibility of NP optimization problems a...
AbstractIn this paper we study NP optimization problems from the perspective of descriptive complexi...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
AbstractWe define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are cla...
AbstractStructural approximation theory seeks to provide a framework for expressing optimization pro...
AbstractWe investigate the relationship between logical expressibility of NP optimization problems a...
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational...
AbstractFixed-parameter tractability of NP optimization problems is studied by relating it to approx...
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational...
We study the relationship between the computationally defined class NCX of all optimization problems...
In this paper we deal with the class NCX of NP Optimization problems that are approximable within co...
AbstractWe define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are cla...
We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of ...
In this paper we deal with the class NCX of NP Optimization problems that are approximable within co...
We investigate the relationship between logical expressibility of NP optimization problems and thei...
AbstractWe investigate the relationship between logical expressibility of NP optimization problems a...
AbstractIn this paper we study NP optimization problems from the perspective of descriptive complexi...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
AbstractWe define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are cla...
AbstractStructural approximation theory seeks to provide a framework for expressing optimization pro...
AbstractWe investigate the relationship between logical expressibility of NP optimization problems a...
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational...
AbstractFixed-parameter tractability of NP optimization problems is studied by relating it to approx...
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational...