Implicit computational complexity

被引：0

|

作者：

Marion, JY ^{[1
]}

机构：

[1] Ecole Natl Super Mines, LORIA, INPL, F-54506 Vandoeuvre Les Nancy, France

来源：

THEORETICAL COMPUTER SCIENCE | 2004年 / 318卷 / 1-2期

关键词：

D O I：

10.1016/j.tcs.2003.10.014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：1 / 1

页数：1

相关论文

共 50 条

[1] Quantum implicit computational complexity
Dal Lago, Ugo
Masini, Andrea
Zorzi, Margherita
THEORETICAL COMPUTER SCIENCE, 2010, 411 (02) : 377 - 409
[2] Developments in implicit computational complexity
Marion, Jean-Yves
INFORMATION AND COMPUTATION, 2015, 241 : 1 - 2
[3] Automated implicit computational complexity analysis
Avanzini, Martin
Moser, Georg
Schnabl, Andreas
AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 132 - +
[4] Special Issue on Implicit Computational Complexity
Baillot, Patrick
Marion, Jean-Yves
Della Rocca, Simona Ronchi
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2009, 10 (04)
[5] Program analysis for implicit computational complexity
Jones, ND
PROGRAMS AS DATA OBJECTS, PROCEEDINGS, 2001, 2053 : 1 - 1
[6] Reversible computing and implicit computational complexity
Kristiansen, Lars
SCIENCE OF COMPUTER PROGRAMMING, 2022, 213
[7] Probabilistic Recursion Theory and Implicit Computational Complexity
Dal Lago, Ugo
Zuppiroli, Sara
Gabbrielli, Maurizio
SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2014, 24 (02) : 177 - 216
[8] Probabilistic recursion theory and implicit computational complexity
1600, Springer Verlag (8687):
[9] Probabilistic Recursion Theory and Implicit Computational Complexity
Dal Lago, Ugo
Zuppiroli, Sara
THEORETICAL ASPECTS OF COMPUTING - ICTAC 2014, 2014, 8687 : 97 - 114
[10] Evolving Graph-Structures and Their Implicit Computational Complexity
Leivant, Daniel
Marion, Jean-Yves
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 349 - 360

← 1 2 3 4 5 →