Tau单向函数类的存在性证明P!= NP
The Existence of the Tau One-Way Functions Class as a Proof that P != NP
摘要:
我们证明P!= NP通过证明一类函数的存在性,我们称之为Tau,其每个成员都满足单向函数的条件。Tau的每个成员都是一个可以在多项式时间内计算的函数,通过任何多项式概率算法找到其逆的概率可以忽略。我们还证明,没有多项式时间算法存在的Tau成员的逆计算,并计算Tau的逆的问题不能减少到FSAT在多项式时间。
英文摘要:
We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible probability of finding its inverse by any polynomial probabilistic algorithm. We also prove that no polynomial-time algorithm exists to compute the inverse of members of Tau, and that the problem of computing the inverse of Tau cannot be reduced to FSAT in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。