Skip to main content
University of Oxford Department of Computer Science
  Contact Us     Search  
  1. Home
  2. Research
  3. Publications
  4. On the complexity of the approximate hypergraph homomorphism problem

On the complexity of the approximate hypergraph homomorphism problem

Lorenzo Ciardo‚ Marcin Kozik‚ Andrei Krokhin‚ Tamio−Vesa Nakajima and Stanislav Živǹy

Journal
arXiv preprint arXiv:2302.03456
Year
2023

Links

See Also

Back to Top