Selecting Complementary Pairs of Literals
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2002309
- Completeness using pairs of filters
- Matching points in compositions and words
- On compatible matchings
- On Compatible Matchings
- Optimal Pairings
- Complements and consistent closures
- Advances in Cryptology – CRYPTO 2004
- Combinatorial properties of texts
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
Cites work
- scientific article; zbMATH DE number 437557 (Why is no real title available?)
- scientific article; zbMATH DE number 1246225 (Why is no real title available?)
- scientific article; zbMATH DE number 1246231 (Why is no real title available?)
- scientific article; zbMATH DE number 1256700 (Why is no real title available?)
- scientific article; zbMATH DE number 1947423 (Why is no real title available?)
- scientific article; zbMATH DE number 2119678 (Why is no real title available?)
- scientific article; zbMATH DE number 1445295 (Why is no real title available?)
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
- A threshold for unsatisfiability
- Analysis of Two Simple Heuristics on a Random Instance ofk-sat
- Approximating the unsatisfiability threshold of random formulas
- Approximation algorithms for combinatorial problems
- Bounding the unsatisfiability threshold of random 3-SAT
- Differential equations for random processes and random graphs
- Lower bounds for random 3-SAT via differential equations
- On Random 3-sat
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- Random k-SAT: A tight threshold for moderately growing k
- Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
- Sharp thresholds of graph properties, and the k-sat problem
- Tail bounds for occupancy and the satisfiability threshold conjecture
- The unsatisfiability threshold revisited
Cited in
(13)- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- Solution clustering in random satisfiability
- Toward a model for backtracking and dynamic programming
- Random k-SAT and the power of two choices
- On the lower bounds of \((1, 0)\)-super solutions for random \(k\)-SAT
- Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs
- On the solution-space geometry of random constraint satisfaction problems
- Polarised random k-SAT
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- Regular random \(k\)-SAT: Properties of balanced formulas
- New models for generating hard random Boolean formulas and disjunctive logic programs
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
This page was built for publication: Selecting Complementary Pairs of Literals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439115)
