Pages that link to "Item:Q1198012"
From MaRDI portal
The following pages link to On the greedy algorithm for satisfiability (Q1198012):
Displaying 20 items.
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Some properties of sets tractable under every polynomial-time computable distribution (Q1350351) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- Sufficient conditions for the optimality of the greedy algorithm in greedoids (Q2168727) (← links)
- An algorithm for locating propagation source in complex networks (Q2232885) (← links)
- Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
- Hard random 3-SAT problems and the Davis-Putnam procedure (Q2674184) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition (Q2898000) (← links)
- A Theoretical Analysis of Search in GSAT (Q3637172) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- The probabilistic analysis of a greedy satisfiability algorithm (Q5486323) (← links)
