Sciweavers

1253 search results - page 11 / 251
» order 2000
Sort
View
RTA
2000
Springer
14 years 4 days ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
ASIACRYPT
2000
Springer
14 years 27 days ago
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
Safuat Hamdy, Bodo Möller
IPPS
2000
IEEE
14 years 29 days ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
LICS
2000
IEEE
14 years 28 days ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein
CODES
2000
IEEE
14 years 1 months ago
Storage requirement estimation for data intensive applications with partially fixed execution ordering
In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partly fixed. At tha...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...