Abstract
The FO and FOM classes are small classes of recursive functions that characterize parallel computing with constant running time and a polynomial number of processors. The article provides an overview of the results describing the basic properties of the FO and FOM classes. Various ways of defining these classes and proving the equivalence of these definitions are given. The position of FO and FOM in the hierarchy of complexity classes is characterized. The results on the affiliation of various functions to the FO and FOM classes are presented. Superposition bases in the FO and FOM classes are described and a complete proof of the result on the superposition basis in the FOM class, consisting only of simple, mainly arithmetic functions, is given.
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.
