Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Komarath, Balagopal, Narayanan, Rohit
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2511.03388