×

Special issues on The satisfiability problem (pp. 1–244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29–May 3, 1996 and Boolean functions (pp. 245–479). (English) Zbl 0935.00027

The articles of this volume will be reviewed individually.
It consists of 13 papers from the First Workshop on Satisfiability, Certosa di Pontignano near Siena, Italy, 1996 and a sample of papers presented at several operations research conferences featuring special sessions on Boolean functions, EURO XIV and INFORMS.

MSC:

00B25 Proceedings of conferences of miscellaneous specific interest
03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
06-06 Proceedings, conferences, collections, etc. pertaining to ordered structures

Software:

Leibniz
PDFBibTeX XMLCite
Full Text: DOI

References:

[3] Dalal, M.; Etherington, D. W., A hierarchy of tractable satisfiability problems, Inform. Process. Lett., 44, 173-180 (1992) · Zbl 0774.68057
[4] Downey, R. G.; Fellows, M. R., Fixed parameter tractability and NP-completeness, Congressus Numeratum, 87, 161-178 (1992) · Zbl 0768.68136
[5] Gallo, G.; Scutella, M. G., Polynomially solvable satisfiability problems, Inform. Process. Lett., 29, 221-227 (1988) · Zbl 0662.68037
[7] Kleine Büning, H., On generalized Horn formulas and \(k\) resolution, Theoret. Comput. Sci., 116, 405-413 (1993) · Zbl 0786.03009
[8] Nešetřil, J.; Poljak, S., On the asymptotic complexity of matrix multiplication, Commentationes Mathematicae Unversitatis Carolinae, 26, 415-419 (1985) · Zbl 0571.05050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.