1399 search results - page 128 / 280 » Multi-party Finite Computations |
102
click to vote
DCC
2002
IEEE
16 years 3 months ago
2002
IEEE
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, re...
133
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
137
Voted
CSR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
113
click to vote
WMP
2000
15 years 7 months ago
2000
orms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages . . . . 135 Manfred Kudlek, Victor Mitrana On Multisets in Database Systems . . ....
113
click to vote
MOC
2000
15 years 3 months ago
2000
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...