Erfan Khaniki

14 papers A* 3A 2Journal 9
YearRankTypeTitle / Venue / Authors
2025 A* conf
The Proof Analysis Problem.
FOCS
Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki
2025 J jnl
The Proof Analysis Problem.
CoRR
Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki
2025 J jnl
The provably total functions of basic arithmetic and its extensions.
Arch. Math. Log.
Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari
2024 A* conf
From Proof Complexity to Circuit Complexity via Interactive Protocols.
ICALP
Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
2024 J jnl
From Proof Complexity to Circuit Complexity via Interactive Protocols.
CoRR
Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
2024 A* conf
Jump Operators, Interactive Proofs and Proof Complexity Generators.
FOCS
Erfan Khaniki
2024 A conf
TFNP Intersections Through the Lens of Feasible Disjunction.
ITCS
Pavel Hubácek, Erfan Khaniki, Neil Thapen
2022 J jnl
New Relations and Separations of conjectures about Incompleteness in the finite Domain.
J. Symb. Log.
Erfan Khaniki
2022 A conf
Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds.
CCC
Erfan Khaniki
2022 J jnl
Nisan-Wigderson generators in Proof Complexity: New lower bounds.
Electron. Colloquium Comput. Complex.
Erfan Khaniki
2022 J jnl
On Proof Complexity of Resolution over Polynomial Calculus.
ACM Trans. Comput. Log.
Erfan Khaniki
2020 J jnl
On Proof complexity of Resolution over Polynomial Calculus.
Electron. Colloquium Comput. Complex.
Erfan Khaniki
2019 J jnl
A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic.
Notre Dame J. Formal Log.
Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari
2019 J jnl
New relations and separations of conjectures about incompleteness in the finite domain.
CoRR
Erfan Khaniki