Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In
Crossref DOI link: https://doi.org/10.3103/S002713222106005X
Published Online: 2022-03-15
Published Print: 2021-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kombarov, Yu. A.
Text and Data Mining valid from 2021-12-01
Version of Record valid from 2021-12-01
Article History
Received: 21 October 2020
First Online: 15 March 2022
CONFLICT OF INTEREST
: The author declares that he has no conflicts of interest.