Why the Concept of Computational Complexity is Hard for Verifiable Mathematics (Extended Abstract)
Open access
Author
Date
2015Type
- Working Paper
ETH Bibliography
yes
Altmetrics
Permanent link
https://doi.org/10.3929/ethz-a-010520978Publication status
publishedPublisher
Eidgenössische Technische Hochschule ZürichSubject
SATISFIABILITY (MATHEMATICS); AUTOMATED THEOREM PROVING (MATHEMATICAL LOGIC); AUTOMATISCHE BEWEISFÜHRUNG (MATHEMATISCHE LOGIK); ERFÜLLBARKEIT (MATHEMATIK); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); ALGORITHMIC COMPLEXITY (MATHEMATICS)Organisational unit
03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
02150 - Dep. Informatik / Dep. of Computer Science
More
Show all metadata
ETH Bibliography
yes
Altmetrics