Navid Talebanfard
Navid Talebanfard
Institute of Mathematics of the Czech Academy of Sciences
Zweryfikowany adres z math.cas.cz - Strona główna
Cytowane przez
Cytowane przez
Cops-robber games and the resolution of Tseitin formulas
N Galesi, N Talebanfard, J Torán
International Conference on Theory and Applications of Satisfiability …, 2018
Exponential Lower Bounds for the PPSZ k-SAT Algorithm
S Chen, DA Scheder, N Talebanfard, B Tang
ACM-SIAM symposium on Disrete Algorithms, 1253-1263, 2013
Tighter hard instances for PPSZ
P Pudlák, D Scheder, N Talebanfard
arXiv preprint arXiv:1611.01291, 2016
Prediction from partial information and hindsight, an alternative proof
AV Smal, N Talebanfard
Information Processing Letters 136, 102-104, 2018
Strong ETH and Resolution via Games and the Multiplicity of Strategies
I Bonacina, N Talebanfard
Algorithmica 79 (1), 29-41, 2017
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis
I Bonacina, N Talebanfard
Information Processing Letters 116 (2), 120-124, 2016
Super strong ETH is true for PPSZ with small resolution width
D Scheder, N Talebanfard
35th Computational Complexity Conference (CCC 2020), 2020
On the structure and the number of prime implicants of 2-CNFs
N Talebanfard
Discrete Applied Mathematics 200, 1-4, 2016
Circuit complexity of properties of graphs with constant planar cutwidth
KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard
International Symposium on Mathematical Foundations of Computer Science, 336-347, 2014
On the extension complexity of polytopes separating subsets of the Boolean cube
P Hrubeš, N Talebanfard
Discrete & Computational Geometry, 1-11, 2022
A Variant of the VC-dimension with Applications to Depth-3 Circuits
P Frankl, S Gryaznov, N Talebanfard
arXiv preprint arXiv:2111.09671, 2021
Linear Branching Programs and Directional Affine Extractors
S Gryaznov, P Pudlák, N Talebanfard
arXiv preprint arXiv:2201.10997, 2022
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm
N Talebanfard, V Rödl, M Koucký
Logical Methods in Computer Science 17, 2021
Circuit Complexity Bounds using Monoid Structure for Graph Problems
KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–14