Constructive non-commutative rank computation is in deterministic polynomial time.

Gábor Ivanyos Youming Qiao K. V. Subrahmanyam

Published in: Comput. Complex. (2018)

Keyphrases

special case
efficient computation
turing machine
computational complexity
data sets
databases
query language
linear programming
rank order