Equivalence and isomorphism for boolean constraint satisfaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2471, Issue , 2002, Pages 412-426

  Böhler, Elmar ^a   Hemaspaandra, Edith ^b   Reith, Steffen ^c   Vollmer, Heribert ^d  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b Rochester Institute of Technology   (United States)

^c LengfelderStr 35b   (Germany)

^d LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; EQUIVALENCE CLASSES; POLYNOMIAL APPROXIMATION; SET THEORY;

BOOLEAN CONSTRAINT; CONSTRAINT SATISFACTION; DICHOTOMY THEOREM; EQUIVALENCE PROBLEM; FINITE SET; GRAPH ISOMORPHISM PROBLEM; ISOMORPHISM PROBLEMS; POLYNOMIAL-TIME;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947754513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_28     Document Type: Conference Paper

References (23)

1. M. Agrawal and T. Thierauf. The formula isomorphism problem. SIAM Journal on Computing, 30(3):990-1009, 2000.
2. K. S. Booth and C. J. Colbourn. Problems polynomially equivalent to graph isomorphism. Technical Report CS-77-01, University of Waterloo, 1979.
3. S. Buss and L. Hay. On truth-table reducibility to SAT. Information and Computation, 90(2):86-102, 1991.
4. B. Borchert, D. Ranjan, and F. Stephan. On the computational complexity of some classical equivalence relations on Boolean functions. Theory of Computing Systems, 31:679-693, 1998.
5. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125:1-12, 1996.
6. N. Creignou and J.-J. Hébrard. On generating all solutions of generalized satisfiability problems. Informatique Théorique et Applications/ Theoretical Informatics and Applications, 31(6):499-511, 1997.
7. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics. SIAM, 2000.
8. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51:511-522, 1995.
9. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6):1278-1304, 1995.
10. M. Fontet. Automorphismes de graphes et planarité. In Asterisque, pages 73-90. 1976.
11. L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39(3):299-322, 1989.
12. L. M. Kirousis and P.G. Kolaitis. The complexity of minimal satisfiability problems. In Proceedings 18th Symposium on Theoretical Aspects of Computer Science, volume 2010, pages 407-418. Springer Verlag, 2001.
13. J. Köbler, U. Schöning, and J. Torán. The Graph Isomorphism Problem: its Structureal Complexity. Progress in Theoretical Computer Science. Birkhäuser, 1993.
14. S. Khanna, M. Sudan, L. Trevisan, and D. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863-1920, 2001.
15. R. Ladner. On the structure of polynomial-time reducibility. Journal of the ACM, 22:155-171, 1975.
16. E. L. Post. Two-valued iterative systems of mathematical logic. In Annals of Math. Studies, volume 5. Princeton University Press, 1941.
17. C. Papadimitriou and S. Zachos. Two remarks on the power of counting. In Proceedings 6th GI Conference on Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, pages 269-276. Springer Verlag, 1983.
18. S. Reith. Generalized Satisfiability Problems. PhD thesis, University of Würzburg, 2001.
19. S. Reith and H. Vollmer. Optimal satisfiability for propositional calculi and constraint satisfaction problems. In Proceedings 25th International Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 640-649. Springer Verlag, 2000.
20. S. Reith and K. W. Wagner. The complexity of problems defined by Boolean circuits. Technical Report 255, Institut für Informatik, Universit ät Würzburg, 2000. To appear in Proceedings International Conference Mathematical Foundation of Informatics, Hanoi, October 25-28, 1999.
21. T. J. Schaefer. The complexity of satisfiability problems. In Proccedings 10th Symposium on Theory of Computing, pages 216-226. ACM Press, 1978.
22. J. Torán. On the hardness of graph isomorphism. In Proceedings 41st Foundations of Computer Science, pages 180-186, 2000. 414, 423
23. K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.