Pages that link to "Item:Q3581497"
From MaRDI portal
The following pages link to Solving random satisfiable 3CNF formulas in expected polynomial time (Q3581497):
Displaying 10 items.
- On the security of Goldreich's one-way function (Q430847) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
- A spectral technique for random satisfiable 3CNF formulas (Q3514702) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q5148942) (← links)
- A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)
- On Super Strong ETH (Q5856463) (← links)