scientific article; zbMATH DE number 515727
From MaRDI portal
Publication:4283229
Recommendations
Cited in
(22)- Quantifiers and approximation
- Integer programming as a framework for optimization and approximability
- Structural properties of bounded relations with an application to NP optimization problems
- Taking it to the limit: On infinite variants of NP-complete problems
- Approximation properties of NP minimization classes
- About asymptotic analysis and set optimization
- On a class of optimization problems with no ``efficiently computable solution
- Asymptotics of optimal synthesis for a class of extremal problems
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap
- scientific article; zbMATH DE number 996467 (Why is no real title available?)
- 0-1 laws for maps
- AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS
- scientific article; zbMATH DE number 1086675 (Why is no real title available?)
- scientific article; zbMATH DE number 2079029 (Why is no real title available?)
- scientific article; zbMATH DE number 895368 (Why is no real title available?)
- scientific article; zbMATH DE number 5584608 (Why is no real title available?)
- Syntactic characterizations of polynomial time optimization classes
- Mathematical Foundations of Computer Science 2005
- Approximation of coNP sets by NP-complete sets
- Approximate solution of NP optimization problems
- Improving known solutions is hard
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4283229)
