|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A decisive characterization of BPP |
Zachos, Stathis |
1986 |
69 | 1-3 |
p. 125-135 11 p. |
article |
|
| 2 | Arithmetic theories for computational complexity problems |
Homer, Steve |
1986 |
69 | 1-3 |
p. 1-11 11 p. |
article |
|
| 3 | A simplified lower bound for context-free-language recognition |
Seiferas, Joel I. |
1986 |
69 | 1-3 |
p. 255-260 6 p. |
article |
|
| 4 | Author index for volume 69 |
1986 |
69 | 1-3 |
p. 261- 1 p. |
article |
||
| 5 | Boundary NLC graph grammars—Basic definitions, normal forms, and complexity |
Rozenberg, Grzegorz |
1986 |
69 | 1-3 |
p. 136-167 32 p. |
article |
|
| 6 | Categorical combinators |
Curien, P.-L. |
1986 |
69 | 1-3 |
p. 188-254 67 p. |
article |
|
| 7 | Editorial Board |
1986 |
69 | 1-3 |
p. i- 1 p. |
article |
||
| 8 | Machines for attribute grammars |
Filé, Gilberto |
1986 |
69 | 1-3 |
p. 41-124 84 p. |
article |
|
| 9 | On the complexity of inductive inference |
Daley, Robert P. |
1986 |
69 | 1-3 |
p. 12-40 29 p. |
article |
|
| 10 | Solving tree problems on a mesh-connected processor array |
Atallah, Mikhail J. |
1986 |
69 | 1-3 |
p. 168-187 20 p. |
article |
10 results found