Counting models for 2SAT and 3SAT formulae (Q1770390): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.tcs.2004.10.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139364539 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56288403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of solutions for instances of satisfiability / 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: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of models and satisfiability of sets of clauses / rank
 
Normal rank

Latest revision as of 20:15, 7 June 2024

scientific article
Language Label Description Also known as
English
Counting models for 2SAT and 3SAT formulae
scientific article

    Statements

    Counting models for 2SAT and 3SAT formulae (English)
    0 references
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    0 references
    Counting models
    0 references
    Satisfiability
    0 references
    Exponential-time algorithms
    0 references
    Exact algorithms
    0 references
    Upper bounds
    0 references
    0 references
    0 references