( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
SBSAT: a State-Based, BDD-Based Satisfiability Solver.

, , , , , , и . SAT, том 2919 из Lecture Notes in Computer Science, стр. 398-410. Springer, (2003)

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.

Franco Kämmer

Franco Nüske

Franco Nüske

Franco Caldarone

Franco Lehmann

 

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

Algorithms for the satisfiability (SAT) problem: A survey., , , и . Satisfiability Problem: Theory and Applications, том 35 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 19-151. DIMACS/AMS, (1996)Extending Existential Quantification in Conjunctions of BDDs., , и . J. Satisf. Boolean Model. Comput., 1 (2): 89-110 (2006)Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions.. SIGACT News, 17 (1): 40-59 (1985)Computing Well-founded Semantics Faster., , и . LPNMR, том 928 из Lecture Notes in Computer Science, стр. 113-126. Springer, (1995)ID* Lite: improved D* Lite algorithm., , , и . SAC, стр. 1364-1369. ACM, (2011)SBSAT: a State-Based, BDD-Based Satisfiability Solver., , , , , , и . SAT, том 2919 из Lecture Notes in Computer Science, стр. 398-410. Springer, (2003)Auditing a Software-Defined Cross Domain Solution Architecture., , , , и . CSR, стр. 96-103. IEEE, (2022)Costs of Quadtree Representation of Nondense Matrices., и . J. Parallel Distributed Comput., 9 (3): 282-296 (1990)Some interesting research directions in satisfiability.. Ann. Math. Artif. Intell., 28 (1-4): 7-15 (2000)Preface to the special issue.. Ann. Math. Artif. Intell., 61 (3): 155-157 (2011)