Quotes by Mark Krentel
-
Voting:
-
0
+
All NP-completeness proofs are proof-by-example.— Mark Krentel · Nov. 7, 1984 · Permalink
-
Voting:
-
0
+
A B-tree is a 2-3 tree, for large values of 2 and 3.— Mark Krentel · Jan. 20, 1981 · Permalink