Optimal proof systems imply complete sets for promise classes (Q1398371): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tally languages and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to define complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of parity polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / 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: Sparse sets in NP-P: EXPTIME versus NEXPTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes without machines: on complete languages for UP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3755452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS / rank
 
Normal rank

Latest revision as of 18:33, 5 June 2024

scientific article
Language Label Description Also known as
English
Optimal proof systems imply complete sets for promise classes
scientific article

    Statements

    Optimal proof systems imply complete sets for promise classes (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2003
    0 references
    0 references
    Optimal proof systems
    0 references
    Complete sets
    0 references