5138 search results - page 472 / 1028 » Randomized Algorithms for 3-SAT |
198
click to vote
MST
2010
15 years 5 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
151
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
171
click to vote
COCO
2005
Springer
16 years 13 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
159
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
189
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...