Constructive non-commutative rank computation is in deterministic polynomial time
Work
Year: 2018
Type: article
Source: Computational Complexity
Institutions Institute for Computer Science and Control, Hungarian Academy of Sciences, Centre for Quantum Computation and Communication Technology, University of Technology Sydney, Chennai Mathematical Institute
Cites: 27
Cited by: 54
Related to: 10
FWCI: 5.36
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed