BT

New Early adopter or innovator? InfoQ has been working on some new features for you. Learn more

You are now in FULL VIEW
CLOSE FULL VIEW

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

| by Daniel Spiewak Follow 1 Followers 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.

Sponsored Content

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.

Login to InfoQ to interact with what matters most to you.


Recover your password...

Follow

Follow your favorite topics and editors

Quick overview of most important highlights in the industry and on the site.

Like

More signal, less noise

Build your own feed by choosing topics you want to read about and editors you want to hear from.

Notifications

Stay up-to-date

Set up your notifications and don't miss out on content that matters to you

BT