Erfan Khaniki

According to our database, Erfan Khaniki authored at least 7 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

TFNP Intersections Through the Lens of Feasible Disjunction.

Pavel Hubácek, Erfan Khaniki, Neil Thapen

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

From Proof Complexity to Circuit Complexity via Interactive Protocols.

Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Jump Operators, Interactive Proofs and Proof Complexity Generators.

Erfan Khaniki

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2022

New Relations and Separations of conjectures about Incompleteness in the finite Domain.

Erfan Khaniki

J. Symb. Log., 2022

Nisan-Wigderson generators in Proof Complexity: New lower bounds.

Erfan Khaniki

Electron. Colloquium Comput. Complex., 2022

2020

On Proof complexity of Resolution over Polynomial Calculus.

Erfan Khaniki

Electron. Colloquium Comput. Complex., 2020

2019

A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic.

Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari

Notre Dame J. Formal Log., 2019