Absolute primality of polynomials is decidable in random polynomial time in the number of variables
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An efficient quantifier elimination algorithm for algebraically closed fields of any characteristicACM SIGSAM Bulletin, 1975
- Constructions in algebraTransactions of the American Mathematical Society, 1974
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926