Add to ORKGWe show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP-complete for the Blum, Shub and Smale model of computation. We also introduce a class of languages R lying between P and NP that uses probabilistic machines, and several problems from the same area are classified as "probably non-complete" by showing their membership to R.Postprint (published version
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
(eng) We show that proving lower bounds in algebraic models of computation may not be easier than in...
We show that deciding whether an algebraic variety has an irreducible component of codimension at le...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
We introduce some operators defining new complexity classes from existing ones in the Blum-Shub-Smal...
AbstractThe computational model of Blum, Shub, and Smale (1989, Bull. Amer. Math. Soc.21, 1-46) yiel...
AbstractProbabilistically checkable proofs (PCPs) have turned out to be of great importance in compl...
(eng) We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem ...
We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem in the...
We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem in the...
AbstractWhen comparing complexity theory over the ring Z (Turing machine) on one hand and over the r...
AbstractWhen comparing complexity theory over the ring Z (Turing machine) on one hand and over the r...
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
(eng) We show that proving lower bounds in algebraic models of computation may not be easier than in...
We show that deciding whether an algebraic variety has an irreducible component of codimension at le...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
We introduce some operators defining new complexity classes from existing ones in the Blum-Shub-Smal...
AbstractThe computational model of Blum, Shub, and Smale (1989, Bull. Amer. Math. Soc.21, 1-46) yiel...
AbstractProbabilistically checkable proofs (PCPs) have turned out to be of great importance in compl...
(eng) We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem ...
We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem in the...
We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem in the...
AbstractWhen comparing complexity theory over the ring Z (Turing machine) on one hand and over the r...
AbstractWhen comparing complexity theory over the ring Z (Turing machine) on one hand and over the r...
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...
We show that proving lower bounds in algebraic models of computation may not be easier than in the s...
(eng) We show that proving lower bounds in algebraic models of computation may not be easier than in...
We show that deciding whether an algebraic variety has an irreducible component of codimension at le...