Ignacio Barros
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Logic×1Complexity×1
Frequent co-authors
Research Timeline
2026
Algebraic Circuits Over Sum and Shift and Existential Presburger Arithmetic with Divisibility
This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.
Highlighted terms show continued research focus across papers