92 search results - page 10 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
Cloth animation is a very expensive process in terms of computational cost, due to the flexible nature of cloth objects. Since wrinkles and smooth areas co-exist commonly in cloth...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
PDC
2006
ACM
14 years 1 months ago
2006
ACM
Over the last decade, the major firms and cultural institutions that have dominated media and information industries in the U.S. and globally have been challenged by people adopti...
ACSC
2003
IEEE
14 years 21 days ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...