Sciweavers

6 search results - page 1 / 2
» The P versus NP Brief
Sort
View
CORR
2007
Springer
65views Education» more  CORR 2007»
13 years 5 months ago
The P versus NP Brief
Mikael Franzen
JSC
2010
94views more  JSC 2010»
13 years 3 months ago
P versus NP and geometry
In this primarily expository article, I describe geometric approaches to variants of P v. NP, present several results that illustrate the role of group actions in complexity theory...
J. M. Landsberg
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
14 years 5 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow
KONVENS
2000
13 years 9 months ago
Scaling up. Using the WWW to Resolve PP Attachment Ambiguities
We have developed a method to resolve ambiguities in prepositional phrase (PP) attachment in German. We measure on the one hand the cooccurrence strength between nouns (N) and pre...
Martin Volk
ECCC
2008
168views more  ECCC 2008»
13 years 5 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson