Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 53 matches
- 2024
- Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka:
Lower Bounds for Set-Multilinear Branching Programs. CCC 2024: 20:1-20:20 - C. S. Bhargav, Prateek Dwivedi, Nitin Saxena:
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. TAMC 2024: 355-366 - 2023
- Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka:
Lower Bounds for Set-Multilinear Branching Programs. CoRR abs/2312.15874 (2023) - 2022
- Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31(2): 8 (2022) - 2021
- Fidel Ernesto Diaz Andino, Maria Kokkou, Mateus de Oliveira Oliveira, Farhad Vadiee:
Unitary Branching Programs: Learnability and Lower Bounds. ICML 2021: 297-306 - Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. STACS 2021: 23:1-23:19 - 2020
- Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Electron. Colloquium Comput. Complex. TR20 (2020) - (Withdrawn) Lower Bounds of Algebraic Branching Programs and Layerization. CoRR abs/2007.06819 (2020)
- 2019
- Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. ACM Trans. Comput. Theory 11(2): 8:1-8:22 (2019) - 2018
- Venkatesh Medabalimi:
Branching Program Lower Bounds. University of Toronto, Canada, 2018 - Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10(1): 3:1-3:30 (2018) - 2017
- Igor Razgon:
Partial matching width and its application to lower bounds for branching programs. CoRR abs/1709.08890 (2017) - 2016
- Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. CCC 2016: 30:1-30:25 - Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. FSTTCS 2016: 37:1-37:14 - Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi:
Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. ICALP 2016: 36:1-36:13 - Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. CoRR abs/1604.07200 (2016) - Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy, and Branching Program Size Lower Bounds. ACM Trans. Comput. Theory 7(2): 8:1-8:21 (2015) - Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs. CoRR abs/1511.07136 (2015) - Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. STACS 2013: 622-633 - Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. CoRR abs/1301.1425 (2013) - Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. Electron. Colloquium Comput. Complex. TR13 (2013) - 2008
- Maurice J. Jansen:
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. MFCS 2008: 407-418 - 2006
- Matthias Homeister:
Lower bounds for restricted read-once parity branching programs. Theor. Comput. Sci. 359(1-3): 1-14 (2006) - 2003
- Matthias Homeister:
On lower bounds for parity branching programs. University of Göttingen, 2003 - Henrik Brosenne, Matthias Homeister, Stephan Waack:
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299 - Matthias Homeister:
Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2000
- Detlef Sieling:
Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms. ICALP Satellite Workshops 2000: 259-262 - Rustam Mubarakzjanov:
Lower Bounds for Randomized Branching Programs with a Big OBDD Part. Universität Trier, Mathematik/Informatik, Forschungsbericht 00-13 (2000)
skipping 23 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-08-24 19:34 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint