Items by Das, Anupam
 | Up a level |
Number of items: 2.
2012
Das, A., 2012. Complexity of deep inference via atomic flows. In: Cooper, S. B., Dawar, A. and Lowe, B., eds. How the World Computes. Vol. 7318 LNCS. Heidelberg, Germany: Springer-Verlag, pp. 139-150. (Lecture Notes in Computer Science; 7318)
2011
Das, A., 2011. On the proof complexity of cut-free bounded deep inference. In: Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Proceedings. Vol. 6793 LNAI. Heidelberg: Springer-Verlag, pp. 134-148. (Lecture Notes in Computer Science)
