Amanote Research
Register
Sign In
On the Complexity of Polynomial Matrix Computations
doi 10.1145/860854.860889
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2003
Authors
Pascal Giorgi
Claude-Pierre Jeannerod
Gilles Villard
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
On the Bit Complexity of Solving Bilinear Polynomial Systems
Visualizing Sparse Matrix Computations
On the Computational Complexity of Matrix Semigroup Problems
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
The Polynomial Complexity of Fully Materialized Coalesced Cubes
Classical Simulation of Commuting Quantum Computations Implies Collapse of the Polynomial Hierarchy
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Mathematics
Engineering
Astronomy
Physics
Extracellular Matrix: Understanding the Complexity
Brazilian Journal of Medical and Biological Research
Immunology
Cell Biology
Pharmacology
Biochemistry
Biophysics
Neuroscience
Medicine
Toxicology
Physiology
Pharmaceutics
On a Solution of Skew Prime Polynomial Matrix Equation
Transactions of the Society of Instrument and Control Engineers
Wavelets, Signal Processing and Matrix Computations
