Computational complexity theory allows one to investigate the amount or resources (usually, time and/or space) which are needed to solve a given computational problem. Indeed, since the appeareance of P systems [15] several computational complexity techniques have been applied to study their computational power and efficiency. During the talk, I will survey the main complexity results which have been obtained in the last few years by the group of Membrane Computing at the University of Milano-Bicocca (also known as the “Milano Team”), sometimes in collaboration with collegues from the Membrane Computing community.
Leporati, A. (2012). Computational Complexity of P Systems. Intervento presentato a: Asian Conference on Membrane Computing, Wuhan, China.
Computational Complexity of P Systems
LEPORATI, ALBERTO OTTAVIO
2012
Abstract
Computational complexity theory allows one to investigate the amount or resources (usually, time and/or space) which are needed to solve a given computational problem. Indeed, since the appeareance of P systems [15] several computational complexity techniques have been applied to study their computational power and efficiency. During the talk, I will survey the main complexity results which have been obtained in the last few years by the group of Membrane Computing at the University of Milano-Bicocca (also known as the “Milano Team”), sometimes in collaboration with collegues from the Membrane Computing community.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
