Absolute primality of polynomials is decidable in random polynomial time in the number of variables-Reference-Cited by-同舟云学术

Absolute primality of polynomials is decidable in random polynomial time in the number of variables

Published:1981 Issue: Volume: Page:16-28
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Heintz Joos,Sieveking Malte

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10843-2_2.pdf

Reference10 articles.

1. Heintz, J.: Definability Bounds of First Order Theories of Algebraically Closed Fields (Abstract). Proc. Fundamentals of Computation Theory FCT'79 (1979), p. 160–166.

2. ": " (1977) (unpublished).

3. ": Towards a Decision Procedure for Prime Ideals in Polynomial Rings. Report on the 1979 Oberwolfach Conference on Complexity Theory, (1979).

4. ", Schnorr, C.P.: Testing Polynomials which are Easy to Compute. 12 th Annual Symp. ACM on Computing, (1980), p. 262–272.

5. ", Wüthrich, R.: An Efficient Quantifier Elimination Algorithm for Algebraically Closed Fields of Any Characteristic. SIGSAM Bull. Vol. 9, No 4, (1975), p. 11.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variety Evasive Subspace Families;computational complexity;2024-07-16

2. New Absolute Irreducibility Testing Criteria and Factorization of Multivariate Polynomials;Springer Proceedings in Mathematics & Statistics;2024

3. Cryptography;Handbook of Finite Fields;2013-06-17

4. Lifting and recombination techniques for absolute factorization;Journal of Complexity;2007-06

5. Functional programming concepts and straight-line programs in computer algebra;Mathematics and Computers in Simulation;2002-10