Canonical disjoint NP-pairs of propositional proof systems (Q868942): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for structural properties: The isomorphism problem and public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Embeddings for Abstract Bounded Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to obtain diagonal sets in complexity classes / rank
 
Normal rank

Latest revision as of 14:15, 25 June 2024

scientific article
Language Label Description Also known as
English
Canonical disjoint NP-pairs of propositional proof systems
scientific article

    Statements

    Canonical disjoint NP-pairs of propositional proof systems (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2007
    0 references
    disjoint NP-pairs
    0 references
    propositional proof systems
    0 references
    degrees
    0 references
    P-separable
    0 references

    Identifiers