Pages that link to "Item:Q1107309"
From MaRDI portal
The following pages link to The complexity of optimization problems (Q1107309):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Two hardness results for Gamson's game (Q485436) (← links)
- Updating action domain descriptions (Q622109) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- 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)
- Complexity of counting the optimal solutions (Q837174) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- Ancestors, descendants, and gardens of Eden in reaction systems (Q896703) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Bi-immunity results for cheatable sets (Q920981) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (Q976088) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Before and after vacuity (Q1028732) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← 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)
