The opacity of backbones
From MaRDI portal
Publication:2051797
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1482586 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Complete sets and closeness to complexity classes
- Complexity classes without machines: on complete languages for UP
- Determining computational complexity from characteristic ``phase transitions
- Easy sets and hard certificate schemes
- Generalized juntas and NP-hard sets
- Inverting onto functions.
- Junta distributions and the average-case complexity of manipulating elections
- Reducibility among combinatorial problems
- Relative complexity of checking and evaluating
- Search versus Decision for Election Manipulation Problems
- The Complexity of Decision Versus Search
- The complexity of computing the permanent
- The complexity of parallel search
- The complexity of theorem-proving procedures
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
Cited in
(1)
This page was built for publication: The opacity of backbones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051797)