Further improvements for SAT in terms of formula length (Q6077846): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4375756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound for SAT / 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: New worst-case upper bounds for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved SAT Algorithm in Terms of Formula Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dealing with 4-variables by resolution: an improved MaxSAT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for SAT in terms of formula length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Dominating Set Analyzed by the Potential Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure &amp; conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:04, 3 August 2024

scientific article; zbMATH DE number 7742416
Language Label Description Also known as
English
Further improvements for SAT in terms of formula length
scientific article; zbMATH DE number 7742416

    Statements

    Further improvements for SAT in terms of formula length (English)
    0 references
    0 references
    0 references
    27 September 2023
    0 references
    satisfiability
    0 references
    parameterized algorithms
    0 references
    measure-and-conquer
    0 references
    amortized analysis
    0 references
    worst-case analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers