( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search.

, , , , , , , и . Theor. Comput. Sci., 289 (1): 69-83 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Edward Fischer

Edward Sobel

Edward Totten

Edward Zahn

Edward Haub

 

Другие публикации лиц с тем же именем

A better-than-3n lower bound for the circuit complexity of an explicit function., , , и . Electron. Colloquium Comput. Complex., (2015)On the Limits of Gate Elimination., , , и . MFCS, том 58 из LIPIcs, стр. 46:1-46:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the probabilistic closure of the loose unambiguous hierarchy., и . Inf. Process. Lett., 115 (9): 725-730 (2015)Proving Unsatisfiability with Hitting Formulas., , , , и . ITCS, том 287 из LIPIcs, стр. 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)UnitWalk: A new SAT solver that uses local search guided by unit clause elimination., и . Ann. Math. Artif. Intell., 43 (1): 91-111 (2005)A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function., , , и . FOCS, стр. 89-98. IEEE Computer Society, (2016)On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity., и . STACS, том 5 из LIPIcs, стр. 453-464. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Exponential Lower Bound for Static Semi-algebraic Proofs., , и . ICALP, том 2380 из Lecture Notes in Computer Science, стр. 257-268. Springer, (2002)An Infinitely-Often One-Way Function Based on an Average-Case Assumption., и . WoLLIC, том 5110 из Lecture Notes in Computer Science, стр. 208-217. Springer, (2008)Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination., и . CP, том 2239 из Lecture Notes in Computer Science, стр. 605-609. Springer, (2001)