An improved upper bound for SAT
type: Item
instance of: scholarly article
title: An improved upper bound for SAT
author: Huairui Chu
author: Mingyu Xiao
author: Zhe Zhang
published in: Theoretical Computer Science
publication date: 2021-09-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/2007.03829
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7401208
zbMATH Keywords: SAT
zbMATH Keywords: exact algorithms
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: amortized analysis
MaRDI profile type: Publication
OpenAlex ID: W3179743149
cites work: An Improved SAT Algorithm in Terms of Formula Length
cites work: The complexity of theorem-proving procedures
cites work: Two systems for proving tautologies, based on the split method
cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
cites work: STACS 2004
cites work: Theory and Applications of Satisfiability Testing
cites work: A Computing Procedure for Quantification Theory
cites work: Exact exponential algorithms.
cites work: Q4198056
cites work: A satisfiability tester for non-clausal propositional calculus
cites work: Faster k -SAT algorithms using biased-PPSZ
cites work: Q4250220
cites work: New worst-case upper bounds for SAT
cites work: On the complexity of \(k\)-SAT
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: Q4747916
cites work: An efficient fixed-parameter algorithm for 3-hitting set
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: An algorithm for the satisfiability problem of formulas in conjunctive normal form
cites work: Algorithms and Computation
DOI: 10.1016/J.TCS.2021.06.045
description: scientific article; zbMATH DE number 7401208