No. |
Title |
Author |
Year |
---|

1 |
On Learning Linear Functions from Subset and Its Applications in Quantum Computing |
Ivanyos, Gábor et al. |
2018 |

2 |
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time |
Ivanyos, Gábor et al. |
2017 |

3 |
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz |
Belovs, Aleksandrs et al. |
2017 |

4 |
Generalized Wong sequences and their applications to Edmonds' problems |
Ivanyos, Gábor et al. |
2014 |

5 |
New bounds on the classical and quantum communication complexity of some graph properties |
Ivanyos, Gábor et al. |
2012 |