Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: What can be efficiently reduced to the Kolmogorov-random strings? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonalizations over polynomial time computable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genericity and measure for exponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic oracles, uniform machines, and codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on the probabilistic algorithms and NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does truth-table of linear norm reduce the one-query tautologies to a random oracle? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the \(r\)-query tautologies in the presence of a generic oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing complexity: Minimum sizes of forcing conditions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Dowd-type generic oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded truth table does not reduce the one-query tautologies to a random oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time reducibilities and ``almost all'' oracle sets / rank
 
Normal rank

Revision as of 17:18, 28 June 2024

scientific article
Language Label Description Also known as
English
Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
scientific article

    Statements

    Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2008
    0 references
    truth-table reduction
    0 references
    computational complexity
    0 references
    random oracle
    0 references
    monotone Boolean formula
    0 references
    forcing complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references