In computation theory, the Blum–Shub–Smale machine, or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and… (More)

Is this relevant?

2012

2012

- Peter Koepke, Benjamin Seyfferth
- CiE
- 2012

We introduce a generalization of Blum-Shub-Smale machines on the standard real numbers R that is allowed to run for a transfinite… (More)

Is this relevant?

2010

2010

- Wesley Calvert, Ken Kramer, Russell G. Miller
- Logical Methods in Computer Science
- 2010

Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First… (More)

Is this relevant?

2010

2010

- Wesley Calvert, Ken Kramer, Russell G. Miller
- CCA
- 2010

We examine the relation of BSS-reducibility on subsets of R. The question was asked recently (and anonymously) whether it is… (More)

Is this relevant?

2005

2005

- Peter Bürgisser, Felipe Cucker, Martin Lotz
- Foundations of Computational Mathematics
- 2005

In [7] counting complexity classes #PR and #PC in the BlumShub-Smale setting of computations over the real and complex numbers… (More)

Is this relevant?

2003

2003

- J. Maurice Rojas
- ArXiv
- 2003

The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the… (More)

Is this relevant?

1998

1998

- Ning Zhong
- Theor. Comput. Sci.
- 1998

In this paper we compare recursively enumerable subsets of R” in two computing models over real numbers: the Blum-Shub-Smale… (More)

Is this relevant?

1997

1993

1993

- Pascal Koiran
- FOCS
- 1993

W e propose a weak version of the Blum-Shub-Smale model of computation over the real numbers. In this weak model only a “moderate… (More)

Is this relevant?

1993

1993

- Hu Xiao-Long
- Bulletin of the EATCS
- 1993

In the paper "On a Theory of Computation and Complexity over the Real Numbers: NP Completeness, Recursive Functions and Universal… (More)

Is this relevant?