Items where Subject is "68-XX Computer science > 68Txx Artificial intelligence > 68T15 Theorem proving (deduction, resolution, etc.)"

Group by: Authors | Item Type

Jump to: B | H

Number of items at this level: 3.

B

Böhm, Max and Speckenmeyer, Ewald (1996) A Fast Parallel SAT-Solver - Efficient Workload Balancing.
Published in: Annals of Mathematics and Artificial Intelligence Vol. 17 (2). pp. 381-400.

Heusch, Peter (1995) The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Published In: Mathematical foundations of computer science 1995 : 20th international symposium ; proceedings, Lecture notes in computer science. 969 Springer 1995, pp. 221-226.

Heusch, Peter (1999) The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Published in: Discrete Applied Mathematics Vol. 96-97. pp. 127-138.

This list was generated on Mon Sep 20 18:24:14 2021 CEST.

Export as	Atom RSS 1.0 RSS 2.0