Author:
Bertoni A.,Mauri G.,Sabadini N.
Reference25 articles.
1. Aho A.V., Hopcroft J.E., Ullman J.D., The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass., 1974
2. Batcher K.E., Sorting networks and their applications, Proc. AFIPS Spring Joint Comp. Conf., Vol. 32, 1968, 307–314
3. Bertoni A., Mauri G., Sabadini N., A characterization of the class of functions computable in polynomial time by Random Access Machines, Proc. 13th ACM STOC, 1981, 168–176
4. Chandra A.K., Kozen D.C., Stockmeyer L.J., Alternation, J.ACM 28, 1, 1981, 114–133
5. Cook S.A., The complexity of theorem proving procedures, Proc. 3rd ACM STOC, 1971, 151–158