35 citations · 115 across the 15 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 8 cited
Root finding with threshold circuits
Emil Jeřábek
We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a…
math.LO2011★ 27 cited
The ubiquity of conservative translations
Emil Jeřábek
We study the notion of conservative translation between logics introduced by Feitosa and D'Ottaviano. We show that classical propositional logic (CPC) is universal in the sense tha…