On the automatizability of resolution and related propositional proof systems (Q1881219): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2003.10.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2003.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049645218 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60512211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum propositional proof length is NP-hard to linearly approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-automatizability of bounded-depth Frege proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of size-width tradeoffs for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / 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: Near optimal seperation of tree-like and general resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound for the size of monotone real circuits / 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: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737159 / 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: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934563 / 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: Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2003.10.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:19, 16 December 2024

scientific article
Language Label Description Also known as
English
On the automatizability of resolution and related propositional proof systems
scientific article

    Statements

    On the automatizability of resolution and related propositional proof systems (English)
    0 references
    0 references
    0 references
    4 October 2004
    0 references
    propositional proof system
    0 references
    weak automatizability
    0 references
    satisfiability problem
    0 references
    resolution
    0 references
    proof complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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