scientific article; zbMATH DE number 6297692
From MaRDI portal
Publication:5417609
zbMath1288.68087MaRDI QIDQ5417609
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)
Related Items (4)
Invariance in Property Testing ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Unnamed Item ⋮ Lower bounds for testing triangle-freeness in Boolean functions
This page was built for publication:
