THE COMPUTATIONAL COMPLEXITY COLUMN

被引：0

作者：

Arvind, Vikraman ^{[1
]}

机构：

[1] Inst Math Sci, CIT Campus, Madras 600113, Tamil Nadu, India

来源：

BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | 2015年 / 117期

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：55 / 55

页数：1

共 50 条

[31] Tutorial on computational complexity
Tovey, CA
INTERFACES, 2002, 32 (03) : 30 - 61
[32] Background on computational complexity
GROUP-BASED CRYPTOGRAPHY, 2008, : 19 - 34
[33] Computational complexity theory
Loui, MC
ACM COMPUTING SURVEYS, 1996, 28 (01) : 47 - 49
[34] Computational complexity of functions
Levin, LA
THEORETICAL COMPUTER SCIENCE, 1996, 157 (02) : 267 - 271
[35] Theory of computational complexity
Zilinskas, A
INTERFACES, 2002, 32 (03) : 93 - 94
[36] Mitosis in computational complexity
Glasser, Christian
Pavan, A.
Selman, Alan L.
Zhang, Liyu
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 61 - 67
[37] Implicit computational complexity
Marion, JY
THEORETICAL COMPUTER SCIENCE, 2004, 318 (1-2) : 1 - 1
[38] Computational complexity simplified
Tarek, Ahmed
RECENT ADVANCES ON APPLIED MATHEMATICS: PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS (MATH '08), 2008, : 130 - 135
[39] The computational complexity of RaceTrack
Institut für Informatik, Universität Giessen, Arndtstraße 2, D-35392 Giessen, Germany
不详
Lect. Notes Comput. Sci., 1600, (260-271):
[40] ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS
Merekin, Yu. V.
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2009, 2 (04) : 649 - 656