Upper bounds on the 2-colorability threshold of random d-regular k-uniform hypergraphs for k≥3.
Evan ChangNeel KolheYoungtak SohnPublished in: CoRR (2023)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- lower and upper bounds
- upper bounding
- tight bounds
- branch and bound algorithm
- efficiently computable
- branch and bound
- sample size
- threshold selection
- optimal solution
- data sets
- phase transition
- learning theory
- generalization error
- linear programming
- multi class
- uniformly distributed
- scheduling problem
- neural network