Computational complexity and mathematical proofs

被引：0

作者：

Hartmanis, J ^{[1
]}

机构：

[1] Cornell Univ, Ithaca, NY 14853 USA

来源：

INFORMATICS - 10 YEARS BACK, 10 YEARS AHEAD | 2001年 / 2000卷

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper discusses how the major computational complexity classes, P, NP and PSPACE, capture different computational properties of mathematical proofs and reveal new quantitative aspects of mathematics.

引用

页码：251 / 256

页数：6

共 50 条

[21] Mathematical entertaimentsProbabilistic Proofs
Alexander Shen
The Mathematical Intelligencer, 1998, 20 (3) : 29 - 31
[22] STRUCTURING MATHEMATICAL PROOFS
LERON, U
AMERICAN MATHEMATICAL MONTHLY, 1983, 90 (03): : 174 - 185
[23] ERRORS IN MATHEMATICAL PROOFS
ZAHLER, R
SCIENCE, 1976, 193 (4248) : 98 - 98
[24] PROOFS AND MATHEMATICAL EXPERIENCE
LOLLI, G
SCIENTIA, 1982, 117 (9-12): : 501 - 514
[25] Mathematical entertainmentsUnexpected proofs
Alexander Shen
Marcel Berger
András Hraskó
The Mathematical Intelligencer, 1999, 21 (3) : 48 - 50
[26] ON THE RELIABILITY OF MATHEMATICAL PROOFS
PERMINOV, VY
REVUE INTERNATIONALE DE PHILOSOPHIE, 1988, 42 (167) : 500 - 508
[27] Mathematical Explanations that are Not Proofs
Marc Lange
Erkenntnis, 2018, 83 : 1285 - 1302
[28] ON MATHEMATICAL PROOFS AND MEANING
CASTANEDA, HN
MIND, 1961, 70 (279) : 385 - 390
[29] Mathematical Explanations that are Not Proofs
Lange, Marc
ERKENNTNIS, 2018, 83 (06) : 1285 - 1302
[30] Mathematical characterizations and computational complexity of anti-slide puzzles
Minamisawa, Ko
Uehara, Ryuhei
Hara, Masao
THEORETICAL COMPUTER SCIENCE, 2023, 939 : 216 - 226

← 1 2 3 4 5 →