scientific article; zbMATH DE number 1500505

MaRDI QIDQ4501520zbMATH OpenFDO

Authors Pascal Koiran

Publication date 4 September 2000

zbMATH Keywords

algebraic complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 953010
• Complexity classes and completeness in algebraic geometry
• An introduction to geometric complexity theory
• scientific article; zbMATH DE number 1775437

Cited in

(6)

• VPSPACE and a transfer theorem over the complex field
• Transfer theorems via sign conditions
• Simulating probabilistic by deterministic algebraic computation trees
• Finding a vector orthogonal to roughly half a collection of vectors
• On topological lower bounds for algebraic computation trees
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals

This page was built for publication:

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