BT
x Your opinion matters! Please fill in the InfoQ Survey about your reading habits!
You are now in FULL VIEW
CLOSE FULL VIEW

Deconstructing P vs. NP (or why I hate Sudoku)
Recorded at:

by Daniel Spiewak on Jan 25, 2013 |
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.

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.

General Feedback
Bugs
Advertising
Editorial
InfoQ.com and all content copyright © 2006-2014 C4Media Inc. InfoQ.com hosted at Contegix, the best ISP we've ever worked with.
Privacy policy
BT