107 search results - page 5 / 22 » Computing subsets of equivalence classes for large FSMs |
185
Voted
EUROCRYPT
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
114
click to vote
CADE
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
106
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
126
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
129
Voted
DSN
2007
IEEE
15 years 9 months ago
2007
IEEE
New versions of existing large-scale web services such as Passport.com© have to go through rigorous performance evaluations in order to ensure a high degree of availability. Perf...