| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras | Ivanyos, Gábor et al. | 2022 |
| 2 | On Learning Linear Functions from Subset and Its Applications in Quantum Computing | Ivanyos, Gábor et al. | 2018 |
| 3 | Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time | Ivanyos, Gábor et al. | 2017 |
| 4 | On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz | Belovs, Aleksandrs et al. | 2017 |
| 5 | Generalized Wong sequences and their applications to Edmonds' problems | Ivanyos, Gábor et al. | 2014 |
| 6 | New bounds on the classical and quantum communication complexity of some graph properties | Ivanyos, Gábor et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |