Circuits versus Trees in Algebraic Complexity

Authors:
Pascal Koiran
Affiliations:
-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 25
Cited 3

Parallel arithmetic computations: a survey

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
On the topology of algorithms, I

Journal of Complexity
Fast algorithms for N-dimensional restrictions of hard problems

Journal of the ACM (JACM)
Structural complexity 1

Structural complexity 1
Complexity of deciding Tarski algebra

Journal of Symbolic Computation
A note on a P ≠ NP result for a restricted class of real machines

Journal of Complexity
Point location in arrangements of hyperplanes

Information and Computation
Computing over the reals with addition and order

Selected papers of the workshop on Continuous algorithms and complexity
Accessible telephone directories

Journal of Symbolic Logic
On Computing Algebraic Functions using Logarithms andExponentials

SIAM Journal on Computing
Computing over the reals with addition and order: higher complexity classes

Journal of Complexity
Complexity lower bounds for computation trees with elementary transcendental function gates

Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)
On the Power of Real Turing Machines over Binary Inputs

SIAM Journal on Computing
A weak version of the Blum, Shub, and Smale model

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Complexity and real computation

Complexity and real computation
Elimination of constants from machines over algebraically closed fields

Journal of Complexity
Are lower bounds easier over the reals?

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
Topological complexity of the range searching

Journal of Complexity
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields

Proceedings of the Mathematical Foundations of Computer Science 1984
Complexity of quantifier elimination in the theory of ordinary differential equations

EUROCAL '87 Proceedings of the European Conference on Computer Algebra
VC Dimension in Circuit Complexity

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Algebraic Complexity Theory

Algebraic Complexity Theory

An efficient algorithm for the sign condition problem in the semi-algebraic context

GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
VPSPACE and a transfer theorem over the complex field

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the complexity of the multivariate resultant

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This survey is devoted to some aspects of the "P = NP ?" problem over the real numbers and more general algebraic structures. We argue that given a structure M, it is important to find out whether NPM problems can be solved by polynomial depth computation trees, and if so whether these trees can be efficiently simulated by circuits. Point location, a problem of computational geometry, comes into play in the study of these questions for several structures of interest.