2430 search results - page 67 / 486 » Computing Tutte Polynomials |
123
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
153
Voted
TCS
2011
14 years 9 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
120
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
111
click to vote
FSS
2002
15 years 2 months ago
2002
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
123
click to vote
ACL
2009
15 years 10 days ago
2009
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...