Sciweavers

188 search results - page 4 / 38
» Back to the Complexity of Universal Programs
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
AINA
2009
IEEE
14 years 14 days ago
A Generic Database Web Service for the Venice Service Grid
This work describes a generic database service for the lightweight Venice Service Grid, which has been developed at the University of Kaiserslautern, Germany. By using Web service...
Michael Koch, Markus Hillenbrand, Paul Müller
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 7 months ago
WATERWAVES: wave particles dynamics on a complex triatomic potential
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
Simone Taioli, Jonathan Tennyson
TOG
2012
234views Communications» more  TOG 2012»
11 years 9 months ago
Fast automatic skinning transformations
Algebra I, II Complex Variables I, II Analysis I, II Awards, Scholarships, Fellowships Received • Back Cover Image, Proceedings of ACM SIGGRAPH, 2011 • New York University Henr...
Alec Jacobson, Ilya Baran, Ladislav Kavan, Jovan P...
CP
2008
Springer
13 years 9 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang