Volume 51; Issue 3

Theoretical Computer Science

Volume 51; Issue 3
1

Bounded DOL languages

Tom Head, Barbara Lando
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 1.15 MB
english, 1987
2

Honest polynomial degrees and P=? NP

Steven Homer, Timothy J. Long
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 2.08 MB
english, 1987
3

Literal shuffle

Béatrice Berard
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 2.04 MB
english, 1987
4

On the computational complexity of the general discrete fourier transform

Thomas Beth
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 1.06 MB
english, 1987
5

Parallel string matching with k mismatches

Zvi Galil, Raffaele Giancarlo
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 928 KB
english, 1987
6

On purely morphic characterizations of context-free languages

Takashi Yokomori
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 882 KB
english, 1987
7

A fixpoint semantics of Horn sentences based on substitution sets

Susumu Yamasaki, Mikio Yoshida, Shuji Doshita
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 1.93 MB
english, 1987
8

Reversal-bounded nondeterministic multicounter machines and complementation

Juraj Hromkovič
Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 638 KB
english, 1987
9

Author index volume 51 (1987)

Journal:
Theoretical Computer Science
Year:
1987
Language:
english
File:
PDF, 112 KB
english, 1987