Sciweavers

ECCC
2008
93views more  ECCC 2008»
13 years 11 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
2008
104views more  ECCC 2008»
13 years 11 months ago
Property Testing of Equivalence under a Permutation Group Action
Sourav Chakraborty, László Babai
ECCC
2008
108views more  ECCC 2008»
13 years 11 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
ECCC
2008
98views more  ECCC 2008»
13 years 11 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ECCC
2008
74views more  ECCC 2008»
13 years 11 months ago
The Sign-Rank of AC^0
Alexander A. Razborov, Alexander A. Sherstov
ECCC
2008
80views more  ECCC 2008»
13 years 11 months ago
A simple proof of Bazzi's theorem
Alexander A. Razborov
ECCC
2008
107views more  ECCC 2008»
13 years 11 months ago
A Quantum Time-Space Lower Bound for the Counting Hierarchy
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
Dieter van Melkebeek, Thomas Watson