Navid Talebanfard

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Linear branching programs and directional affine extractors	2024-07-05	Paper
scientific article; zbMATH DE number 7829304 (Why is no real title available?) (available as arXiv preprint)	2024-04-09	Paper
Cops-robber games and the resolution of Tseitin formulas ACM Transactions on Computation Theory	2022-12-05	Paper
Super strong ETH is true for PPSZ with small resolution width	2022-07-21	Paper
scientific article; zbMATH DE number 7471677 (Why is no real title available?) (available as arXiv preprint)	2022-02-09	Paper
scientific article; zbMATH DE number 7471677 (Why is no real title available?)	2022-02-09	Paper
Tighter hard instances for PPSZ (available as arXiv preprint)	2020-05-27	Paper
Exponential lower bounds for the PPSZ \(k\)-SAT algorithm Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-05-15	Paper
Cops-robber games and the resolution of Tseitin formulas	2018-08-10	Paper
Prediction from partial information and hindsight, an alternative proof Information Processing Letters	2018-05-25	Paper
Strong ETH and resolution via games and the multiplicity of strategies Algorithmica	2017-10-10	Paper
Strong ETH and resolution via games and the multiplicity of strategies	2017-09-29	Paper
On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s Discrete Applied Mathematics	2016-01-21	Paper
Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis Information Processing Letters	2015-12-01	Paper
Circuit complexity of properties of graphs with constant planar cutwidth Mathematical Foundations of Computer Science 2014	2014-10-14	Paper

Research outcomes over time

This page was built for person: Navid Talebanfard