External Links

    Journal: Theoretical Computer Science

    Volume 4, Issue 3

    237 -- 244Christos H. Papadimitriou. The Euclidean Traveling Salesman Problem is NP-Complete
    245 -- 276Matthew M. Geller, Michael A. Harrison. On LR::::(k):::: Grammars and Languages
    277 -- 299Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien. Complexity of Some Problems in Petri Nets
    301 -- 319Robert P. Daley. On the Inference of Optimal Descriptions
    321 -- 349Tmima Olshansky, Amir Pnueli. A Direct Algorithm for Checking Equivalence of LL::::(k):::: Grammars
    runs on