Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for highness with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-2023 (15)
Publication types (Num. hits)
article(10) inproceedings(5)
Venues (Conferences, Journals, ...)
CoRR(2) Ann. Pure Appl. Log.(1) CiE(1) COCOON(1) Discret. Math. Theor. Comput. ...(1) FCT(1) Inf. Comput.(1) J. Symb. Log.(1) Math. Log. Q.(1) Math. Syst. Theory(1) MFCS(1) SIAM J. Comput.(1) TAMC(1) Theor. Comput. Sci.(1)
Authors
Philippe Moser(5) Frank Stephan 0001(4) Guohua Wu(2) José L. Balcázar(2) Klaus W. Wagner(2) Ronald V. Book(2) Steffen Reith(2) Uwe Schöning(2) Andrew Klapper(1) Angsheng Li(1) Chengling Fang(1) Dan Turetsky(1) Johanna N. Y. Franklin(1) Richard A. Shore(1) Rodney G. Downey(1) Shenling Wang 0001(1) More (+10 of total 18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords
Results
Found 15 publication records. Showing 15 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
276Steffen Reith, Klaus W. Wagner On Boolean Lowness and Boolean Highness. Search on Bibsonomy COCOON The full citation details ... 1998 DBLP  DOI  BibTeX  RDF lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse
32Wesley Calvert, Johanna N. Y. Franklin, Dan Turetsky Structural Highness Notions. Search on Bibsonomy J. Symb. Log. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
32Philippe Moser Polylog depth, highness and lowness for E. Search on Bibsonomy Inf. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
32Philippe Moser, Frank Stephan 0001 Depth, Highness and DNR degrees. Search on Bibsonomy Discret. Math. Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
32Philippe Moser Polynomial Depth, Highness and Lowness for E. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
32Philippe Moser, Frank Stephan 0001 Depth, Highness and DNR degrees. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
32Philippe Moser, Frank Stephan 0001 Depth, Highness and DNR Degrees. Search on Bibsonomy FCT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
32Frank Stephan 0001, Guohua Wu Highness, locally noncappability and nonboundings. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
32Chengling Fang, Shenling Wang 0001, Guohua Wu Highness and Local Noncappability. Search on Bibsonomy CiE The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
32Steffen Reith, Klaus W. Wagner On boolean lowness and boolean highness. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
32Steffen Lempp, Rodney G. Downey, Richard A. Shore Highness and Bounding Minimal Pairs. Search on Bibsonomy Math. Log. Q. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
32Andrew Klapper Generalized Lowness and Highness and Probabilistic Complexity Classes. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
32José L. Balcázar, Ronald V. Book, Uwe Schöning Sparse Sets, Lowness and Highness. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
32José L. Balcázar, Ronald V. Book, Uwe Schöning Sparse Oracles, Lowness, and Highness. Search on Bibsonomy MFCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
30Angsheng Li Elementary Differences Among Jump Hierarchies. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #15 of 15 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license