1172 search results - page 38 / 235 » Constructions of generalized Sidon sets |
TACS
1994
Springer
15 years 3 months ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
JMLR
2002
14 years 11 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
IACR
2011
13 years 11 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
BSL
2000
14 years 11 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
FSTTCS
1993
Springer
15 years 3 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...