Last update: Sun Oct 15 02:37:03 MDT 2017
@Article{Knuth:2012:SAC, author = "Donald Knuth", title = "Satisfiability and The Art of Computer Programming", journal = j-LECT-NOTES-COMP-SCI, volume = "7317", pages = "15--15", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-31612-8_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:19:56 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib", URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-31612-8_2", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-31612-8", book-URL = "http://www.springerlink.com/content/978-3-642-31612-8", fjournal = "Lecture Notes in Computer Science", }