Re: Looking for EXPTIME-algorithm

Unruh wrote:
daw@xxxxxxxxxxxxxxxxxxxxxxxx (David Wagner) writes:
it is even plausible that
inverting f will take EXPTIME (though of course you will never get any
proof of this).

Since the problem is in NP, (by assumption f is easy to calculate-- ie is
in P) proving it would be a proof that P!=NP.

Yeah. That's basically what I was thinking of, but I didn't
say it very clearly. Thanks.
.