Erfan Khaniki

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 10

Top Topics

Polynomially Bounded

Constraint Solver

Automatic Theorem Proving

Top Venues

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Log.

Publications

Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
From Proof Complexity to Circuit Complexity via Interactive Protocols. CoRR (2024)
Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
From Proof Complexity to Circuit Complexity via Interactive Protocols. ICALP (2024)
Pavel Hubácek, Erfan Khaniki, Neil Thapen
TFNP Intersections Through the Lens of Feasible Disjunction. ITCS (2024)
Erfan Khaniki
New Relations and Separations of conjectures about Incompleteness in the finite Domain. J. Symb. Log. 87 (3) (2022)
Erfan Khaniki
Nisan-Wigderson generators in Proof Complexity: New lower bounds. Electron. Colloquium Comput. Complex. 29 (2022)
Erfan Khaniki
On Proof Complexity of Resolution over Polynomial Calculus. ACM Trans. Comput. Log. 23 (3) (2022)
Erfan Khaniki
Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds. CCC (2022)
Erfan Khaniki
On Proof complexity of Resolution over Polynomial Calculus. Electron. Colloquium Comput. Complex. 27 (2020)
Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari
A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic. Notre Dame J. Formal Log. 60 (3) (2019)
Erfan Khaniki
New relations and separations of conjectures about incompleteness in the finite domain. CoRR (2019)