10608 search results - page 71 / 2122 » Complexity of O'Hara's Algorithm |
STOC
1992
ACM
14 years 2 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
COCO
2006
Springer
14 years 1 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
ACL
1994
13 years 11 months ago
1994
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...