Decompositions of nondeterministic reductions

DOI10.1016/0304-3975(88)90025-4zbMATH Open0654.03025OpenAlexW2062265191MaRDI QIDQ1108263FDOQ1108263

Authors: Klaus-Jörn Lange 

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90025-4

Recommendations

• scientific article; zbMATH DE number 3960995
• scientific article; zbMATH DE number 3904572
• Characterizations of reduction classes modulo oracle conditions
• The relative power of logspace and polynomial time reductions
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds

zbMATH Keywords

determinismlogarithmic spacenondeterminismpolynomial timerelativizationsmany-one reducibilityTuring reducibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hierarchies of computability and definability (03D55) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Space-bounded hierarchies and probabilistic computations
• On uniform circuit complexity
• Relativization of questions about log space computability
• The complexity of theorem-proving procedures
• Alternation
• Title not available (Why is that?)
• The complexity of facets (and some facets of complexity)
• Log Space Recognition and Translation of Parenthesis Languages
• A comparison of polynomial time reducibilities
• Complete sets and the polynomial-time hierarchy
• Strong nondeterministic polynomial-time reducibilities
• Title not available (Why is that?)
• Tree-size bounded alternation
• Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\)
• A note on relativized log space

Cited In (7)

• Decompositions and reductions of snarks
• Title not available (Why is that?)
• On adaptive DLOGTIME and POLYLOGTIME reductions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonuniform reductions and NP-completeness

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)