On the computational complexity of finite functions and semigroup multiplication

DOI10.1016/S0020-0255(70)80040-8MaRDI QIDQ2548857zbMATH OpenFDO

Authors P. M. Spira

Publication date 1970

Published in Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semigroups in automata theory, linguistics, etc. (20M35)

Cites work

• scientific article; zbMATH DE number 3133387 (Why is no real title available?)
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3287733 (Why is no real title available?)
• On the Time Required to Perform Addition
• On the Time Required to Perform Multiplication
• The Time Required for Group Multiplication

This page was built for publication: On the computational complexity of finite functions and semigroup multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2548857)