scientific article; zbMATH DE number 1294498
From MaRDI portal
Publication:4246600
Recommendations
- Complexity of the \(r\)-query tautologies in the presence of a generic oracle
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
- Generic oracles, uniform machines, and codes
- Logical Approaches to Computational Barriers
- An improved time-space lower bound for tautologies
Cited in
(6)- Forcing complexity: Minimum sizes of forcing conditions.
- Degrees of Dowd-type generic oracles
- Complexity of the \(r\)-query tautologies in the presence of a generic oracle
- Resource-bounded martingales and computable Dowd-type generic sets
- Bounded truth table does not reduce the one-query tautologies to a random oracle
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
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 Q4246600)
