Navid Talebanfard

Available identifiers

Publication	Date of Publication	Type
Linear branching programs and directional affine extractors	2024-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q6126311	2024-04-09	Paper
Cops-robber games and the resolution of Tseitin formulas	2022-12-05	Paper
Super strong ETH is true for PPSZ with small resolution width	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5028438	2022-02-09	Paper
Tighter hard instances for PPSZ	2020-05-27	Paper
Exponential lower bounds for the PPSZ \(k\)-SAT algorithm	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	2018-05-25	Paper
Strong ETH and resolution via games and the multiplicity of strategies	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	2016-01-21	Paper
Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis	2015-12-01	Paper
Circuit complexity of properties of graphs with constant planar cutwidth	2014-10-14	Paper

This page was built for person: Navid Talebanfard