PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Frandsen, Gudmund Skovbjerg"

Author of the publication

copydeleteadd this publication to your clipboard
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate.

, and . J. Cryptology, 19 (4): 489-520 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Frandsen, Gudmund Skovbjerg
add a person with the name Frandsen, Gudmund Skovbjerg
 

Other publications of authors with the same name

Dynamic normal forms and dynamic characteristic polynomial., and . Theor. Comput. Sci., 412 (16): 1470-1483 (2011)An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate., and . J. Cryptology, 19 (4): 489-520 (2006)The Computational Complexity of Some Problems of Linear Algebra, , and . Electronic Colloquium on Computational Complexity (ECCC), (1997)Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers., and . J. Symb. Comput., 39 (6): 643-652 (2005)The Computational Complexity of Some Problems of Linear Algebra., , and . J. Comput. Syst. Sci., 58 (3): 572-596 (1999)The Complexity of Identifying Large Equivalence Classes., , , and . Fundam. Inform., 38 (1-2): 25-37 (1999)An Arithmetic Model of Computation Equivalent to Threshold Circuits., , and . Theor. Comput. Sci., 93 (2): 303-319 (1992)Dynamic Normal Forms and Dynamic Characteristic Polynomial., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 434-446. Springer, (2008)Lower Bounds for Dynamic Algebraic Problems., , and . STACS, volume 1563 of Lecture Notes in Computer Science, page 362-372. Springer, (1999)Lower Bounds for Dynamic Algebraic Problems., , and . Inf. Comput., 171 (2): 333-349 (2001)