Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/978-3-540-79719-7_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1558213091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bandwidth via volume respecting embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of graphs of bounded NLC-width (clique-width) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving #SAT Using Vertex Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Bounded Treewidth Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Propositional Model Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of the complete \(k\)-ary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tape Complexity of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank

Latest revision as of 10:52, 28 June 2024

scientific article
Language Label Description Also known as
English
Complexity and Algorithms for Well-Structured k-SAT Instances
scientific article

    Statements

    Complexity and Algorithms for Well-Structured k-SAT Instances (English)
    0 references
    27 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references