Decompositions of nondeterministic reductions
From MaRDI portal
(Redirected from Publication:1108263)
Recommendations
Cites work
- scientific article; zbMATH DE number 3904572 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- A comparison of polynomial time reducibilities
- A note on relativized log space
- Alternation
- Complete sets and the polynomial-time hierarchy
- Log Space Recognition and Translation of Parenthesis Languages
- On uniform circuit complexity
- Relativization of questions about log space computability
- Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\)
- Space-bounded hierarchies and probabilistic computations
- Strong nondeterministic polynomial-time reducibilities
- The complexity of facets (and some facets of complexity)
- The complexity of theorem-proving procedures
- Tree-size bounded alternation
Cited in
(7)- On adaptive DLOGTIME and POLYLOGTIME reductions
- scientific article; zbMATH DE number 3960995 (Why is no real title available?)
- scientific article; zbMATH DE number 4043254 (Why is no real title available?)
- scientific article; zbMATH DE number 3904572 (Why is no real title available?)
- Nonuniform reductions and NP-completeness
- scientific article; zbMATH DE number 4037175 (Why is no real title available?)
- Decompositions and reductions of snarks
This page was built for publication: Decompositions of nondeterministic reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108263)