Abstract
We study the complexity classes 𝖯 and 𝖭𝖯 through a semigroup 𝖿𝖯 ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. The semigroup 𝖿𝖯 is non-regular if and only if 𝖯 ≠ 𝖭𝖯. The one-way functions considered here are based on worst-case complexity (they are not cryptographic); they are exactly the non-regular elements of 𝖿𝖯. We prove various properties of 𝖿𝖯, e.g. that it is finitely generated. We define reductions with respect to which certain universal one-way functions are 𝖿𝖯-complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
