Nearly tight bounds for testing function isomorphism
From MaRDI portal
Publication:2840979
DOI10.1137/110832677zbMATH Open1275.68072OpenAlexW2052003531MaRDI QIDQ2840979FDOQ2840979
Authors: Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano, Arie Matsliah 
Publication date: 24 July 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110832677
Recommendations
Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (15)
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
- Testing linear-invariant function isomorphism
- Attribute estimation and testing quasi-symmetry
- Tolerant junta testing and the connection to submodular optimization and function isomorphism
- Local correction with constant error rate
- Tight lower bounds for testing linear isomorphism
- Property testing bounds for linear and quadratic functions via parity decision trees
- Efficient sample extractors for juntas with applications
- The query complexity of graph isomorphism: bypassing distribution testing lower bounds
- Testing Boolean functions properties
- Tolerant junta testing and the connection to submodular optimization and function isomorphism
- Testing Boolean function isomorphism
- Isomorphism testing of Boolean functions computable by constant-depth circuits
- Nearly tight bounds for testing function isomorphism
- Partially symmetric functions are efficiently isomorphism testable
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)
