Sciweavers

644 search results - page 12 / 129
» Real Algebraic Numbers: Complexity Analysis and Experimentat...
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
13 years 7 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 7 months ago
Reducing the Number of Annotations in a Verification-oriented Imperative Language
Abstract. Automated software verification is a very active field of research which has made enormous progress both in theoretical and practical aspects. Recently, an important amou...
Guido de Caso, Diego Garbervetsky, Daniel Gor&iacu...
COMGEO
2010
ACM
13 years 7 months ago
An efficient algorithm for the stratification and triangulation of an algebraic surface
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
Eric Berberich, Michael Kerber, Michael Sagraloff
COMPGEOM
2009
ACM
14 years 2 months ago
On the topology of planar algebraic curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...