Pages that link to "Item:Q2487388"
From MaRDI portal
The following pages link to Algorithms for Sat and upper bounds on their complexity (Q2487388):
Displayed 9 items.
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- On complete one-way functions (Q734307) (← links)
- Min-wise independent groups (Q1413231) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- (Q5150602) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)