×

Found 27 Documents (Results 1–27)

Computational complexity of infinite-valued Łukasiewicz propositional logic. (English) Zbl 0990.03016

Chong, C. T. (ed.) et al., Proceedings of the 6th Asian logic conference, Beijing, China, May 20-24, 1996. Singapore: World Scientific. 273-284 (1998).
MSC:  03B50 03D15
PDFBibTeX XMLCite

Approximation algorithms for MaxSAT. (English) Zbl 0970.68119

Bank, Bernd (ed.) et al., 3rd international conference on approximation and optimization in the Caribbean, Puebla, México, October 8-13, 1995. México: Sociedad Matemática Mexicana. Aportaciones Mat., Comun. 24, 163-174 (1998).
MSC:  68R05 68T15
PDFBibTeX XMLCite
Full Text: EMIS

Optimizing OBDDs is still intractable for monotone functions. (English) Zbl 1031.68539

Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24-28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 625-635 (1998).
Reviewer: U.Schöning (Ulm)
MSC:  68Q25 94C10
PDFBibTeX XMLCite

Combinatorial optimization: algorithms and complexity. Corr. repr. of the 1982 original. (English) Zbl 0944.90066

Mineola, NY: Dover Publications, Inc. xvi, 496 p. (1998).
PDFBibTeX XMLCite

Approximation results for the optimum cost chromatic partition problem. (English) Zbl 0895.68098

Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 143-168 (1998).
MSC:  68R10
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 3

Main Field

Software