On the complexity of resolution with bounded conjunctions (Q1885907): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2004.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074946288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / 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: Q4411848 / 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: A combinatorial characterization of resolution width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Resolution and Davis--Putnam Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size space tradeoffs for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of random formulae in 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: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems / 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: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounds for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of treelike resolution space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / 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: A new proof of the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounds for a game on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short resolution proofs for a sequence of tricky formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 14:13, 7 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of resolution with bounded conjunctions
scientific article

    Statements

    On the complexity of resolution with bounded conjunctions (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2004
    0 references
    resolution
    0 references
    complexity of Proofs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers