Combinatorial Designs, Difference Sets, and Bent Functions as Perfect Colorings of Graphs and Multigraphs
Crossref DOI link: https://doi.org/10.1134/S0037446620050109
Published Online: 2020-09-28
Published Print: 2020-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Potapov, V. N.
Avgustinovich, S. V.
Text and Data Mining valid from 2020-09-01
Version of Record valid from 2020-09-01
Article History
Received: 18 February 2020
Revised: 16 March 2020
Accepted: 8 April 2020
First Online: 28 September 2020