Transfer theorems via sign conditions

Authors:
Pascal Koiran
Affiliations:
LIP, Ecole Normale Supérieure de Lyon, 46 allée d'Italie, 69364 Lyon Cedex 07, France
Venue:
Information Processing Letters
Year:
2002

Citing 10
Cited 0

Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

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

Journal of Complexity
Feedforward nets for interpolation and classification

Journal of Computer and System Sciences
Computing over the reals with addition and order: higher complexity classes

Journal of Complexity
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
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that P = PSPACE implies the collapse of the Boolean polynomial hierarchy over any structure which admits "efficient enumeration of sign conditions". This fairly rich class of structures contains in particular R and C.