The Ehrenfeucht–Mycielski sequence is a recursively defined sequence of binary digits with pseudorandom properties, defined by Andrzej Ehrenfeucht… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Kundan Krishna, Satyadev Nandakumar
- ArXiv
- 2017

We study the binary Ehrenfeucht Mycielski sequence seeking a balance between the number of occurrences of different binary… (More)

Is this relevant?

2014

2014

- Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
- STACS
- 2014

In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space… (More)

Is this relevant?

2009

2009

- Grzegorz Herman, Michael Soltys
- J. Discrete Algorithms
- 2009

We introduce the inverted prefix tries (a variation of suffix tries) as a convenient formalism for stating and proving properties… (More)

Is this relevant?

2006

2006

- Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
- 21st Annual IEEE Conference on Computational…
- 2006

In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the… (More)

Is this relevant?

2005

2005

- Anuj Dawar, Martin Otto
- 20th Annual IEEE Symposium on Logic in Computer…
- 2005

We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The… (More)

Is this relevant?

2003

2003

- Klaus Sutner
- CIAA
- 2003

We show that the Ehrenfeucht-Mycielski sequence U is strongly balanced in the following sense: for any finite word w of length k… (More)

Is this relevant?

2002

2002

- Stephen A. Cook, Yongmei Liu
- ISAIM
- 2002

Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on… (More)

Is this relevant?

1997

1997

- Leonid Libkin
- LICS
- 1997

Most proofs showing limitations of expressive power of first-order logic rely on Ehrenfeucht-Fraisse games. Playing the game… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1988

Highly Cited

1988

- Miklós Ajtai, Ronald Fagin
- FOCS
- 1988

Although it is known that reachability in undirected finite graphs can be expressed by an existential monadic second-order… (More)

Is this relevant?