2430 search results - page 93 / 486 » Computing Tutte Polynomials |
154
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
138
click to vote
TCS
2008
15 years 5 months ago
2008
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
170
click to vote
CAP
2010
15 years 4 days ago
2010
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
181
click to vote
EUROCRYPT
2011
Springer
14 years 8 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
130
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...