Author:
Bertoni A.,Mauri G.,Sabadini N.
Reference12 articles.
1. 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
2. Computers and intractability;Garey,1979
3. Hartmanis J., Simon J., On the power of multiplication in Random Access Machines, 15th IEEE Symp. on Switching and Automata Theory, 1974, 13–23
4. Combinatorial Methods;Percus,1971
5. A characterization of the power of vector machines;Pratt;JCSS,1976
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Squeezing Feasibility;Pursuit of the Universal;2016
2. Preface;RAIRO - Theoretical Informatics and Applications;2006-04