On the Maximal Cut in a Random Hypergraph
Crossref DOI link: https://doi.org/10.1134/S1064562421060181
Published Online: 2022-03-31
Published Print: 2021-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zakharov, P. A.
Shabanov, D. A.
Text and Data Mining valid from 2021-11-01
Version of Record valid from 2021-11-01
Article History
Received: 11 August 2021
Revised: 17 August 2021
Accepted: 8 September 2021
First Online: 31 March 2022
CONFLICT OF INTEREST
: The authors declare that they have no conflicts of interest.