The truly subquadratic map-isomorphism conjecture for unrestricted genus
Statement
A map is a -cell decomposition of a closed compact surface, and its size is measured by , the number of darts. Two maps are isomorphic when there is a bijection preserving their vertex-edge-face incidences. The genus is unrestricted when no bound on the genus of the underlying surface is imposed.
Map-isomorphism conjecture. There is no for which there is an algorithm for testing isomorphism of maps of unrestricted genus in time
The currently described algorithm gives an procedure, which is not considered truly subquadratic; the conjecture asserts that no polynomial improvement to an exponent strictly below is possible. Its resolution is not supplied here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.