2430 search results - page 6 / 486 » Computing Tutte Polynomials |
111
Voted
DCG
2011
14 years 6 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
70
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
117
click to vote
CRYPTO
2012
Springer
13 years 2 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
ECCC
2002
14 years 11 months ago
2002
