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 70 matches
- 2024
- Nai-Hui Chia, Min-Hsiu Hsieh, Shih-Han Hung, En-Jui Kuo:
Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy. CoRR abs/2405.07137 (2024) - 2023
- Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. SODA 2023: 3573-3586 - 2022
- Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. CoRR abs/2207.05423 (2022) - 2019
- Nerio Borges, Edwin Pin:
Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy. Log. J. IGPL 27(6): 895-909 (2019) - 2018
- Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy. Inf. Comput. 262: 241-264 (2018) - Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. CoRR abs/1806.04080 (2018) - 2017
- Edwin Pin, Nerio Borges:
A syntactic tool for proving hardness in the Second Level of the Polynomial-Time Hierarchy. CoRR abs/1707.09327 (2017) - 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) - 2013
- Reinhard Kahle, Isabel Oitavem:
Applicative theories for the polynomial hierarchy of time and its levels. Ann. Pure Appl. Log. 164(6): 663-675 (2013) - Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen:
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. ISAAC 2013: 457-467 - 2012
- Alejandro L. Grosso, José M. Turull Torres:
SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy. Conceptual Modelling and Its Theoretical Foundations 2012: 116-135 - 2011
- Patrick Baillot:
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. APLAS 2011: 337-352 - 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
- Orestes Bueno, Prabhu Manyem:
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy. Fundam. Informaticae 84(1): 111-133 (2008) - Flavio Antonio Ferrarotti, Jose Maria Turull Torres:
The Relational Polynomial-Time Hierarchy and Second-Order Logic. SDKB 2008: 48-76 - 2007
- Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. 3(1): 45-60 (2007) - 2006
- Richard Gault, Iain A. Stewart:
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. Theory Comput. Syst. 39(5): 753-783 (2006) - Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. SIAM J. Comput. 36(3): 563-594 (2006) - Dan Gutfreund:
Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy. APPROX-RANDOM 2006: 386-397 - Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory 2006: 408-419 - Christopher Umans:
Optimization Problems in the Polynomial-Time Hierarchy. TAMC 2006: 345-355 - Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Complexity of Boolean Functions 2006 - Prabhu Manyem:
Polynomial-Time Maximisation Classes: Syntactic Hierarchy. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. ICALP 2005: 982-993 - 2004
- Jin-yi Cai, Osamu Watanabe:
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy. SIAM J. Comput. 33(4): 984-1009 (2004) - Lance Fortnow, Rahul Santhanam:
Hierarchy Theorems for Probabilistic Polynomial Time. FOCS 2004: 316-324 - 2003
- Jin-yi Cai, Osamu Watanabe:
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results. COCOON 2003: 202-211 - 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)
skipping 40 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-09-22 08:39 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