NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Harry Buhrman, John M. Hitchcock. NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA. pages 1-7, IEEE Computer Society, 2008. [doi]

This author has not been identified. Look up 'Harry Buhrman' in GoogleThis author has not been identified. Look up 'John M. Hitchcock' in Google

runs on WebDSL