Alternative polynomial equation approach to LQ discrete-time open-loop control
Václav Soukup (1997)
Kybernetika
Similarity:
Václav Soukup (1997)
Kybernetika
Similarity:
Vladimír Kučera (1994)
Kybernetika
Similarity:
Daniel J. Bernstein (2005)
Journal de Théorie des Nombres de Bordeaux
Similarity:
Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The speed of the Agrawal-Kayal-Saxena method depends on proven lower bounds for the size of the multiplicative semigroup generated by several polynomials modulo another polynomial . Voloch pointed out an application of the Stothers-Mason ABC theorem in this context: under mild assumptions, distinct polynomials of degree at most cannot all be congruent modulo . This paper presents two...