Space complexity of random formulae in resolution (Q4417005): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1002/rsa.10089 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974070050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity in propositional calculus / 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: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945238 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:02, 5 June 2024

scientific article; zbMATH DE number 1959946
Language Label Description Also known as
English
Space complexity of random formulae in resolution
scientific article; zbMATH DE number 1959946

    Statements

    Space complexity of random formulae in resolution (English)
    0 references
    0 references
    0 references
    6 August 2003
    0 references
    space complexity of refuting unsatisfiable random formulas
    0 references
    lower bounds on the clause space
    0 references
    treelike resolution refutations
    0 references
    matching games on bipartite graphs
    0 references

    Identifiers

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