Navid Talebanfard

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 24

Top Topics

Mind Change Complexity

Partial Information

Top Venues

Electron. Colloquium Comput. Complex.

Inf. Process. Lett.

Publications

Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard
Local Enumeration and Majority Lower Bounds. CoRR (2024)
Svyatoslav Gryaznov, Navid Talebanfard
Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions. CoRR (2024)
Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard
Local Enumeration and Majority Lower Bounds. CCC (2024)
Pavel Hrubes, Navid Talebanfard
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube. Discret. Comput. Geom. 70 (1) (2023)
Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. ITCS (2022)
Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard
Linear Branching Programs and Directional Affine Extractors. CoRR (2022)
Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard
Linear Branching Programs and Directional Affine Extractors. CCC (2022)
Michal Koucký, Vojtech Rödl, Navid Talebanfard
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. CoRR (2021)
Pavel Hrubes, Navid Talebanfard
On the extension complexity of polytopes separating subsets of the Boolean cube. CoRR (2021)
Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard
A Variant of the VC-dimension with Applications to Depth-3 Circuits. CoRR (2021)
Michal Koucký, Vojtech Rödl, Navid Talebanfard
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Log. Methods Comput. Sci. 17 (4) (2021)
Dominik Scheder, Navid Talebanfard
Super Strong ETH is true for strong PPSZ. Electron. Colloquium Comput. Complex. 27 (2020)
Dominik Scheder, Navid Talebanfard
Super Strong ETH Is True for PPSZ with Small Resolution Width. Computational Complexity Conference (2020)
Nicola Galesi, Navid Talebanfard, Jacobo Torán
Cops-Robber Games and the Resolution of Tseitin Formulas. ACM Trans. Comput. Theory 12 (2) (2020)
Michal Koucký, Vojtech Rödl, Navid Talebanfard
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Electron. Colloquium Comput. Complex. 26 (2019)
Alexander V. Smal, Navid Talebanfard
Prediction from partial information and hindsight, an alternative proof. Inf. Process. Lett. 136 (2018)
Nicola Galesi, Navid Talebanfard, Jacobo Torán
Cops-Robber Games and the Resolution of Tseitin Formulas. SAT (2018)
Nicola Galesi, Navid Talebanfard, Jacobo Torán
Cops-Robber games and the resolution of Tseitin formulas. Electron. Colloquium Comput. Complex. 25 (2018)
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
Tighter Hard Instances for PPSZ. ICALP (2017)
Alexander Smal, Navid Talebanfard
Prediction from Partial Information and Hindsight, an Alternative Proof. Electron. Colloquium Comput. Complex. 24 (2017)
Ilario Bonacina, Navid Talebanfard
Strong ETH and Resolution via Games and the Multiplicity of Strategies. Algorithmica 79 (1) (2017)
Ilario Bonacina, Navid Talebanfard
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116 (2) (2016)
Navid Talebanfard
On the structure and the number of prime implicants of 2-s. Discret. Appl. Math. 200 (2016)
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
Tighter Hard Instances for PPSZ. CoRR (2016)
Ilario Bonacina, Navid Talebanfard
Strong ETH and Resolution via Games and the Multiplicity of Strategies. IPEC (2015)
Navid Talebanfard
On the Structure and the Number of Prime Implicants of k-CNF Formulas. CoRR (2014)
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) (2014)
Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard
-SAT Algorithm. SODA (2013)