Pages that link to "Item:Q2969654"

The following pages link to Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication (Q2969654):

Displayed 8 items.

• The asymptotic induced matching number of hypergraphs: balanced binary strings (Q783062) ‎ (← links)
• A tight bound for Green's arithmetic triangle removal lemma in vector spaces (Q1673988) ‎ (← links)
• On arithmetic progressions in symmetric sets in finite field model (Q2200438) ‎ (← links)
• Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) ‎ (← links)
• Sunflowers and testing triangle-freeness of functions (Q2410684) ‎ (← links)
• Asymptotic tensor rank of graph tensors: beyond matrix multiplication (Q2422766) ‎ (← links)
• Universal points in the asymptotic spectrum of tensors (Q5039465) ‎ (← links)
• Removal lemmas and approximate homomorphisms (Q5886340) ‎ (← links)