Volume 51; Issue 1-2

Theoretical Computer Science

Volume 51; Issue 1-2
1

Editorial Board

Year:
1987
Language:
english
File:
PDF, 188 KB
english, 1987
2

On the syntax of Martin-Löf's type theories

Year:
1987
Language:
english
File:
PDF, 2.58 MB
english, 1987
3

Analysis of Dehn's algorithm by critical pairs

Year:
1987
Language:
english
File:
PDF, 2.54 MB
english, 1987
4

More complicated questions about maxima and minima, and some closures of NP

Year:
1987
Language:
english
File:
PDF, 2.87 MB
english, 1987
5

Characteristics of graph languages generated by edge replacement

Year:
1987
Language:
english
File:
PDF, 5.79 MB
english, 1987
7

Diagonalizations over polynomial time computable sets

Year:
1987
Language:
english
File:
PDF, 3.42 MB
english, 1987
8

A characterization of passing compatibility for parameterized specifications

Year:
1987
Language:
english
File:
PDF, 1.27 MB
english, 1987
9

An O(nlg k · 2n2) time and O(k · 2nk) space algorithm for certain NP-complete problems

Year:
1987
Language:
english
File:
PDF, 741 KB
english, 1987
12

Contents EATCS bulletin : No. 32, June 1987

Year:
1987
Language:
english
File:
PDF, 254 KB
english, 1987
13

On the consistency of Koomen's Fair Abstraction Rule

Year:
1987
Language:
english
File:
PDF, 4.65 MB
english, 1987
14

On unambiguous reductions of monoids of unambiguous relations

Year:
1987
Language:
english
File:
PDF, 616 KB
english, 1987
15

Constructive universal algebra: an introduction

Year:
1987
File:
PDF, 966 KB
1987