368 search results - page 30 / 74 » Arithmetic as a Theory Modulo |
ICICS
1997
Springer
14 years 7 days ago
1997
Springer
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
AAAI
2000
13 years 10 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
DCG
2006
13 years 8 months ago
2006
We show that the equation si1 + si2 +
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
COMPUTING
2006
13 years 8 months ago
2006
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...