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

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

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

3 |
Boundaries of VP and VNP |
Grochow, Joshua A. et al. |
2016 |

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

5 |
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers |
Babai, László et al. |
2012 |

6 |
On Isomorphism Testing of Groups with Normal Hall Subgroups |
Qiao, Youming et al. |
2011 |

7 |
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs |
Jansen, Maurice et al. |
2010 |