scientific article
From MaRDI portal
Publication:2741527
zbMath0990.90562MaRDI QIDQ2741527
Richard E. Stearns, Harry B. III Hunt, Madhav V. Marathe
Publication date: 24 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Combinatorial optimization (90C27)
Related Items (2)
PTAS for Sparse General-valued CSPs ⋮ Confidence-based reasoning in stochastic constraint programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy theorem for maximum generalized satisfiability problems.
- Complete problems for space bounded subclasses of NP
- Games against nature
- Efficient solutions of hierarchical systems of linear equations
- The complexity of optimization problems
- Complexity of problems in games, graphs and algebraic equations
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- Optimization, approximation, and complexity classes
- Quantifiers and approximation
- Optimization complexity of linear logic proof games
- Bandwidth contrained NP-complete problems
- Building tractable disjunctive constraints
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
- Polynomial Space Counting Problems
- Proof verification and the hardness of approximation problems
- Algebraic Structures with Hard Equivalence and Minimization Problems
- Planar Formulae and Their Uses
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
- Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
- Random Debaters and the Hardness of Approximating Stochastic Functions
- Closure properties of constraints
- Monotone monadic SNP and constraint satisfaction
- The complexity of satisfiability problems
- On Unapproximable Versions of $NP$-Complete Problems
This page was built for publication:
