11 citations · 35 across the 26 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.LO2014★ 6 cited
The Complexity of Primes in Computable UFDs
Damir D. Dzhafarov, Joseph R. Mileti
In many simple integral domains, such as or , there is a straightforward procedure to determine if an element is prime by simply reducing to a direct ch…
math.LO2014★ 1 cited
Notions of robust information coding
Damir Dzhafarov, Gregory Igusa
We introduce and study several notions of computability-theoretic reducibility between subsets of that are "robust" in the sense that if only partial information is available a…