Amanote Research
Register
Sign In
On the Bit Complexity of Solving Bilinear Polynomial Systems
doi 10.1145/2930889.2930919
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2016
Authors
Ioannis Z. Emiris
Angelos Mantzaflaris
Elias Tsigaridas
Publisher
ACM Press
Related search
On the Complexity Exponent of Polynomial System Solving
Foundations of Computational Mathematics
Mathematics
Computational Mathematics
Applied Mathematics
Analysis
Computational Theory
Real Solving of Bivariate Polynomial Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Complexity of Solving Tropical Linear Systems
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Complexity of Polynomial Matrix Computations
Sharper Complexity Bounds for Zero-Dimensional Gröbner Bases and Polynomial System Solving
International Journal of Algebra and Computation
Mathematics
On the Stability of Bilinear Stochastic Systems
The Polynomial Complexity of Fully Materialized Coalesced Cubes
Stabilizability of Second-Order Bilinear Systems
IEEE Transactions on Automatic Control
Control
Systems Engineering
Computer Science Applications
Electrical
Electronic Engineering
