Остановите войну!
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 55 matches
- 2024
- Sabee Grewal, Justin Yirka:
The Entangled Quantum Polynomial Hierarchy Collapses. CoRR abs/2401.01453 (2024) - Sabee Grewal, Justin Yirka:
The Entangled Quantum Polynomial Hierarchy Collapses. Electron. Colloquium Comput. Complex. TR24: TR24-006 (2024) - 2023
- Tong Liang, Jim Davis:
Inducing Neural Collapse to a Fixed Hierarchy-Aware Frame for Reducing Mistake Severity. ICCV 2023: 1443-1452 - Tong Liang, Jim Davis:
Inducing Neural Collapse to a Fixed Hierarchy-Aware Frame for Reducing Mistake Severity. CoRR abs/2303.05689 (2023) - 2022
- Victor L. Selivanov:
Non-collapse of the effective Wadge hierarchy. Comput. 11(3-4): 335-358 (2022) - 2021
- Katherine Arthur, Rod Downey, Noam Greenberg:
Maximality and collapse in the hierarchy of α-c.a. degrees. Comput. 10(3): 181-214 (2021) - Jiyuan Hu, Mahdi Motagh, Jiayao Wang, Fen Qin, Jianchen Zhang, Wenhao Wu, Yakun Han:
Karst Collapse Risk Zonation and Evaluation in Wuhan, China Based on Analytic Hierarchy Process, Logistic Regression, and InSAR Angular Distortion Approaches. Remote. Sens. 13(24): 5063 (2021) - Victor L. Selivanov:
Non-collapse of the Effective Wadge Hierarchy. CiE 2021: 407-416 - Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi:
Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes. COCOA 2021: 348-363 - 2016
- Yasuhiro Takahashi, Seiichiro Tani:
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Comput. Complex. 25(4): 849-881 (2016) - Libor Barto:
The collapse of the bounded width hierarchy. J. Log. Comput. 26(3): 923-943 (2016) - 2014
- Holger Dell, Dieter van Melkebeek:
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. J. ACM 61(4): 23:1-23:27 (2014) - Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity. Theor. Comput. Sci. 560: 292-306 (2014) - 2013
- Yasuhiro Takahashi, Seiichiro Tani:
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. CCC 2013: 168-178 - Liang Ding, Abdul Samad, Xingran Xue, Xiuzhen Huang, Liming Cai:
Polynomial kernels collapse the W-hierarchy. CoRR abs/1308.3613 (2013) - 2012
- Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity. GandALF 2012: 113-126 - 2010
- Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Theory Comput. Syst. 46(1): 143-156 (2010) - Holger Dell, Dieter van Melkebeek:
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. STOC 2010: 251-260 - Dieter van Melkebeek, Holger Dell:
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- Holger Dell, Dieter van Melkebeek:
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Parameterized complexity and approximation algorithms 2009 - 2008
- Javaid Aslam:
The Collapse of the Polynomial Hierarchy: #P = FP. CoRR abs/0812.1385 (2008) - 2007
- Zofia Adamowicz, Leszek Aleksander Kolodziejczyk:
Partial collapses of the Sigma1 complexity hierarchy in models for fragments of bounded arithmetic. Ann. Pure Appl. Log. 145(1): 91-95 (2007) - Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran:
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007) - 2004
- Alan L. Selman, Samik Sengupta:
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. CCC 2004: 82-90 - Doron Bustan, Orna Kupferman, Moshe Y. Vardi:
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy. STACS 2004: 522-533 - Alan L. Selman, Samik Sengupta:
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- Sebastian Maneth:
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. FSTTCS 2003: 326-337 - 2002
- Adam R. Klivans, Dieter van Melkebeek:
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. SIAM J. Comput. 31(5): 1501-1526 (2002) - 2001
- Liming Cai, David W. Juedes:
Subexponential Parameterized Algorithms Collapse the W-Hierarchy. ICALP 2001: 273-284 - André Arnold, Giacomo Lenzi, Jerzy Marcinkowski:
The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. LICS 2001: 157-166
skipping 25 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-04-19 17:27 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