On the computational complexity of some classical equivalence relations on Boolean functions

Theory of Computing Systems

Volumn 31, Issue 6, 1998, Pages 679-693

  Borchert, B ^a   Ranjan, D ^b   Stephan, F ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SET THEORY;

COMPUTATIONAL PROBLEM; EQUIVALENCE RELATIONS; POLYNOMIAL-TIME;

FUNCTIONS;

EID: 0032354352     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000109     Document Type: Article

References (21)

1. M. Agrawal, T. Thierauf. The Boolean Isomorphism Problem, Proceedings of the 37th Symposium on Foundations of Computer Science (FOCS), pp. 422-430, 1996; ECCC Report TR-96-032.
2. A. Blass, Y. Gurevich. On the unique satisfiability problem, Information and Control 55 (1982), 80-88.
3. B. Borchert, L. A. Hemaspaandra, J. Rothe. Powers-of-two acceptance suffices tor equivalence and bounded ambiguity problems, submitted, 1996.
4. 2-Complete, Technical Report MPI-I-93-I21, MPI, Saarbrücken, 1993.
5. R. Chang, J. Kadin. On the Structure of Uniquely Satisfiable Formulas, Technical Report 90-1 124, Cornell University, 1990.
6. W. K. Clifford. On the Types of Compound Statement Involving Four Classes, Memoirs of the Literary and Philosophical Society of Manchester, Volume 16, No. 7, 1876-77, pp. 88-101. Reprint 1968: Chelsea, New York. Also in W. K. Clifford, Mathematical Papers, London, 1882, pp. 1-16.
7. W. K. Clifford. On the Types of Compound Statement Involving Four Classes, Memoirs of the Literary and Philosophical Society of Manchester, Volume 16, No. 7, 1876-77, pp. 88-101. Reprint 1968: Chelsea, New York. Also in W. K. Clifford, Mathematical Papers, London, 1882, pp. 1-16.
8. M. R. Garey, D. S. Johnson. Computers and Intractability, Freeman, San Francisco, 1978.
9. M. A. Harrison, The number of transitivity set of Boolean functions, Journal of SIAM 11(3) (1963), 806-828.
10. M. A. Harrison. On the classification of Boolean functions by the general linear and affine groups, Journal of SIAM 12(2) (1964), 285-299
11. M. A. Harrison. Counting theorems and their applications to classification of switching functions, A. Mukhopadyay, ed., in: Recent Developments in Switching Theory. Academic Press, New York, 1971, pp. 85-120.
12. W. S. Jevons. The Principles of Sciences, London, 1874 (in the second edition. London and New York, 1892, see pp. 134-146).
13. R. Karp. Reducibility among combinatorial problems, in: R. E. Miller and J. W. Thatcher, eds., Complexity of Computer Computation, Plenum, New York, 1972, pp. 85-103.
14. J. Köbler, U. Schöning, J. Toran. The Graph Isomorphism Problem: Its Structural Complexity, Birkhäuser Verlag, Basel, 1993.
15. C. Papadimitriou. Computational Complexity, Addison-Wesley, Reading, Massachusetts, 1994.
16. G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Mathematica 68 (1937), 145-254.
17. G. Pólya. Sur les types des propositions composées, Journal of Symbolic Logic 5(3) (1940), 98-103.
18. C. E. Shannon. The synthesis of two terminal switching circuits, Bell Systems Technical Journal 28 (1949), 59-98 (see pp. 91-97).
19. T. Thierauf. The Computational Complexity of Equivalence and Isomorphism Problems, Habilitationsschrift, Fakultät für Informatik, Universität Ulm, 1997.
20. K. Wagner. The complexity of combinatorial problems with succinct input representation, Acta Informatica 23 (1986), 131-147.
21. I. Wegener. The Complexity of Boolean Functions, Teubner, Stuttgart, 1987.