The following pages link to A threshold for unsatisfiability (Q676451):
Displaying 50 items.
- The cook-book approach to the differential equation method (Q465658) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
- Random 2 XORSAT phase transition (Q627513) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- Weak lumpability in the \(k\)-SAT problem (Q1585561) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- A remark on random 2-SAT (Q1961467) (← links)
- Belief propagation on the random \(k\)-SAT model (Q2090606) (← links)
- A model of random industrial SAT (Q2118866) (← links)
- Super solutions of random \((3 + p)\)-SAT (Q2326395) (← links)
- Phase transition in a random NK landscape model (Q2389618) (← links)
- On the freezing of variables in random constraint satisfaction problems (Q2473356) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Resolution complexity of random constraint satisfaction problems: Another half of the story (Q2581550) (← links)
- An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- Delaying satisfiability for random 2SAT (Q2852549) (← links)
- On the concentration of the number of solutions of random satisfiability formulas (Q2930051) (← links)
- Rényi entropies as a measure of the complexity of counting problems (Q3301573) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- New Results on the Phase Transition for Random Quantified Boolean Formulas (Q3502691) (← links)
- Sharp thresholds for constraint satisfaction problems and homomorphisms (Q3608298) (← links)
- An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552) (← links)
- The phase transition in random horn satisfiability and its algorithmic implications (Q4543632) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- (Q4704799) (← links)
- GD-SAT model and crossover line (Q4784347) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825479) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825480) (← links)
- Branching Process Approach for 2-Sat Thresholds (Q4933200) (← links)
- The replica symmetric phase of random constraint satisfaction problems (Q4993097) (← links)
- (Q5091218) (← links)
- (Q5111724) (← links)
- Exact location of the phase transition for random (1,2)-QSAT (Q5245725) (← links)
