|
|
|
Recent SubmissionsEUCLIDEAN GCD ALGORITHM IS NOT OPTIMAL ON THE COMPLEXITY OF BILINEAR FORMS OVER ASSOCIATIVE ALGEBRAS OMEGA(log log(1/epsilon)) LOWER BOUND FOR APPROXIMATING THE SQUARE ROOT ON THE REGULAR REPRESENTATION OF ALGEBRAS A TIGHT BOUND FOR APPROXIMATING THE SQUARE ROOT
RSS Feeds
|
|||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||