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 Generalized Wong sequences and their applications to Edmonds' problems Ivanyos, Gábor et al. 2014
4 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: 4

DROPS-Home | Fulltext Search | Imprint Published by LZI