Related news

Published: 18/06/2018We show that a small subset of seeds of any strong extractor also gives a strong extractor with similar parameters when the number of output bits is a constant. Specifically, if $Ext: \{0,1\}^n \times ... Read moreSource: weizmann.ac.il


Published: 6/06/2018We show that for $k \geq 5$, the PPSZ algorithm for $k$SAT runs exponentially faster if there is an exponential number of satisfying assignments. More precisely, we show that for every $k\geq 5$, the ... Read moreSource: weizmann.ac.il

Published: 6/06/2018We construct pseudorandom generators of seed length $\tilde{O}(\log(n)\cdot \log(1/\epsilon))$ that $\epsilon$fool ordered readonce branching programs (ROBPs) of width $3$ and length $n$. For unorde ... Read moreSource: weizmann.ac.il

Published: 4/06/2018We study the task of seedless randomness extraction from recognizable sources, which are uniform distributions over sets of the form {x : f(x) = v} for functions f in some specified class C. We give t ... Read moreSource: weizmann.ac.il

Published: 4/06/2018An Oblivious RAM (ORAM) introduced by Goldreich and Ostrovsky [JACM'96] is a (possibly randomized) RAM, for which the memory access pattern reveals no information about the operations performed. T ... Read moreSource: weizmann.ac.il

Published: 2/06/2018We consider normalized Boolean circuits that use binary operations of disjunction and conjunction, and unary negation, with the restriction that negation can be only applied to input variables. We der ... Read moreSource: weizmann.ac.il

Published: 31/05/2018We present a distribution $D$ over inputs in $\{1,1\}^{2N}$, such that: (1) There exists a quantum algorithm that makes one (quantum) query to the input, and runs in time $O(\log N)$, that distinguis ... Read moreSource: weizmann.ac.il

Published: 30/05/2018Given the polygonal schema embedding of an $O(log n)$ genus graph $G$ and two vertices $s$ and $t$ in $G$, we show that deciding if there is a path from $s$ to $t$ in $G$ is in unambiguous logarithmic ... Read moreSource: weizmann.ac.il

Published: 30/05/2018We show that any language in nondeterministic time $\exp(\exp(\cdots\exp(n)))$, where the number of iterated exponentials is an arbitrary function $R(n)$, can be decided by a multiprover interactive p ... Read moreSource: weizmann.ac.il

Published: 29/05/2018The standard models of testing graph properties postulate that the vertexset consists of $\{1,2,...,n\}$, where $n$ is a natural number that is given explicitly to the tester. Here we suggest more fl ... Read moreSource: weizmann.ac.il

Published: 27/05/2018We consider relative error low rank approximation of tensors with respect to the Frobenius norm. Namely, given an order$q$ tensor $A \in \mathbb{R}^{\prod_{i=1}^q n_i}$, output a rank$k$ tensor $B$ ... Read moreSource: weizmann.ac.il

Published: 22/05/2018For quantified Boolean formulas (QBF) there are two main different approaches to solving: QCDCL and expansion solving. In this paper we compare the underlying proof systems and show that expansion sys ... Read moreSource: weizmann.ac.il
Related Hashtags
Most read

Leftists Blame Trump for 2014 Photo Of Caged Illegals
Source: www.infowars.com 
What people are saying about Golden KnightsCapitals Game 1
Source: www.reviewjournal.com 
Test Your Magical IQ at Warner Bros Harry Potter Quiz Night
Source: www.theleakycauldron.org 
Richard Branson backs mum who had cannabis oil for epileptic son, 12, confiscated at Heathrow
Source: mirror.co.uk
FACEBOOK
Loading...