Search
Search Results
-
Investigating the impact of calibration on the quality of explanations
Predictive models used in Decision Support Systems (DSS) are often requested to explain the reasoning to users. Explanations of instances consist of...
-
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomised algorithm for the following problem:...
-
On Hitting-Set Generators for Polynomials that Vanish Rarely
The problem of constructing pseudorandom generators for polynomials of low degree is fundamental in complexity theory and has numerous well-known...
-
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of...
-
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
This work studies the question of quantified derandomization , which was introduced by Goldreich and Wigderson (STOC 2014). The generic quantified...
-
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace
We show that approximating the second eigenvalue of stochastic operators is
BPL -complete, thus giving a natural problem complete for this class. We... -
Sparse affine-invariant linear codes are locally testable
We show that sparse affine-invariant linear properties over arbitrary finite fields are locally testable with a constant number of queries. Given a...
-
DNF sparsification and a faster deterministic counting algorithm
Given a
DNF formula f on n variables, the two natural size measures are the number of terms or size s ( f ) and the maximum width of a term w ( f ). It is... -
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper, we give the first construction of a pseudorandom generator, with seed length O (log n ), for CC 0 [ p ], the class of constant-depth...
-
Discovering the suitability of optimisation algorithms by learning from evolved instances
The suitability of an optimisation algorithm selected from within an algorithm portfolio depends upon the features of the particular instance to be...
-
A New Characterization of ACC0 and Probabilistic CC0
Barrington, Straubing & Thérien (1990) conjectured that the Boolean A nd function can not be computed by polynomial size constant depth circuits built...