2446 search results - page 49 / 490 » Choiceless Polynomial Time |
STOC
1989
ACM
13 years 11 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
TIM
2010
13 years 2 months ago
2010
Abstract--An approach for the construction of a family of desired order continuous polynomial time window functions is presented without self-convolution of the parent window. The ...
COLT
1992
Springer
13 years 11 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...