The relative complexity of NP search problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. The relative complexity of NP search problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 303-314, ACM, 1995. [doi]

This author has not been identified. Look up 'Paul Beame' in GoogleThis author has not been identified. Look up 'Stephen A. Cook' in GoogleThis author has not been identified. Look up 'Jeff Edmonds' in GoogleThis author has not been identified. Look up 'Russell Impagliazzo' in GoogleThis author has not been identified. Look up 'Toniann Pitassi' in Google

runs on WebDSL