3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.LG2017★ 3 cited
A learning problem that is independent of the set theory ZFC axioms
Shai Ben-David, Pavel Hrubes, Shay Moran +2
We consider the following statistical estimation problem: given a family F of real valued functions over some domain X and an i.i.d. sample drawn from an unknown distribution P ove…
cs.CC2009★ 2 cited
Homogeneous formulas and symmetric polynomials
Pavel Hrubes, Amir Yehudayoff
We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at lea…
math.LO2007
On hierarchies of universal predicates
Pavel Hrubes
We investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as…