People, Problems, and Proofs
From MaRDI portal
Publication:2864226
DOI10.1007/978-3-642-41422-0zbMath1305.68025OpenAlexW4256668924WikidataQ107209465 ScholiaQ107209465MaRDI QIDQ2864226
Richard J. Lipton, Kenneth W. Regan
Publication date: 6 December 2013
Full work available at URL: https://doi.org/10.1007/978-3-642-41422-0
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) History of computer science (68-03) General histories, source books (01A05) Theory of computing (68Qxx)
Related Items (2)
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
This page was built for publication: People, Problems, and Proofs