A fast algorithm for the disjunctive decomposition of m-valued functions. II. Time complexity analysis

S.B Abugharbieh,S.C Lee

doi:10.1109/ismvl.1993.289570

A fast algorithm for the disjunctive decomposition of m-valued functions. II. Time complexity analysis

S.B Abugharbieh, S.C Lee

https://doi.org/10.1109/ismvl.1993.289570

Copy DOI

Publication Date: May 24, 1993

Citations: 2

Affiliation: University of Oklahoma

#Random Functions #M-valued Functions + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

For part I see ibid., p.118-25. The time complexity of the fast algorithm for the disjunctive decomposition of m-valued functions, proposed in part I is studied. A probabilistic approach is used to estimate the time complexity for random m-valued functions, where several statistical properties of such functions are obtained and used in the analysis. It is shown that the time complexity for random functions is of the order of (nm)/sup 3/. In the case in which a random function has a single disjunctive decomposition, the time complexity becomes of the order n/sup 3/m/sup n/. The algorithm was simulated on a digital computer. The experimental results are in agreement with the theoretical predictions. >

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 call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: 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.