The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 03D20 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1998-2009 (10)
Publication types (Num. hits)
article(8) inproceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 22 occurrences of 13 keywords

Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
25Willem L. Fouché Fractals Generated by Algorithmically Random Brownian Motion. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D20, 68Q30, 60J65, 60G05, 60G17
25Willem L. Fouché Subrecursive Complexity of Identifying the Ramsey Structure of Posets. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D20, 68Q17, 06A07, 05D10
25Majid Alizadeh, Mohammad Ardeshir Amalgamation property for the class of basic algebras and some of its natural subclasses. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification Primary 03G25, Primary 03D20, Secondary 03B20
25Lars Kristiansen Neat function algebraic characterizations of logspace and linspace. Search on Bibsonomy Comput. Complex. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF 03D10, Subject classification. 68Q15, 68Q05, 03D20
25Satoru Kuroda Recursion Schemata for Slowly Growing Depth Circuit Classes. Search on Bibsonomy Comput. Complex. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Subject classification. 03D20, 94C99, 68Q15
25Lars Kristiansen Subrecursive degrees and fragments of Peano Arithmetic. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 03D20, 03D80, 03F30, 03D30
25Karl-Heinz Niggl The m\mu-measure as a tool for classifying computational complexity. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 03D15, 68Q15, 68Q42, 03D20
25Karl-Heinz Niggl Subrecursive functions on partial sequences. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991): 03D15, 03D45, 03D65, 03D99, 68Q99, 68Q25, 68Q10, 68Q55, 68Q45, 03D20
25Lev D. Beklemishev A proof-theoretic analysis of collection. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991): Primary: 03F30, Secondary: 03F05, 03D20
25Karl-Heinz Niggl A restricted computation model on Scott domains and its partial primitive recursive functionals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991):03D15, 03D65, 03D99, 68Q99, 68Q15, 68Q10, 68Q55, 68Q05, 03D20
Displaying result #1 - #10 of 10 (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