Constructive non-commutative rank computation is in deterministic polynomial time
Ivanyos, Gábor and Qiao, Y. and Subrahmanyam, K.V. (2018) Constructive non-commutative rank computation is in deterministic polynomial time. COMPUTATIONAL COMPLEXITY, 27 (4). pp. 561-593. ISSN 1016-3328 10.1007/s00037-018-0165-7
|
Text
Ivanyos_561_30348632_ny.pdf Download (287kB) | Preview |
Official URL: http://arxiv.org/abs/1512.03531
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 08 Jan 2019 10:12 |
| Last Modified: | 21 Jul 2019 13:34 |
| URI: | https://eprints.sztaki.hu/id/eprint/9548 |
 |
Update Item |
