19 search results - page 3 / 4 » Two New Extensions of the Hales-Jewett Theorem |
LICS
2007
IEEE
14 years 1 days ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
BIRTHDAY
1997
Springer
13 years 10 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
COCO
2009
Springer
14 years 11 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
AAAI
2010
13 years 7 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...