A feasibly constructive lower bound for resolution proofs (Q915457): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Stephen A. Cook / rank
Normal rank
 
Property / author
 
Property / author: Stephen A. Cook / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / 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/0020-0190(90)90141-j / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049059582 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 30 July 2024

scientific article
Language Label Description Also known as
English
A feasibly constructive lower bound for resolution proofs
scientific article

    Statements

    A feasibly constructive lower bound for resolution proofs (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    lower bound
    0 references
    resolution
    0 references
    constructive proof
    0 references
    polynomial time
    0 references
    0 references