Proof system representations of degrees of disjoint NP-pairs (Q1944897): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3692867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of representable disjoint \textsf{NP}-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical disjoint NP-pairs of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inseparability and Strong Hypotheses for Disjoint NP Pairs. / 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: Q5422270 / rank
 
Normal rank

Latest revision as of 08:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Proof system representations of degrees of disjoint NP-pairs
scientific article

    Statements

    Proof system representations of degrees of disjoint NP-pairs (English)
    0 references
    0 references
    28 March 2013
    0 references
    0 references
    computational complexity
    0 references
    degrees of disjoint NP-pairs
    0 references
    propositional proof systems
    0 references
    canonical NP-pairs
    0 references
    0 references