Experimental comparison of 2-satisfiability algorithms
Rossella Petreschi, Bruno Simeone (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the average case complexity of some P-complete problems”
Experimental comparison of 2-satisfiability algorithms
Combinatorial analysis of quicksort algorithm
P. Hennequin (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On schemata and systems for parallel algorithms
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The theory of invertible algorithms
Gianni Aguzzi (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
Jean-Luc Lutton, Ernesto Bonomi (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: