Lower Bounds for Testing Triangle-freeness in Boolean Functions

14 years 8 months ago

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

Boolean Functions | Discrete Algorithms | SODA 2010 |

claim paper

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

Comments (0)