INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q113858283, #quickstatements; #temporary_batch_1722544330843
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3158765418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating Resolution is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-Theoretic Limitations of Formal Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / 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: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical basis for information theory and probability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonalization in proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3072543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on SAT algorithms and proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Complexity / 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: Some consequences of cryptographical conjectures for \(S_2^1\) and EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conservation inequalities; information and independence in mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short propositional refutations for dense random 3CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113858283 / rank
 
Normal rank

Revision as of 21:37, 1 August 2024

scientific article; zbMATH DE number 7541925
Language Label Description Also known as
English
INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH
scientific article; zbMATH DE number 7541925

    Statements

    INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (English)
    0 references
    0 references
    15 June 2022
    0 references
    propositional proof systems
    0 references
    algorithmic information
    0 references
    proof search
    0 references

    Identifiers

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