Pages that link to "Item:Q5494936"
From MaRDI portal
The following pages link to 3-SAT Faster and Simpler---Unique-SAT Bounds for PPSZ Hold in General (Q5494936):
Displaying 11 items.
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768) (← links)
- Super strong ETH is true for PPSZ with small resolution width (Q5092450) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- Walksat Stalls Well Below Satisfiability (Q5267998) (← links)
- On Super Strong ETH (Q5856463) (← links)
