Bicocca Open Archive

Logo unimib boa

Bertoni, A., Mauri, G., Sabadini, N. (1981). A characterization of the class of functions computable in polynomial time on random access machines. In Proceedings of 13th ACM STOC – Symposium on Theory of Computation (pp.168-176). ACM Press [10.1145/800076.802470].

A characterization of the class of functions computable in polynomial time on random access machines

Mauri, G;
1981
slide + paper
Random Access Machines; polynomial time
English
ACM STOC – Symposium on Theory of Computation
1981
Proceedings of 13th ACM STOC – Symposium on Theory of Computation
0-89791-041-9
1981
168
176
none
Bertoni, A., Mauri, G., Sabadini, N. (1981). A characterization of the class of functions computable in polynomial time on random access machines. In Proceedings of 13th ACM STOC – Symposium on Theory of Computation (pp.168-176). ACM Press [10.1145/800076.802470].
02 - Intervento a convegno
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/17076
Citazioni
  • Scopus 24
  • ???jsp.display-item.citation.isi??? ND
Social impact