Pages that link to "Item:Q1107524"
From MaRDI portal
The following pages link to More complicated questions about maxima and minima, and some closures of NP (Q1107524):
Displayed 21 items.
- \(\text{DA}^2\) merging operators (Q814605) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Isomorphic implication (Q2272203) (← links)
- Query evaluation on a database given by a random graph (Q2272222) (← 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)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
