Abstract
In this paper, we will consider the problem of designing an efficient algorithm that finds an $\epsilon$-regular partition of an l-uniform hypergraph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
