Sciweavers

644 search results - page 8 / 129
» Real Algebraic Numbers: Complexity Analysis and Experimentat...
Sort
View
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
13 years 11 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
14 years 29 days ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 14 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
IISWC
2009
IEEE
14 years 2 months ago
Experimental evaluation of N-tier systems: Observation and analysis of multi-bottlenecks
In many areas such as e-commerce, mission-critical N-tier applications have grown increasingly complex. They are characterized by non-stationary workloads (e.g., peak load several...
Simon Malkowski, Markus Hedwig, Calton Pu
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite