35 citations · 115 across the 15 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 35 cited
Integer factoring and modular square roots
Emil Jeřábek
Buresh-Oppenheim proved that the NP search problem to find nontrivial factors of integers of a special form belongs to Papadimitriou's class PPA, and is probabilistically reducible…
math.LO2012★ 11 cited
Sequence encoding without induction
Emil Jeřábek
We show that the universally axiomatized, induction-free theory PA^- is a sequential theory in the sense of Pudlák [5], in contrast to the closely related Robinson's arithmetic.