InfoQ Homepage Presentations Deconstructing P vs. NP (or why I hate Sudoku)
Deconstructing P vs. NP (or why I hate Sudoku)
28:31
Summary
Daniel Spiewak discusses the question of whether or not the complexity class NP-time is fully defined by the complexity class P-time issue.
Bio
Daniel Spiewak is a software developer based out of Wisconsin, USA. Over the years, he has worked with Java, Scala, Ruby, C/C++, ML, Clojure and several experimental languages. He currently spends most of his free time researching parser theory and methodologies, particularly areas where the field intersects with functional language design, domain-specific languages and type theory.
About the conference
Strange Loop is a multi-disciplinary conference that aims to bring together the developers and thinkers building tomorrow's technology in fields such as emerging languages, alternative databases, concurrency, distributed systems, mobile development, and the web. Strange Loop was created in 2009 by software developer Alex Miller and is now run by a team of St. Louis-based friends and developers under Strange Loop LLC, a for-profit but not particularly profitable venture.
Jan 25, 2013