Sunflowers and testing triangle-freeness of functions (Q2410684): Difference between revisions

Latest revision as of 13:39, 14 July 2024

scientific article; zbMATH DE number 6721731

Sunflowers and Testing Triangle-Freeness of Functions

Language	Label	Description	Also known as
English	Sunflowers and testing triangle-freeness of functions	scientific article; zbMATH DE number 6721731	Sunflowers and Testing Triangle-Freeness of Functions

Statements

instance of

scholarly article

0 references

title

Sunflowers and testing triangle-freeness of functions (English)

0 references

Sunflowers and Testing Triangle-Freeness of Functions (English)

0 references

0 references

0 references

Computational Complexity

0 references

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science

0 references

publication date

18 October 2017

0 references

19 May 2017

0 references

full work available at URL

https://arxiv.org/abs/1411.4692

0 references

zbMATH Keywords

property testing

0 references

triangle-freeness

0 references

sunflowers

0 references

lower bounds

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Testing subgraphs in large graphs

0 references

The monotone circuit complexity of Boolean functions

0 references

A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity

0 references

On Active and Passive Testing

0 references

On sunflowers and matrix multiplication

0 references

New bounds on cap sets

0 references

On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

0 references

A unified framework for testing linear‐invariant properties

0 references

Lower bounds for testing triangle-freeness in Boolean functions

0 references

Graph limits and parameter testing

0 references

A removal lemma for systems of linear equations over finite fields

0 references

Matrix multiplication via arithmetic progressions

0 references

On the hardness of approximating minimum vertex cover

0 references

Extensions of generalized product caps

0 references

An improved construction of progression-free sets

0 references

Intersection Theorems for Systems of Sets

0 references

Combinatorial properties of systems of sets

0 references

A new proof of the graph removal lemma

0 references

Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication

0 references

Property testing and its connection to learning and approximation

0 references

A Szemerédi-type regularity lemma in abelian groups, with applications

0 references

Q3549724

0 references

Q5689011

0 references

A combinatorial proof of the removal lemma for groups

0 references

A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression

0 references

On subsets of finite Abelian groups with no 3-term arithmetic progressions

0 references

Q3758729

0 references

Robust Characterizations of Polynomials with Applications to Program Testing

0 references

On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

0 references

A proof of Green's conjecture regarding the removal properties of sets of linear equations

0 references

Multiplying matrices faster than coppersmith-winograd

0 references

Identifiers

zbMATH Open document ID

1379.68340

0 references

1364.68362

0 references

DOI

10.1007/s00037-016-0138-7

0 references

10.1145/2688073.2688084

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2410684

@@ Property / cites work @@
+Testing subgraphs in large graphs
@@ Property / cites work: Testing subgraphs in large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
+Normal rank
@@ Property / cites work @@
+On Active and Passive Testing
@@ Property / cites work: On Active and Passive Testing / rank @@
+Normal rank
@@ Property / cites work @@
+On sunflowers and matrix multiplication
@@ Property / cites work: On sunflowers and matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds on cap sets
@@ Property / cites work: New bounds on cap sets / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
+Normal rank
@@ Property / cites work @@
+A unified framework for testing linear‐invariant properties
+Normal rank
@@ Property / cites work @@
+Lower bounds for testing triangle-freeness in Boolean functions
+Normal rank
@@ Property / cites work @@
+Graph limits and parameter testing
@@ Property / cites work: Graph limits and parameter testing / rank @@
+Normal rank
@@ Property / cites work @@
+A removal lemma for systems of linear equations over finite fields
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Extensions of generalized product caps
@@ Property / cites work: Extensions of generalized product caps / rank @@
+Normal rank
@@ Property / cites work @@
+An improved construction of progression-free sets
@@ Property / cites work: An improved construction of progression-free sets / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection Theorems for Systems of Sets
@@ Property / cites work: Intersection Theorems for Systems of Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial properties of systems of sets
@@ Property / cites work: Combinatorial properties of systems of sets / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof of the graph removal lemma
@@ Property / cites work: A new proof of the graph removal lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+A Szemerédi-type regularity lemma in abelian groups, with applications
+Normal rank
@@ Property / cites work @@
+Q3549724
@@ Property / cites work: Q3549724 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689011
@@ Property / cites work: Q5689011 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial proof of the removal lemma for groups
+Normal rank
@@ Property / cites work @@
+A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
+Normal rank
@@ Property / cites work @@
+On subsets of finite Abelian groups with no 3-term arithmetic progressions
+Normal rank
@@ Property / cites work @@
+Q3758729
@@ Property / cites work: Q3758729 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
+Normal rank
@@ Property / cites work @@
+A proof of Green's conjecture regarding the removal properties of sets of linear equations
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank