A lower bound for tree resolution (Q1336637): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal switching circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / 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: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time analyses of simplified Davis-Putnam procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(94)90132-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085389157 / rank
 
Normal rank

Latest revision as of 12:16, 30 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for tree resolution
scientific article

    Statements

    A lower bound for tree resolution (English)
    0 references
    0 references
    3 November 1994
    0 references
    0 references
    bipartite graphs
    0 references
    0 references