2446 search results - page 156 / 490 » Choiceless Polynomial Time |
177
Voted
ACG
2006
Springer
16 years 1 months ago
2006
Springer
A method to simulate the physics of the game of pool is presented. The method is based upon a parametrization of ball motion which allows the time of occurrence of events, such as...
147
click to vote
CRYPTO
2005
Springer
16 years 17 days ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
211
Voted
STACS
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
192
Voted
WABI
2005
Springer
16 years 15 days ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
149
Voted
ICALP
2004
Springer
16 years 12 days ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...