The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity- bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties.
| Submissions: | December 15, 2010 |
| Notification: | January 27, 2011 |
| Event: | April 2, 2011-April 3, 2011 |