Computational Complexity of P Systems

摘要：

　　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.

作者: Alberto Leporati

作者单位: Dipartimento di Informatica,Sistemistica e Comunicazione Università degli Studi di Milano-Bicocca Viale Sarca 336/14,20126 Milano,Italy

会议类型: 国际会议

会议名称: 2013年第二届亚洲膜计算国际会议(2013ACMC)

会议地点: 成都

会议语种:英文

页码: 1-6

在线出版日期: 2013-11-04（万方平台首次上网日期，不代表论文的发表时间）