ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
4
views
10
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,843
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Structure in Complexity Theory
The complexity of sparse sets in P
other
Author(s):
Eric W. Allender
Publication date
(Online):
June 2 2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Qatar University Press
Most cited references
10
Record
: found
Abstract
: not found
Article
: not found
On uniform circuit complexity
Walter Ruzzo
(1981)
0
comments
Cited
35
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Relative complexity of checking and evaluating
Leslie Valiant
(1976)
0
comments
Cited
23
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Computation times of NP sets of different densities
J. Hartmanis
,
Y. Yesha
(1984)
0
comments
Cited
7
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1986
Publication date (Online):
June 2 2005
Pages
: 1-11
DOI:
10.1007/3-540-16486-3_85
SO-VID:
f6117f93-6352-4483-86ac-b94034ee29fe
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
The complexity of sparse sets in P
pp. 144
Probabilistic game automata
pp. 197
What is a hard instance of a computational problem?
pp. 383
Probabilistic quantifiers, adversaries, and complexity classes : An overview
Similar content
2,843
Clinical evaluation of a SARS-CoV-2 RT-PCR assay on a fully automated system for rapid on-demand testing in the hospital setting.
Authors:
Dominik Nörz
,
Nicole Fischer
,
Alexander Schultze
…
The Cosmology of H. P. Lovecraft
Authors:
M. G. KUTRIEH
Diagnosis and subtype analysis of Blastocystis sp. in 442 patients in a hospital setting in the Netherlands
Authors:
Aldert Bart
,
Ellen Wentink-Bonnema
,
Henk Gilis
…
See all similar
Cited by
4
Counting classes: Thresholds, parity, mods, and fewness
Authors:
Richard Beigel
,
John Gill
,
Ulrich Hertramp
RelativizedNC
Authors:
Christopher B. Wilson
Unambiguity and fewness for logarithmic space
Authors:
Gerhard Buntrock
,
Birgit Jenner
,
Klaus-Jörn Lange
…
See all cited by