543 research outputs found
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give
rise to a discrete complexity class between NP and PSPACE. Several problems,
mostly from real algebraic geometry / polynomial systems, have been shown
complete (under many-one reduction by polynomial-time Turing machines) for this
class. We exhibit a new one based on questions about expressions built from
cross products only.Comment: In Proceedings MCU 2013, arXiv:1309.104
VPSPACE and a transfer theorem over the complex field
We extend the transfer theorem of [KP2007] to the complex field. That is, we
investigate the links between the class VPSPACE of families of polynomials and
the Blum-Shub-Smale model of computation over C. Roughly speaking, a family of
polynomials is in VPSPACE if its coefficients can be computed in polynomial
space. Our main result is that if (uniform, constant-free) VPSPACE families can
be evaluated efficiently then the class PAR of decision problems that can be
solved in parallel polynomial time over the complex field collapses to P. As a
result, one must first be able to show that there are VPSPACE families which
are hard to evaluate in order to separate P from NP over C, or even from PAR.Comment: 14 page
A Measure of Space for Computing over the Reals
We propose a new complexity measure of space for the BSS model of
computation. We define LOGSPACE\_W and PSPACE\_W complexity classes over the
reals. We prove that LOGSPACE\_W is included in NC^2\_R and in P\_W, i.e. is
small enough for being relevant. We prove that the Real Circuit Decision
Problem is P\_R-complete under LOGSPACE\_W reductions, i.e. that LOGSPACE\_W is
large enough for containing natural algorithms. We also prove that PSPACE\_W is
included in PAR\_R
A complex analogue of Toda's Theorem
Toda \cite{Toda} proved in 1989 that the (discrete) polynomial time
hierarchy, , is contained in the class \mathbf{P}^{#\mathbf{P}},
namely the class of languages that can be decided by a Turing machine in
polynomial time given access to an oracle with the power to compute a function
in the counting complexity class #\mathbf{P}. This result, which illustrates
the power of counting is considered to be a seminal result in computational
complexity theory. An analogous result (with a compactness hypothesis) in the
complexity theory over the reals (in the sense of Blum-Shub-Smale real machines
\cite{BSS89}) was proved in \cite{BZ09}. Unlike Toda's proof in the discrete
case, which relied on sophisticated combinatorial arguments, the proof in
\cite{BZ09} is topological in nature in which the properties of the topological
join is used in a fundamental way. However, the constructions used in
\cite{BZ09} were semi-algebraic -- they used real inequalities in an essential
way and as such do not extend to the complex case. In this paper, we extend the
techniques developed in \cite{BZ09} to the complex projective case. A key role
is played by the complex join of quasi-projective complex varieties. As a
consequence we obtain a complex analogue of Toda's theorem. The results
contained in this paper, taken together with those contained in \cite{BZ09},
illustrate the central role of the Poincar\'e polynomial in algorithmic
algebraic geometry, as well as, in computational complexity theory over the
complex and real numbers -- namely, the ability to compute it efficiently
enables one to decide in polynomial time all languages in the (compact)
polynomial hierarchy over the appropriate field.Comment: 31 pages. Final version to appear in Foundations of Computational
Mathematic
Newton Method on Riemannian Manifolds: Covariant Alpha-Theory
In this paper we study quantitative aspects of Newton method for finding
zeros of mappings f: M_n -> R^n and vector fields X: M_x -> TM_
Interpolation in Valiant's theory
We investigate the following question: if a polynomial can be evaluated at
rational points by a polynomial-time boolean algorithm, does it have a
polynomial-size arithmetic circuit? We argue that this question is certainly
difficult. Answering it negatively would indeed imply that the constant-free
versions of the algebraic complexity classes VP and VNP defined by Valiant are
different. Answering this question positively would imply a transfer theorem
from boolean to algebraic complexity. Our proof method relies on Lagrange
interpolation and on recent results connecting the (boolean) counting hierarchy
to algebraic complexity classes. As a byproduct we obtain two additional
results: (i) The constant-free, degree-unbounded version of Valiant's
hypothesis that VP and VNP differ implies the degree-bounded version. This
result was previously known to hold for fields of positive characteristic only.
(ii) If exponential sums of easy to compute polynomials can be computed
efficiently, then the same is true of exponential products. We point out an
application of this result to the P=NP problem in the Blum-Shub-Smale model of
computation over the field of complex numbers.Comment: 13 page
- …