The complexity of Boolean matrix root computation

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

Volumn 2697, Issue , 2003, Pages 212-221

  Kutz, Martin ^a,b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b European Graduate School   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248891439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_23     Document Type: Article

References (19)

1. A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM Journal on Computing, 1(2):131-137, 1972.
2. Kellogg S. Booth. Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems. SIAM Journal on Computing, 7(3):273-279, 1978.
3. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, chapter 26. MIT Press, 1990.
4. Bart de Schutter and Bart de Moor. On the sequence of consecutive powers of a matrix in a Boolean algebra. SIAM Journal on Matrix Analysis and Applications, 21(1):328-354, 1999.
5. Pavol Hell and Jaroslav Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990.
6. Nicholas J. Higham. Newton's method for the matrix square root. Mathematics of Computation, 46(174):537-549, 1986.
7. C. R. Johnson, K. Okubo, and R. Reams. Uniqueness of matrix square roots and an application. Linear Algebra and Applications, 323:52-60, 2001.
8. Volker Kaibel and Alexander Schwartz. On the complexity of isomorphism problems related to polytopes. To appear in Graphs and Combinatorics.
9. Ki Hang Kim. Boolean matrix theory and applications. Marcel Dekker, Inc., 1982.
10. Johannes Köbler, Uwe Schöning, and Jacobo Torán. The graph isomorphism problem. Birkhäuser, 1993.
11. Ya Yan Lu. A Padé approximation method for square roots of symmetric positive definite matrices. SIAM Journal on Matrix Analysis and Applications, 19(3):833-845, 1998.
12. Anna Lubiw. Some NP-complete problems similar to graph isomorphism. SIAM Journal on Computing, 1981.
13. George Markowsky. Ordering D-classes and computing Shein rank is hard. Semi-group Forum, 44:373-375, 1992.
14. Rudolph Mathon. A note on the graph isomorphism counting problem. Information Processing Letters, 8(3):131-132, 1979.
15. Rajeev Motwani and Madhu Sudan. Computing roots of graphs is hard. Discrete Applied Mathematics, 54(1):81-88, 1994.
16. Ian Munro. Efficient determination of the transitive closure of a directed graph. Information Processing Letters, 1:56-58, 1971.
17. Panayiotis J. Psarrakos. On the mth roots of a complex matrix. The Electronic Journal of Linear Algebra, 9:32-41, 2002.
18. Kenneth A. Ross and Charles R. B. Wright. Discrete mathematics, chapter 7.5. Prentice-Hall, second edition, 1988.
19. Larry L. Stockmeyer. The minimal set basis problem is NP-complete. IBM Research Report No. RC-5431, IBM Thomas J. Watson Research Center, 1975.