scientific article; zbMATH DE number 4060725

MaRDI QIDQ3795231zbMATH OpenFDO

Authors K. W. Wagner

Publication date 1988

zbMATH Keywords

complexity classesNP oraclePolynomial time machinesrestricted access

Mathematics Subject Classification ID

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

Recommendations

• Bounded Query Classes
• On monotonous oracle machines
• On relativizations with restricted number of accesses to the oracle set
• On Restricting the Size of Oracles Compared with Restricting Access to Oracles
• Restricted information from nonadaptive queries to NP

Cited in

(10)

• On truth-table reducibility to SAT
• Generalizations of Opt P to the polynomial hierarchy
• Restricted information from nonadaptive queries to NP
• Bounded Query Classes
• On Restricting the Size of Oracles Compared with Restricting Access to Oracles
• scientific article; zbMATH DE number 6970794 (Why is no real title available?)
• scientific article; zbMATH DE number 809154 (Why is no real title available?)
• On monotonous oracle machines
• Characterizations of some complexity classes between \(\Theta_2^{\mathrm{P}}\) and \(\Delta_2^{\mathrm{P}}\)
• Computing and Combinatorics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795231)