The following pages link to D. Scheder (Q1728404):
Displaying 24 items.
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Recent studies of agent incentives in internet resource allocation and pricing (Q1728405) (← links)
- Recent studies of agent incentives in Internet resource allocation and pricing (Q2159522) (← links)
- On the Average Sensitivity and Density of k-CNF Formulas (Q2851894) (← links)
- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas (Q2872090) (← links)
- Unsatisfiable CNF Formulas contain Many Conflicts (Q2872092) (← links)
- Cryptogenography (Q2988864) (← links)
- Improving PPSZ for 3-SAT using critical variables (Q3113688) (← links)
- Unsatisfiable Linear CNF Formulas Are Large and Complex. (Q3113785) (← links)
- How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712) (← links)
- Partial Satisfaction of k-Satisfiable Formulas (Q3503510) (← links)
- Satisfiability with Exponential Families (Q3612463) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- Super strong ETH is true for PPSZ with small resolution width (Q5092450) (← links)
- (Q5111139) (← links)
- (Q5111416) (← links)
- PPSZ for <i>k</i> ≥ 5: More Is Better (Q5205821) (← links)
- A full derandomization of schöning's k-SAT algorithm (Q5419094) (← links)
- Guided Search and a Faster Deterministic Algorithm for 3-SAT (Q5458517) (← links)
- Exponential Lower Bounds for the PPSZ <i>k</i>-SAT Algorithm (Q5741800) (← links)
- (Q5875593) (← links)
- (Q6147535) (← links)
- PPSZ is better than you think (Q6566465) (← links)
- PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster (Q6655885) (← links)
