19320 search results - page 259 / 3864 » On the complexity of computing determinants |
173
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
157
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
193
click to vote
EGH
2003
Springer
15 years 12 months ago
2003
Springer
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
186
click to vote
FOCS
2006
IEEE
16 years 21 days ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
153
click to vote
JC
2006
15 years 6 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...