The Complexity of Boolean Matrix Root Computation
From MaRDI portal
Publication:3082929
DOI10.1007/3-540-45071-8_23zbMath1276.68082OpenAlexW4230970195MaRDI QIDQ3082929
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45071-8_23
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Matrices of integers (15B36) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Semigroups (20M99)
This page was built for publication: The Complexity of Boolean Matrix Root Computation