|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
6 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs |
Lingas, Andrzej |
1989 |
68 | 2 |
p. 155-173 19 p. |
article |
|
| 2 | On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas |
Arvind, V. |
1989 |
68 | 2 |
p. 123-134 12 p. |
article |
|
| 3 | Paraconsistent logic programming |
Blair, Howard A. |
1989 |
68 | 2 |
p. 135-154 20 p. |
article |
|
| 4 | Preface |
Siromoney, R. |
1989 |
68 | 2 |
p. 121- 1 p. |
article |
|
| 5 | Semantics of distributed definite clause programs |
Ramanujam, R. |
1989 |
68 | 2 |
p. 203-220 18 p. |
article |
|
| 6 | Submodule construction as equation solving in CCS |
Parrow, Joachim |
1989 |
68 | 2 |
p. 175-202 28 p. |
article |
6 results found