Conceptio › Archive › arXiv (All)
arXiv (All)open access

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing

Černý, Marek et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitydata-structures-and-algorithmsdiscrete-mathematicslogic-in-computer-science
computational complexity, discrete mathematics, data structures and algorithms, logic in computer science
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 974279
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.