|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 8 keywords
|
|
|
|
|
Results
Found 4 publication records. Showing 4 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 62 | Martin Hofmann 0001 |
The Strength of Non-size-increasing Computation (Introduction and Summary).  |
MFCS  |
2001 |
DBLP DOI BibTeX RDF |
semantics AMS Classification: 03D15, 03C13, computational complexity, 68Q15, higher-order functions, finite model, 68Q55 |
| 29 | Joel Ratsaby |
On the complexity of binary samples. |
Ann. Math. Artif. Intell. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 06E30, 03C13, 68Q25, 68R05, 68Q32 |
| 29 | Flavio Antonio Ferrarotti, Jose Maria Turull Torres |
Arity and alternation: a proper hierarchy in higher order logics. |
Ann. Math. Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 03C13, 68Q19, 03C85 |
| 29 | Martin Grohe |
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. |
Comb. |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 03C13, 05C60, 68Q15 |
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license