Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
1
0
0
The complexity of continuous graph homomorphisms from higher-dimensional Schreier graphs is fully characterized, revealing a $\Sigma^0_1$-complete set of receiving graphs.