Finding Effective SAT Partitionings Via Black-Box Optimization
From MaRDI portal
Recommendations
- On black-box optimization in divide-and-conquer SAT solving
- Black-box optimization in an extended search space for SAT solving
- Partitioning SAT instances for distributed solving
- Partitioning methods for satisfiability testing on large formulas
- Partitioning methods for satisfiability testing on large formulas
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- Algebraic Cryptanalysis
- ALIAS: a modular tool for finding backdoors for SAT
- Attacking Bivium Using SAT Solvers
- Automatic search of attacks on round-reduced AES and applications
- Black-box optimization in an extended search space for SAT solving
- Contradiction immunity and guess-then-determine attacks on GOST
- Decomposition representations of logical equations in problems of inversion of discrete functions
- Derivative-free and blackbox optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Error detecting and error correcting codes
- Future paths for integer programming and links to artificial intelligence
- Handbook of parallel constraint reasoning
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 4050837 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1113991 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 1759258 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- Limitations of restricted branching in clause learning
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- ManySAT: a parallel SAT solver
- New stream cipher designs. The eSTREAM finalists
- Optimization by simulated annealing
- Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system
- Partitioning SAT instances for distributed solving
- PSATO: A distributed propositional prover and its application to quasigroup problems
- Pseudo-Boolean optimization
- Selected areas in cryptography. 14th international workshop, SAC 2007, Ottawa, Canada, August 16--17, 2007. Revised selected papers
- Simulating circuit-level simplifications on CNF
- Software verification for weak memory via program transformation
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Temporal induction by incremental SAT solving
- The complexity of theorem-proving procedures
- The Monte Carlo Method
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
- Trivium
- URSA: a system for uniform reduction to SAT
Cited in
(2)
This page was built for publication: Finding Effective SAT Partitionings Via Black-Box Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5153508)
