70 search results - page 10 / 14 » A computational introduction to number theory and algebra |
LICS
2003
IEEE
14 years 22 days ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
JACM
2010
13 years 6 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
LICS
1998
IEEE
13 years 11 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...