Nearly tight bounds for testing function isomorphism
From MaRDI portal
Publication:2840979
Recommendations
Cited in
(15)- Tolerant junta testing and the connection to submodular optimization and function isomorphism
- Nearly tight bounds for testing function isomorphism
- Tight lower bounds for testing linear isomorphism
- Local correction with constant error rate
- Attribute estimation and testing quasi-symmetry
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
- Testing Boolean functions properties
- Efficient sample extractors for juntas with applications
- Property testing bounds for linear and quadratic functions via parity decision trees
- Tolerant junta testing and the connection to submodular optimization and function isomorphism
- The query complexity of graph isomorphism: bypassing distribution testing lower bounds
- Testing linear-invariant function isomorphism
- Partially symmetric functions are efficiently isomorphism testable
- Testing Boolean function isomorphism
- Isomorphism testing of Boolean functions computable by constant-depth circuits
This page was built for publication: Nearly tight bounds for testing function isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840979)