Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

SODA
2010
ACM

favoriteEmaildiscussreport

175views Algorithms» more SODA 2010»

Lower Bounds for Testing Triangle-freeness in Boolean Functions

14 years 1 months ago

Lower Bounds for Testing Triangle-freeness in Boolean Functions

Download web.mit.edu

Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in

Arnab Bhattacharyya, Ning Xie

Real-time Traffic

Boolean Functions | Discrete Algorithms | SODA 2010 |

claim paper

Related Content

» Testing TriangleFreeness in General Graphs

» DistributionFree Testing Lower Bounds for Basic Boolean Functions

» Lower Bounds for Testing Function Isomorphism

» Property Testing Lower Bounds via Communication Complexity

» On lower bounds on secondorder nonliearities of bent functions obtained by using Niho powe...

» Testing Fourier Dimensionality and Sparsity

» Nearly Tight Bounds for Testing Function Isomorphism

» A Lower Bound for Primality

» Circuit Complexity and Multiplicative Complexity of Boolean Functions

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Arnab Bhattacharyya, Ning Xie

Comments (0)