What complexity class results would be implied by a proof of the existence of one way functions. (Apart from the obvious $P \neq NP$)
I thik it would imply $P \neq UP$, but what else?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community