Volume 15; Issue 3

Theoretical Computer Science

Volume 15; Issue 3
1

Several results in program size complexity

Howard P. Katseff, Michael Sipser
Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 2.14 MB
english, 1981
2

Complexity of graph embeddability problems

C. Benzaken, S. Foldes
Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 890 KB
english, 1981
3

International symposium on algorithmic languages: October 26–29, 1981 Amsterdam, The Netherlands

Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 154 KB
english, 1981
4

More on advice on structuring compilers and proving them correct

James W. Thatcher, Eric G. Wagner, Jesse B. Wright
Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 3.02 MB
english, 1981
5

Non deterministic polynomial optimization problems and their approximations

A. Paz, S. Moran
Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 2.97 MB
english, 1981
6

Optimization problems and the polynomial hierarchy

E.W. Leggett Jr., Daniel J. Moore
Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 1.26 MB
english, 1981
7

A space bound for one-tape multidimensional Turing machines

Michael C. Loui
Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 1.05 MB
english, 1981
9

Author Index: Volume 15 (1981)

Journal:
Theoretical Computer Science
Year:
1981
Language:
english
File:
PDF, 114 KB
english, 1981