Invariant and geometric aspects of algebraic complexity theory. I

DOI10.1016/S0747-7171(08)80115-0zbMath0735.68033MaRDI QIDQ1176389

Jacques Morgenstern

Publication date: 25 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

lower boundstheory of invariantscomputational networks

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Geometric invariant theory (14L24) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Configuration theorems in linear incidence geometry (51A20) Exterior algebra, Grassmann algebras (15A75)

Related Items

Model checking abilities of agents: a closer look

Cites Work

• Lower bounds for polynomials with algebraic coefficients
• Multilinear Cayley factorization
• Determinantal rings
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Addition requirements for matrix and transposed matrix products
• On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
• Superconcentrators
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On the number of multiplications necessary to compute certain functions
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item