921 search results - page 138 / 185 » Expressing Computational Complexity in Constructive Type The... |
STACS
1994
Springer
14 years 5 days ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
AAMAS
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
CMA
2010
13 years 4 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
Graphics processing units (GPUs) are powerful devices capable of rapid parallel computation. GPU programming, however, can be quite difficult, limiting its use to experienced prog...