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