2430 search results - page 152 / 486 » Computing Tutte Polynomials |
141
click to vote
COMPGEOM
1999
ACM
15 years 9 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
138
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
![Amplifying ZPP^SAT[1] and the Two Queries Problem](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Amplifying ZPP^SAT[1] and the Two Queries Problem")
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
127
Voted
CCCG
2006
15 years 6 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
146
click to vote
WSCG
2004
15 years 6 months ago
2004
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
159
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...