Algorithmic barriers falling: P = NP? A conversation with Donald E. Knuth conducted by Edgar G. Daylight on 18 June 2014 in Paris. Edited by Kurt De Grave (Q3457265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 6520902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic barriers falling: P = NP? A conversation with Donald E. Knuth conducted by Edgar G. Daylight on 18 June 2014 in Paris. Edited by Kurt De Grave |
scientific article; zbMATH DE number 6520902 |
Statements
14 December 2015
0 references
D. E. Knuth
0 references
complexity theory
0 references
TeX
0 references
0.7691236734390259
0 references
0.7671576142311096
0 references
0.7136030793190002
0 references
0.7094027996063232
0 references
