Sciweavers

71228 search results - page 33 / 14246
» Algorithms
Sort
View
STOC
2006
ACM
76views Algorithms» more  STOC 2006»
16 years 1 months ago
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov, Vaughan Jones, Zeph Landau
STOC
2004
ACM
87views Algorithms» more  STOC 2004»
16 years 1 months ago
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
STOC
2003
ACM
100views Algorithms» more  STOC 2003»
16 years 1 months ago
Simpler and better approximation algorithms for network design
Anupam Gupta, Amit Kumar, Tim Roughgarden
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
15 years 1 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
STOC
1991
ACM
87views Algorithms» more  STOC 1991»
15 years 4 months ago
Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
We describe a new deterministic algorithm for the problem of constructing k-th
Johannes Buchmann, Victor Shoup