Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

2

JCSS
1998

favoriteEmaildiscussreport

45views more JCSS 1998»

The Relative Complexity of NP Search Problems

13 years 4 months ago

The Relative Complexity of NP Search Problems

Download www.cs.washington.edu

Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell

Real-time Traffic

JCSS 1998 |

claim paper

Related Content

» Towards AverageCase Complexity Analysis of NP Optimization Problems

» Relativized NP Search Problems and Propositional Proof Systems

» An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision P...

» Understanding the MulmuleySohoni Approach to P vs NP

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

» The Closure of Monadic NP

» A note on the size of Craig Interpolants

» On the Compressibility of NP Instances and Cryptographic Applications

» If NP Languages are Hard on the WorstCase Then it is Easy to Find Their Hard Instances

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	JCSS
Authors	Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi

Comments (0)