Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time

Ivanyos, Gábor and Qiao, Y and Subrahmanyam, K V (2017) Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. In: 8th Innovations in Theoretical Computer Science Conference, (ITCS). Leibniz International Proceedings in Informatics (LIPIcs) (67). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 55:1-55:19. ISBN 978-3-95977-029-3 10.4230/LIPIcs.ITCS.2017.55

[img] Text
Ivanyos_55_3303801_ny.pdf

Download (598kB)
Item Type: Book Section
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: 05 Jan 2018 08:04
Last Modified: 05 Jan 2018 08:04
URI: http://eprints.sztaki.hu/id/eprint/9313

Update Item Update Item