Navid Talebanfard

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