Navid Talebanfard

Orcid: 0000-0002-3524-9282

According to our database1, Navid Talebanfard authored at least 17 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions.
CoRR, 2024

Local Enumeration and Majority Lower Bounds.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube.
Discret. Comput. Geom., July, 2023

2022
A Variant of the VC-Dimension with Applications to Depth-3 Circuits.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Linear Branching Programs and Directional Affine Extractors.
Proceedings of the 37th Computational Complexity Conference, 2022

2020
Super Strong ETH is true for strong PPSZ.
Electron. Colloquium Comput. Complex., 2020

Super Strong ETH Is True for PPSZ with Small Resolution Width.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
Electron. Colloquium Comput. Complex., 2019

2018
Prediction from partial information and hindsight, an alternative proof.
Inf. Process. Lett., 2018

Cops-Robber games and the resolution of Tseitin formulas.
Electron. Colloquium Comput. Complex., 2018

2017
Strong ETH and Resolution via Games and the Multiplicity of Strategies.
Algorithmica, 2017

Tighter Hard Instances for PPSZ.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis.
Inf. Process. Lett., 2016

On the structure and the number of prime implicants of 2-s.
Discret. Appl. Math., 2016

2014
On the Structure and the Number of Prime Implicants of k-CNF Formulas.
CoRR, 2014

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Exponential Lower Bounds for the PPSZ <i>k</i>-SAT Algorithm.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013


  Loading...