scientific article; zbMATH DE number 1775437

MaRDI QIDQ4542570zbMATH OpenFDO

Authors Hervé Fournier, Pascal Koiran

Publication date 1 August 2002

zbMATH Keywords

algebraic complexityalgebraic models of computation

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 176763
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• Lower bounds for arithmetic networks
• An alternative to Ben-Or's lower bound for the knapsack problem complexity
• scientific article; zbMATH DE number 176871

Cited in

(14)

• Saturation and stability in the theory of computation over the reals
• Nearly sharp complexity bounds for multiprocessor algebraic computations
• On the computational structure of the connected components of a hard problem
• Where are the hard knapsack problems?
• Lower bounds for arithmetic networks
• Some aspects of studying an optimization or decision problem in different computational models
• Topological complexity of the range searching
• Finding a vector orthogonal to roughly half a collection of vectors
• scientific article; zbMATH DE number 1670874 (Why is no real title available?)
• scientific article; zbMATH DE number 176763 (Why is no real title available?)
• scientific article; zbMATH DE number 176871 (Why is no real title available?)
• scientific article; zbMATH DE number 1500505 (Why is no real title available?)
• Interpolation in Valiant's theory
• scientific article; zbMATH DE number 1559536 (Why is no real title available?)

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 Q4542570)