Pages that link to "Item:Q5958806"
From MaRDI portal
The following pages link to Lower bounds for random 3-SAT via differential equations (Q5958806):
Displayed 22 items.
- The cook-book approach to the differential equation method (Q465658) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- On the thresholds in linear and nonlinear Boolean equations (Q614622) (← 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)
- Structure of large random hypergraphs (Q1774214) (← links)
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- The design of novel distributed protocols from differential equations (Q1954235) (← links)
- Destruction of dissipative structures under random actions (Q2276505) (← links)
- Phase transition in a random NK landscape model (Q2389618) (← 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)
- Random <i>k</i> -SAT and the power of two choices (Q3192377) (← links)
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story (Q3439112) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- An identity derived from the solution of a class of differential equations for the evolution of a key agreement protocol (Q4648988) (← links)
- Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems (Q5958810) (← links)