New methods for 3-SAT decision and worst-case analysis (Q1960406): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two systems for proving tautologies, based on the split method / 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: Q4371411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A satisfiability tester for non-clausal propositional calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power indices and easier hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of extended resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721816 / 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: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Satisfiability with Less Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of models and satisfiability of sets of clauses / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(98)00017-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066749637 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
New methods for 3-SAT decision and worst-case analysis
scientific article

    Statements

    New methods for 3-SAT decision and worst-case analysis (English)
    0 references
    0 references
    12 January 2000
    0 references
    3-SAT
    0 references
    worst-case upper bounds
    0 references
    analysis of algorithms
    0 references
    extended resolution
    0 references
    blocked clauses
    0 references
    generalized autarkness
    0 references

    Identifiers