The state of SAT (Q2643296): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2006.10.004 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: PBS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Velev SAT Benchmarks / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PBLib / rank
 
Normal rank
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.dam.2006.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081692349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold in proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous results for random (\(2+p)\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic symmetry-breaking for Boolean satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formula Caching in DPLL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near optimal seperation of tree-like and general resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / 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: Statistical mechanics methods and phase transitions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems are sometimes hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions and the search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with an interior point algorithm on the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnosing multiple faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs for tricky formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limit of branching rules for hard random unsatisfiable 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal speedup of Las Vegas algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting complete techniques thanks to local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolants and Symbolic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search characteristics of incomplete SAT procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetry rule in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint tightness and looseness versus local and global consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete Lagrangian-based global-search method for solving satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase algorithm for solving a class of hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2006.10.004 / rank
 
Normal rank

Latest revision as of 12:16, 19 December 2024

scientific article
Language Label Description Also known as
English
The state of SAT
scientific article

    Statements

    The state of SAT (English)
    0 references
    0 references
    0 references
    23 August 2007
    0 references
    Boolean satisfiability
    0 references
    complexity
    0 references
    challenge problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers