Sciweavers

179 search results - page 34 / 36
» eccc 2010
Sort
View
ECCC
2008
93views more  ECCC 2008»
13 years 7 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
ECCC
2010
117views more  ECCC 2010»
13 years 6 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
ECCC
2010
98views more  ECCC 2010»
13 years 4 months ago
Efficient Semantic Communication via Compatible Beliefs
In previous works, Juba and Sudan [6] and Goldreich, Juba and Sudan [4] considered the idea of "semantic communication", wherein two players, a user and a server, attemp...
Brendan Juba, Madhu Sudan
ECCC
2010
98views more  ECCC 2010»
13 years 6 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
ECCC
2010
99views more  ECCC 2010»
13 years 7 months ago
A Unified Framework for Testing Linear-Invariant Properties
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapir...