The Complexity of Boolean Constraint Isomorphism-Reference-Cited by-同舟云学术

The Complexity of Boolean Constraint Isomorphism

Published:2004 Issue: Volume: Page:164-175
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Böhler Elmar,Hemaspaandra Edith,Reith Steffen,Vollmer Heribert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24749-4_15

Reference31 articles.

1. Arvind, V., Kurur, P.: Graph isomorphism is in SPP. In: Proceedings 43rd Symposium on Foundations of Computer Science, pp. 743–750. IEEE Computer Society Press, Los Alamitos (2002)

2. Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM Journal on Computing 30(3), 990–1009 (2000)

3. Lecture Notes in Computer Science;E. Böhler,2002

4. Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: Proceedings 33rd Symposium on Theory of Computing, pp. 667–674. ACM Press, New York (2001)

5. Borchert, B., Ranjan, D., Stephan, F.: On the computational complexity of some classical equivalence relations on Boolean functions. Theory of Computing Systems 31, 679–693 (1998)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Isomorphism Problem for Decision Trees and Decision Lists;Fundamentals of Computation Theory;2013

2. Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?;Complexity of Constraints;2008

3. Isomorphic Implication;Theory of Computing Systems;2007-09-14

4. Isomorphic Implication;Mathematical Foundations of Computer Science 2005;2005

5. The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups;Lecture Notes in Computer Science;2004