Search

Filters

Use filters to refine the search results.

Now showing items 1-8 of 8

The atnext/atprevious hierarchy on the starfree languages

Borchert, Bernd; Tesson, Pascal (Universität Tübingen, 2004)
Searching paths of constant bandwidth

Borchert, Bernd; Reinhardt, Klaus (Universität Tübingen, 2004)
The dot-depth hierarchy versus iterated block products of DA

Borchert, Bernd (Universität Tübingen, 2004)
Exponential Multiplication Schemes

Borchert, Bernd; Reinhardt, Klaus (Universität Tübingen, 2006)
Deterministically and Sudoku-Deterministically Recognizable Picture Languages

Borchert, Bernd; Reinhardt, Klaus (Universität Tübingen, 2006)
Segment-based Visual Cryptography

Borchert, Bernd (Universität Tübingen, 2007)
The dot-depth and the polynomial hierarchy correspond on the delta levels

Borchert, Bernd; Lange, Klaus-Joern; Stephan, Frank; Tesson, Pascal; Therien, Denis (Universität Tübingen, 2004)
Formal Language Characterizations of P, NP, and PSPACE

Borchert, Bernd (Universität Tübingen, 2003)

Now showing items 1-8 of 8