193 search results - page 17 / 39 » Exponential lower bounds for the numbers of Skolem-type sequ... |
SIAMDM
2010
13 years 5 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
SETA
2010
Springer
13 years 5 months ago
2010
Springer
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol ...
IANDC
2006
13 years 7 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
ICALP
2007
Springer
14 years 1 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...
DAWAK
2011
Springer
12 years 7 months ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...