Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleApril 2024
Faster Modular Composition
Journal of the ACM (JACM), Volume 71, Issue 2Article No.: 11, Pages 1–79https://doi.org/10.1145/3638349A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by n, the algorithm uses O(n1.43) field operations, breaking through the 3/2 ...
- research-articleJanuary 2017
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
Journal of the ACM (JACM), Volume 63, Issue 6Article No.: 48, Pages 1–37https://doi.org/10.1145/2996450A roadmap for a semi-algebraic set S is a curve which has a non-empty and connected intersection with all connected components of S. Hence, this kind of object, introduced by Canny, can be used to answer connectivity queries (with applications, for ...
- research-articleMarch 2011
Symbolic decision procedure for termination of linear programs
Formal Aspects of Computing (FAC), Volume 23, Issue 2Pages 171–190https://doi.org/10.1007/s00165-009-0144-5AbstractTiwari proved that the termination of a class of linear programs is decidable in Tiwari (Proceedings of CAV’04. Lecture notes in computer science, vol 3114, pp 70–82, 2004). The decision procedure proposed therein depends on the computation of ...
- articleMay 2007
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
ACM Transactions on Algorithms (TALG), Volume 3, Issue 2Pages 18–eshttps://doi.org/10.1145/1240233.1240241We introduce the class of nested polynomially recurrent sequences which includes a large number of sequences that are of combinatorial interest. We present an algorithm for deciding zero equivalence of these sequences, thereby providing a new algorithm ...
