( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length.

, и . J. Satisf. Boolean Model. Comput., 1 (1): 49-60 (2006)

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.

Hedwig Wolpert

Friedrich Wölpert

Antonia Wolpert

Claus Wolpert

Alfred Wolpert

 

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

Population Variance under Interval Uncertainty: A New Algorithm., , , и . Reliab. Comput., 12 (4): 273-280 (2006)Similarity Between Points in Metric Measure Spaces., и . SISAP, том 12440 из Lecture Notes in Computer Science, стр. 177-184. Springer, (2020)On Moderately Exponential Time for SAT., и . SAT, том 6175 из Lecture Notes in Computer Science, стр. 313-325. Springer, (2010)An Improved Upper Bound for SAT., и . SAT, том 3569 из Lecture Notes in Computer Science, стр. 400-407. Springer, (2005)Algorithms for SAT Based on Search in Hamming Balls., , и . STACS, том 2996 из Lecture Notes in Computer Science, стр. 141-151. Springer, (2004)Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms., , и . CIAC, том 3998 из Lecture Notes in Computer Science, стр. 60-68. Springer, (2006)On quantum versions of record-breaking algorithms for SAT., , и . SIGACT News, 36 (4): 103-108 (2005)A Robust Dna Computation Model That Captures Pspace., и . Int. J. Found. Comput. Sci., 14 (5): 933- (2003)An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF., и . J. Satisf. Boolean Model. Comput., 14 (1): 1-15 (2023)Algorithms for SAT based on search in Hamming balls, , и . Electron. Colloquium Comput. Complex., (2003)