Identity Testing for Radical Expressions-Reference-Cited by-同舟云学术

Identity Testing for Radical Expressions

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Balaji Nikhil¹,Nosan Klara²,Shirmohammadi Mahsa²,Worrell James³

Affiliation:

1. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, India

2. Université Paris Cité, CNRS, IRIF, F-75013, Paris, France, France

3. Department of Computer Science, University of Oxford, United Kingdom

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3533331

Reference48 articles.

1. Primality and identity testing via Chinese remaindering

2. M. Agrawal N. Kayal and N. Saxena. 2004. PRIMES is in P. Annals of mathematics(2004) 781–793. M. Agrawal N. Kayal and N. Saxena. 2004. PRIMES is in P. Annals of mathematics(2004) 781–793.

3. S. Akshay , N. Balaji , A. Murhekar , R. Varma , and N. Vyas . 2020 . Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020 ). Schloss Dagstuhl-Leibniz-Zentrum für Informatik. S. Akshay, N. Balaji, A. Murhekar, R. Varma, and N. Vyas. 2020. Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

4. E. Allender P. Bürgisser J. Kjeldgaard-Pedersen and P. B. Miltersen. 2006. On the complexity of numerical analysis. In CCC ’06. 331–339. E. Allender P. Bürgisser J. Kjeldgaard-Pedersen and P. B. Miltersen. 2006. On the complexity of numerical analysis. In CCC ’06. 331–339.

5. V. Arvind and P. P. Kurur . 2003 . Upper Bounds on the Complexity of Some Galois Theory Problems. In Algorithms and Computation , 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings(Lecture Notes in Computer Science, Vol. 2906) . Springer, 716–725. V. Arvind and P. P. Kurur. 2003. Upper Bounds on the Complexity of Some Galois Theory Problems. In Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings(Lecture Notes in Computer Science, Vol. 2906). Springer, 716–725.

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

1. On the Order of Power Series and the Sum of Square Roots Problem;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

2. Identity Testing for Radical Expressions;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02