MathDB1 problem
- 0 votes0 replies0 views
The characterization conjecture for efficiently isomorphism-testable Boolean functions
Characterization conjecture. Partially symmetric functions are essentially the only functions for which isomorphism testing can be performed with a constant number of queries.