Abstract
It is proved that for each fixed composite number k, the circuit complexity of the problem which is to check if an arbitrary function f(x 1, ..., x n ) over a residue ring modulo k given by its value vector with length N = k n and, if so, to construct its polynomial representation is linear.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. E. Shannon, “A Symbolic Analysis of Relay and Switching Circuits,” Trans. AIEE 57, 713–723 (1938).
O. B. Lupanov, “On a Circuit Synthesis Procedure,” Izv. Vyssh. Uchebn. Zaved., Radiofiz. 1, 120–140 (1958).
N. P. Red’kin, “Proof of Minimality of Some Circuits of Functors,” Probl. Kibern., No. 23, 83–101 (1970).
V. I. Reznik, “Realization of Monotonic Functions with Circuits of Functors,” Dokl. Akad. Nauk SSSR 139, 566–569 (1961).
E. P. Soprunenko, “On the Minimal Realization of Some Functions with Circuits of Functors,” Probl. Kibern., No. 15, 117–134 (1965)].
C. P. Schnorr, “Zwei Lineare Untere Schranken für die Romplexitat Boolescher Funktionen,” Computing. Arch. Elektron. Rechnen 13, 155–171 (1974).
S. A. Lozhkin and A. A. Semenov, “On an Information Compression Technique and on Complexity of Realization of Monotonic Symmetric Functions,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 7, 44–52 (1988).
N. P. Red’kin, “On the Minimal Realization of a Binary Adder,” Probl. Kibern., No. 38, 181–216 (1981).
A. A. Karatsuba and Yu. P. Ofman, “Multiplication of Multidigit Numbers on Automata,” Dokl. Akad. Nauk SSSR 145, 293–294 (1962).
A. Schonhage and V. Strassen, “Schnelle Multiplikation Grober Zahien,” Computing. Arch. Elektron. Rechnen 7, 281–292 (1971).
M. J. Fischer and A. R. Meyer, “Boolean Matrix Multiplication and Transitive Closure,” in IEEE Conf. Record 12th Ann. Symp. on Switching and Automata Theory, East Lansing, MI, USA, 1971 (IEEE, New Jork, 1971), pp. 129–131.
V. B. Alekseev, “Stepped Bilinear Algorithms and Recognition of Fullness in k-Valued Logics,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 7, 19–27 (1988).
A. A. Voronenko, “On Complexity of Monotonicity Recognition,” Mat. Vopr. Kibern. 8, 301–303 (1999).
A. A. Voronenko, “On a Decomposition Method for Recognizing Membership in Invariant Classes,” Diskret. Mat. 14(4), 110–116 (2002).
S. V. Yablonskii, “Functional Constructions in k-Valued Logics,” Trudy MIAN 51, 5–142 (1958).
S. N. Selezneva, “Fast Construction Algorithm for k-Valued Functions of Modulo k Polynomials for Compound k,” Diskret. Mat. 23(3), 3–22 (2011).
I. Niven and L. J. Warren, “A Generalization of Fermat’s Theorem,” Proc. Am. Math. Soc. 8, 306–313 (1957).
D. Singmaster, “On Polynomial Functions (Mod M),” J. Number Theory 6, 345–352 (1974).
G. P. Gavrilov and A. A. Sapozhenko, Coolection of Problems on Discrete Mathematics (Nauka, Moscow, 1977) [in Russian].
D. G. Meshchaninov, “Method for Constructions of Polynomials for Functions of k-Valued Logic,” Diskret. Mat. 7(3), 48–60 (1985).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.N. Selezneva, 2013, published in Vestnik Moskovskogo Universiteta. Vychislitel’naya Matematika i Kibernetika, 2013, No. 1, pp. 21–25.
About this article
Cite this article
Selezneva, S.N. The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear. MoscowUniv.Comput.Math.Cybern. 37, 21–25 (2013). https://doi.org/10.3103/S0278641913010032
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641913010032