We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...