|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
|
|
Results
Found 4 publication records. Showing 4 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Douglas Cenzer, Zia Uddin |
Logspace Complexity of Functions and Structures.  |
CiE  |
2006 |
DBLP DOI BibTeX RDF |
Complexity, Computability, Computable Model Theory |
| 1 | Jin-yi Cai, Hong Zhu |
Progress in Computational Complexity Theory. |
J. Comput. Sci. Technol. |
2005 |
DBLP DOI BibTeX RDF |
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms |
| 1 | Birgit Jenner |
Closure under Complementation of Logspace Complexity Classes - A Survey. |
Foundations of Computer Science: Potential - Theory - Cognition |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | José L. Balcázar, Josep Díaz, Joaquim Gabarró |
Some results about Logspace complexity measures. |
Bulletin of the EATCS |
1984 |
DBLP BibTeX RDF |
|
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")