Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2019

2019

Blum-Shub-Smale machines are a classical model of computability over the real line. In [9], Koepke and Seyfferth generalised Blum… Expand

2019

2019

This article describes recent advances in the computation of the homology groups of semialgebraic sets. It summarizes a series of… Expand

2015

2015

We study the emergent dynamics for the hydrodynamic Cucker--Smale system arising in the modeling of flocking dynamics in… Expand

2012

2012

We introduce a generalization of Blum-Shub-Smale machines on the standard real numbers ℝ that is allowed to run for a transfinite… Expand

Highly Cited

2007

Highly Cited

2007

AbstractIsolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate… Expand

Highly Cited

2005

Highly Cited

2005

We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model… Expand

Highly Cited

2004

Highly Cited

2004

Abstract.Given , the linear complementarity problem (LCP) is to find such that (x, s)≥ 0,s=Mx+q,xTs=0. By using the Chen-Harker… Expand

1998

1998

Abstract In this paper we compare recursively enumerable subsets of Rq in two computing models over real numbers: the Blum-Shub… Expand

1998

1998

Continuing the paper [7], in which the Blum-Shub-Smale approach to computability over the reals has been generalized to arbitrary… Expand

Highly Cited

1996

Highly Cited

1996

We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n… Expand