Pages that link to "Item:Q3191968"
From MaRDI portal
The following pages link to Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (Q3191968):
Displayed 23 items.
- The cook-book approach to the differential equation method (Q465658) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- Analysis of greedy algorithms on graphs with bounded degrees (Q1417582) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← 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)
- Super solutions of random \((3 + p)\)-SAT (Q2326395) (← links)
- Phase transition in a random NK landscape model (Q2389618) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- Space complexity of random formulae in resolution (Q4417005) (← links)
- Branching Process Approach for 2-Sat Thresholds (Q4933200) (← links)
- On the Method of Typical Bounded Differences (Q5366890) (← links)
- Almost all graphs with average degree 4 are 3-colorable (Q5917586) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Random 2-SAT: Results and problems (Q5958804) (← links)
- Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805) (← links)
- Lower bounds for random 3-SAT via differential equations (Q5958806) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)