共 50 条
- [37] Extending the implicit computational complexity approach to the sub-elementary time-space classes Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1767 : 239 - 252
- [38] Extending the implicit computational complexity approach to the sub-elementary time-space classes ALGORITHMS AND COMPLEXITY, 2000, 1767 : 239 - 252
- [39] On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 233 - 247
- [40] A Note on a Change of Variable Formula with Local Time-Space for Levy Processes of Bounded Variation SEMINAIRE DE PROBABILITES XL, 2007, 1899 : 97 - 104