Proof systems that take advice (Q553297): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59902997, #quickstatements; #temporary_batch_1711055989931
Created claim: DBLP publication ID (P1635): journals/iandc/BeyersdorffKM11, #quickstatements; #temporary_batch_1731547958265
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4501542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic advice classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Instance Complexity and Proof Systems with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight Karp-Lipton collapse result in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does Advice Help to Prove Propositional Tautologies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tally languages and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competing provers yield improved Karp-Lipton collapse results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> / 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: Optimal proof systems imply complete sets for promise classes / 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: Instance complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/BeyersdorffKM11 / rank
 
Normal rank

Latest revision as of 02:38, 14 November 2024

scientific article
Language Label Description Also known as
English
Proof systems that take advice
scientific article

    Statements

    Proof systems that take advice (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    propositional proof complexity
    0 references
    computational complexity
    0 references
    proof systems
    0 references
    advice
    0 references
    instance complexity
    0 references
    polynomially bounded proof systems
    0 references
    optimal proof systems
    0 references

    Identifiers