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
-
-
3 Common Pitfalls in Microservice Integration – And How to Avoid Them
Related Sponsored Content
-
-
Related Sponsor
Community comments
Mostly true
by Jules Jacobs /
Mostly true
by Jules Jacobs /
Your message is awaiting moderation. Thank you for participating in the discussion.
While this presentation contains mostly true statements, it also contains some falsehoods (prime factorization is in fact in NP contrary to his claim) and unsubstantiated claims (solving sudokus with a unique solution is in P). Perhaps it would be wise to ask for fact checking by an expert in the field, since the previous presentation by the same presenter also contained some obvious falsehoods (e.g. that lookup in vectors based on hash tries is faster than in lookup in arrays). Otherwise a nice presentation!