8 citations · 16 across the 3 of their papers we have counts for
3 papers
math.CO2012
An Algorithmic Approach to the Extensibility of Association Schemes
Manuel Arora, Paul-Hermann Zieschang
An association scheme which is associated to a height t presuperscheme is said to be extensible to height t. Smith (1994, 2007) showed that an association scheme X=(Q,Γ) of order d…
cs.CC2012★ 8 cited
Deterministic Polynomial Factoring and Association Schemes
Manuel Arora, Gábor Ivanyos, Marek Karpinski +1
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this p…
cs.DS2009★ 8 cited
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the v…