1092 search results - page 96 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
170
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
: 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...
163
click to vote
MP
2007
15 years 5 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
136
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
172
click to vote
ACID
2006
15 years 7 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
169
click to vote
ISSAC
2007
Springer
16 years 5 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...