default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNavid Talebanfard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j7]Pavel Hrubes, Navid Talebanfard
:
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube. Discret. Comput. Geom. 70(1): 268-278 (2023)- 2021
- [j6]Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Log. Methods Comput. Sci. 17(4) (2021) - 2020
- [j5]Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber Games and the Resolution of Tseitin Formulas. ACM Trans. Comput. Theory 12(2): 9:1-9:22 (2020) - 2018
- [j4]Alexander V. Smal, Navid Talebanfard:
Prediction from partial information and hindsight, an alternative proof. Inf. Process. Lett. 136: 102-104 (2018) - 2017
- [j3]Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. Algorithmica 79(1): 29-41 (2017) - 2016
- [j2]Navid Talebanfard:
On the structure and the number of prime implicants of 2-s. Discret. Appl. Math. 200: 1-4 (2016) - [j1]Ilario Bonacina, Navid Talebanfard:
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116(2): 120-124 (2016)
Conference and Workshop Papers
- 2024
- [c9]Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard:
Local Enumeration and Majority Lower Bounds. CCC 2024: 17:1-17:25 - 2022
- [c8]Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard:
Linear Branching Programs and Directional Affine Extractors. CCC 2022: 4:1-4:16 - [c7]Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard:
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. ITCS 2022: 72:1-72:19 - 2020
- [c6]Dominik Scheder, Navid Talebanfard:
Super Strong ETH Is True for PPSZ with Small Resolution Width. CCC 2020: 3:1-3:12 - 2018
- [c5]Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber Games and the Resolution of Tseitin Formulas. SAT 2018: 311-326 - 2017
- [c4]Pavel Pudlák, Dominik Scheder, Navid Talebanfard:
Tighter Hard Instances for PPSZ. ICALP 2017: 85:1-85:13 - 2015
- [c3]Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. IPEC 2015: 248-257 - 2014
- [c2]Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) 2014: 336-347 - 2013
- [c1]Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard:
Exponential Lower Bounds for the PPSZ k-SAT Algorithm. SODA 2013: 1253-1263
Informal and Other Publications
- 2024
- [i12]Svyatoslav Gryaznov, Navid Talebanfard:
Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions. CoRR abs/2403.02275 (2024) - [i11]Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard:
Local Enumeration and Majority Lower Bounds. CoRR abs/2403.09134 (2024) - 2022
- [i10]Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard:
Linear Branching Programs and Directional Affine Extractors. CoRR abs/2201.10997 (2022) - 2021
- [i9]Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. CoRR abs/2105.06744 (2021) - [i8]Pavel Hrubes, Navid Talebanfard:
On the extension complexity of polytopes separating subsets of the Boolean cube. CoRR abs/2105.11996 (2021) - [i7]Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard:
A Variant of the VC-dimension with Applications to Depth-3 Circuits. CoRR abs/2111.09671 (2021) - 2020
- [i6]Dominik Scheder, Navid Talebanfard:
Super Strong ETH is true for strong PPSZ. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i5]Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i4]Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber games and the resolution of Tseitin formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i3]Alexander Smal, Navid Talebanfard:
Prediction from Partial Information and Hindsight, an Alternative Proof. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i2]Pavel Pudlák, Dominik Scheder, Navid Talebanfard:
Tighter Hard Instances for PPSZ. CoRR abs/1611.01291 (2016) - 2014
- [i1]Navid Talebanfard:
On the Structure and the Number of Prime Implicants of k-CNF Formulas. CoRR abs/1408.2662 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
