Pages that link to "Item:Q1348911"
From MaRDI portal
The following pages link to A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (Q1348911):
Displaying 29 items.
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- An improved deterministic local search algorithm for 3-SAT (Q706635) (← links)
- Randomized algorithms for 3-SAT (Q870448) (← links)
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Improved agreeing-gluing algorithm (Q2254079) (← links)
- Sequential vector packing (Q2378514) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
- Exploiting partial knowledge of satisfying assignments (Q2643304) (← links)
- An improved local search algorithm for 3-SAT (Q3439130) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- Theory and Applications of Satisfiability Testing (Q5325857) (← links)
- Absorbing random walks and the NAE2SAT problem (Q5391499) (← links)
