Related news

Published: 3/11/2017We construct pseudorandom generators with improved seed length for several classes of tests. First we consider the class of readonce polynomials over GF(2) in $m$ variables. For error $\e$ we obtain ... Read moreSource: weizmann.ac.il


Published: 3/11/2017A map $f:[n]^{\ell}\to[n]^{n}$ has locality $d$ if each output symbol in $[n]=\{1,2,\ldots,n\}$ depends only on $d$ of the $\ell$ input symbols in $[n]$. We show that the output distribution of a $d$ ... Read moreSource: weizmann.ac.il

Published: 3/11/2017We characterize the size of monotone span programs computing certain "structured" boolean functions by the Nullstellensatz degree of a related unsatisfiable Boolean formula. This yields the ... Read moreSource: weizmann.ac.il

Published: 3/11/2017We introduce the problem of *shadow tomography*: given an unknown $D$dimensional quantum mixed state $\rho$, as well as known twooutcome measurements $E_{1},\ldots,E_{M}$, estimate the probability t ... Read moreSource: weizmann.ac.il

Published: 2/11/2017In this paper we study the complexity of constructing a hitting set for $\overline{VP}$, the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomia ... Read moreSource: weizmann.ac.il

Published: 2/11/2017Arithmetic complexity, the study of the cost of computing polynomials via additions and multiplications, is considered (for many good reasons) simpler to understand than Boolean complexity, namely com ... Read moreSource: weizmann.ac.il

Published: 1/11/2017Nisan (Combinatorica'92) constructed a pseudorandom generator for length $n$, width $n$ readonce branching programs (ROBPs) with error $\varepsilon$ and seed length $O(\log^2{n} + \log{n} \cdot \ ... Read moreSource: weizmann.ac.il

Published: 29/10/2017Gurus are individuals who claim to possess mental powers of insight and prediction that far surpass those of the average person; they compete over followers, offering them insight in return for contin ... Read moreSource: weizmann.ac.il

Published: 15/10/2017ChvatalGomory (CG) cuts and the BienstockZuckerberg hierarchy capture useful linear programs that the standard bounded degree Lasserre/SumofSquares (SOS) hierarchy fails to capture. In this paper ... Read moreSource: weizmann.ac.il

Published: 13/10/2017Distribution testing is an area of property testing that studies algorithms that receive few samples from a probability distribution D and decide whether D has a certain property or is far (in total v ... Read moreSource: weizmann.ac.il

Published: 12/10/2017We relate different approaches for proving the unsatisfiability of a system of real polynomial equations over Boolean variables. On the one hand, there are the static proof systems SheraliAdams and s ... Read moreSource: weizmann.ac.il

Published: 11/10/2017Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates ... Read moreSource: weizmann.ac.il

Published: 11/10/2017Let $f$ be a Boolean function on $n$bits, and $\mathsf{IP}$ the innerproduct function on $2b$ bits. Let $f^{\mathsf{IP}}:=f \circ \mathsf{IP}^n$ be the two party function obtained by composing $f$ w ... Read moreSource: weizmann.ac.il

Published: 9/10/2017We introduce and develop a new semialgebraic proof system, called Stabbing Planes that is in the style of DPLLbased modern SAT solvers. As with DPLL, there is only one rule: the current polytope can ... Read moreSource: weizmann.ac.il

Published: 8/10/2017We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions, and are equal to the fractional block sensitivity $\text{fbs}(f)$. That inclu ... Read moreSource: weizmann.ac.il

Published: 8/10/2017Consider a random sequence of $n$ bits that has entropy at least $nk$, where $k\ll n$. A commonly used observation is that an average coordinate of this random sequence is close to being uniformly di ... Read moreSource: weizmann.ac.il

Published: 6/10/2017The directsum question is a classical question that asks whether performing a task on $m$ independent inputs is $m$ times harder than performing it on a single input. In order to study this question, ... Read moreSource: weizmann.ac.il
Related Hashtags
Most read

Electric shock from broken phone cable kills teen
Source: www.straitstimes.com 
Messer Chups – Taste The Blood Of Guitaracula (2017)
Source: newalbumreleases.net 
Eastern Railway Recruitment 2017 for 863 Act Apprentice Posts; 10th pass can apply
Source: www.jagranjosh.com 
Destiny 2 weekly reset for November 21 – Nightfall, Challenges, Flashpoint, Call to Arms and more detailed
Source: www.vg247.com 
MyRepublic snags $70m investment to scale up products, services and grow regionally
Source: www.straitstimes.com 
A ‘Primer’ About Rimfire Vs. Centerfire Ammunition
Source: www.ammoland.com 
Find out which side YOUR family was on in the Wars of the Roses using this simple test
Source: mirror.co.uk 
Question of the Day: What Gun Stuff Are You Buying on Black Friday?
Source: www.thetruthaboutguns.com
FACEBOOK
Loading...