1092 search results - page 19 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
168
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
168
click to vote
ANTS
2008
Springer
15 years 8 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
164
click to vote
EUROCRYPT
2006
Springer
15 years 9 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
151
click to vote
ISSAC
2001
Springer
15 years 10 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
152
click to vote
AAAI
2010
15 years 7 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...