Pages that link to "Item:Q1107309"
From MaRDI portal
The following pages link to The complexity of optimization problems (Q1107309):
Displayed 50 items.
- Frequency computation and bounded queries (Q671360) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- Improving known solutions is hard (Q687508) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- Completeness in approximation classes (Q811119) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Bi-immunity results for cheatable sets (Q920981) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Polynomial terse sets (Q1104077) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- Nondeterministic bounded query reducibilities (Q1120564) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- Constructive complexity (Q1182305) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Traveling salesman problem and local search (Q1195657) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- The complexity of optimizing finite-state transducers (Q1329734) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- Universally serializable computation (Q1384538) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- The complexity of belief update (Q1575185) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- Some new results in the complexity of allocation and binding in data path synthesis (Q1608404) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- Two queries (Q1961371) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) (← links)