26 search results - page 1 / 6 » The Complexity of Boolean Matrix Root Computation |
COCOON
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
NA
2010
13 years 3 months ago
2010
An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalu...
AMC
2007
13 years 5 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
ICDT
2010
ACM
13 years 9 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...