TU Darmstadt / ULB / TUbiblio

The 2-SAT Problem of Regular Signed CNF Formulas

Beckert, Bernhard and Hähnle, Reiner and Manya, Felip (2000):
The 2-SAT Problem of Regular Signed CNF Formulas.
In: Proc. 30th International Symposium on Multiple-Valued Logics, Portland/OR, USA, pp. 331--336,
IEEE CS Press, Los Alamitos, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2000
Creators: Beckert, Bernhard and Hähnle, Reiner and Manya, Felip
Title: The 2-SAT Problem of Regular Signed CNF Formulas
Language: German
Title of Book: Proc. 30th International Symposium on Multiple-Valued Logics, Portland/OR, USA
Publisher: IEEE CS Press, Los Alamitos
Divisions: 20 Department of Computer Science > Software Engineering
20 Department of Computer Science
Date Deposited: 31 Dec 2016 10:40
Identification Number: BHM99c
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details