scientific article; zbMATH DE number 1113991
From MaRDI portal
Publication:4375756
zbMATH Open0889.68073MaRDI QIDQ4375756FDOQ4375756
Authors: David G. Mitchell, Stephen Cook 
Publication date: 2 June 1998
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Complexity of proofs (03F20)
Cited In (65)
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Generating hard satisfiability problems
- Computational experience with an interior point algorithm on the satisfiability problem
- The state of SAT
- A taxonomy of exact methods for partial Max-SAT
- Diophantine cryptography over infinite groups
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability
- Locally consistent constraint satisfaction problems
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- Title not available (Why is that?)
- A fast algorithm for SAT in terms of formula length
- Unique solution instance generation for the 3-satisfiability (3SAT) problem
- Feasibly constructive proofs of succinct weak circuit lower bounds
- Fractional Edge Cover Number of Model RB
- Balance and filtering in structured satisfiable problems. (Preliminary report)
- Large hypertree width for sparse random hypergraphs
- Title not available (Why is that?)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms
- Title not available (Why is that?)
- On black-box optimization in divide-and-conquer SAT solving
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- Finding Effective SAT Partitionings Via Black-Box Optimization
- Experimental results on the crossover point in random 3-SAT
- Toward a model for backtracking and dynamic programming
- A note on SAT algorithms and proof complexity
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Principles and Practice of Constraint Programming – CP 2004
- Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
- An improved generator for 3-CNF formulas
- Title not available (Why is that?)
- Complete on average Boolean satisfiability
- Generating Difficult CNF Instances in Unexplored Constrainedness Regions
- A weight-balanced branching rule for SAT
- Hard satisfiable 3-SAT instances via autocorrelation
- Backdoors to satisfaction
- Title not available (Why is that?)
- Hard random 3-SAT problems and the Davis-Putnam procedure
- Theory and Applications of Satisfiability Testing
- Partition-based logical reasoning for first-order and propositional theories
- Rigorous results for random (\(2+p)\)-SAT
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- Survey propagation: An algorithm for satisfiability
- On super strong ETH
- Easy problems are sometimes hard
- Circuit lower bounds in bounded arithmetics
- Backdoor sets for DLL subsolvers
- Some pitfalls for experimenters with random SAT
- Simple search methods for finding a Nash equilibrium
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Threshold values of random K‐SAT from the cavity method
- SOFSEM 2004: Theory and Practice of Computer Science
- Title not available (Why is that?)
- A remark on pseudo proof systems and hard instances of the satisfiability problem
- Principles and Practice of Constraint Programming – CP 2004
- Hierarchical Hardness Models for SAT
- Title not available (Why is that?)
- Satisfiability threshold for power law random 2-SAT in configuration model
- Technology for translating combinatorial problems into Boolean equations
- Sgen1, a generator of small but difficult satisfiability benchmarks
- Locality and hard SAT-instances
- Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system
- Many hard examples in exact phase transitions
- Further improvements for SAT in terms of formula length
- Title not available (Why is that?)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375756)
