The following pages link to (Q4375756):
Displaying 37 items.
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions (Q396606) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- A weight-balanced branching rule for SAT (Q597527) (← links)
- An improved generator for 3-CNF formulas (Q827897) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Backdoor sets for DLL subsolvers (Q862400) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
- Complete on average Boolean satisfiability (Q1872642) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- The state of SAT (Q2643296) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System (Q3100320) (← links)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)
- (Q5109519) (← links)
- (Q5150405) (← links)
- (Q5150520) (← links)
- Finding Effective SAT Partitionings Via Black-Box Optimization (Q5153508) (← links)
- Survey propagation: An algorithm for satisfiability (Q5318246) (← links)
- Threshold values of random <i>K</i>‐SAT from the cavity method (Q5471051) (← links)
- On Super Strong ETH (Q5856463) (← links)
- Satisfiability threshold for power law random 2-SAT in configuration model (Q5896832) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)
