All Superlinear Inverse Schemes are coNP-Hard

Details All Superlinear Inverse Schemes are coNP-Hard All Superlinear Inverse Schemes are coNP-Hard

2004-10-12

arxiv.org/abs/cs/0410023v1

Computer Science

Computational Complexity

Conf. version was in MFCS 2004

Scientific paper

How hard is it to invert NP-problems? We show that all superlinearly
certified inverses of NP problems are coNP-hard. To do so, we develop a novel
proof technique that builds diagonalizations against certificates directly into
a circuit.

Affiliated with

Also associated with

No associations

Rating

All Superlinear Inverse Schemes are coNP-Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with All Superlinear Inverse Schemes are coNP-Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and All Superlinear Inverse Schemes are coNP-Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-718456