Change of order for bivariate triangular sets

DOI10.1145/1145768.1145814zbMATH Open1356.12013OpenAlexW2095715976MaRDI QIDQ2959000FDOQ2959000

Authors: Cyril Pascal, Éric Schost 

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1145768.1145814

Recommendations

• On the complexity of computing with zero-dimensional triangular sets
• Complexity results for triangular sets
• Change of order for regular chains in positive dimension
• Sharp estimates for triangular sets
• Change of ordering for regular chains in positive dimension

zbMATH Keywords

triangular setschange of order

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: factorization (12D05)

Cited In (13)

• Change of order for regular chains in positive dimension
• Sparse FGLM algorithms
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• Modular composition modulo triangular sets and applications
• Genus 2 point counting over prime fields
• Fast arithmetics in Artin-Schreier towers over finite fields
• Computing isomorphisms and embeddings of finite fields
• Bivariate polynomial reduction and elimination ideal over finite fields
• Change of ordering for regular chains in positive dimension
• Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
• Univariate real root isolation in an extension field and applications
• Elimination ideal and bivariate resultant over finite fields
• Computing Puiseux series: a fast divide and conquer algorithm

This page was built for publication: Change of order for bivariate triangular sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959000)