Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
sparse sets
Description:
Sets of strings whose number of members up to a given length is bounded by a polynomial, studied in computational complexity theory.
Primary topic:
Complexity and Algorithms in Graphs (38%)
Related topics:
Complexity and Algorithms in Graphs (38%),
Computability, Logic, AI Algorithms (18%),
Analytic Number Theory Research (9%),
Limits and Structures in Graph Theory (7%)
OpenAlex ID:
keywords/sparse-sets
Pyomo — Optimization Modeling in Python
2021
·
Michael L. Bynum
, Gabriel A. Hackebeil
, et al.
·
Springer optimization and its applications
·
1,144
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
1981
·
Charles H. Bennett
, John Gill
·
SIAM Journal on Computing
·
454
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
1982
·
Stephen R. Mahaney
·
Journal of Computer and System Sciences
·
323
PDF
Some consequences of non-uniform conditions on uniform classes
1983
·
Chee K. Yap
·
Theoretical Computer Science
·
280
PDF
Set reconciliation with nearly optimal communication complexity
2003
·
Y. Minsky
, A. Trachtenberg
, et al.
·
IEEE Transactions on Information Theory
·
229
Circuit-size lower bounds and non-reducibility to sparse sets
1982
·
R. Kannan
·
Information and Control
·
185
PDF
Complexity and Structure
1986
·
Lecture notes in computer science
·
165
Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
1991
·
Mitsunori Ogiwara
, Osamu Watanabe
·
SIAM Journal on Computing
·
156
Sparse sets in NP-P: EXPTIME versus NEXPTIME
1985
·
J. Hartmanis
, N. Immerman
, et al.
·
Information and Control
·
132
The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
1988
·
Jim Kadin
·
SIAM Journal on Computing
·
130
P-Printable Sets
1988
·
Eric W. Allender
, Roy S. Rubinstein
·
SIAM Journal on Computing
·
127
The Boolean Hierarchy II: Applications
1989
·
Jin-Yi Cai
, Thomas Gundermann
, et al.
·
SIAM Journal on Computing
·
114
An efficient representation for sparse sets
1993
·
Preston Briggs
, Linda Torczon
·
ACM Letters on Programming Languages and Systems
·
109
PNP[(log )] and sparse turing-complete sets for NP
1989
·
Jim Kadin
·
Journal of Computer and System Sciences
·
106
PDF
A Note on Sparse Complete Sets
1979
·
Steven Fortune
·
SIAM Journal on Computing
·
98
On Circuit-Size Complexity and the Low Hierarchy in NP
1985
·
Ker-I Ko
, Uwe Schöning
·
SIAM Journal on Computing
·
96
The polynomial-time hierarchy and sparse oracles
1986
·
Jose L. Balcázar
, Ronald V. Book
, et al.
·
Journal of the ACM
·
90
PDF
Computational depth: Concept and applications
2005
·
Luis Antunes
, Lance Fortnow
, et al.
·
Theoretical Computer Science
·
84
PDF
The complexity of sparse sets in P: Preliminary report
1986
·
Eric W. Allender
·
Lecture notes in computer science
·
84
On relativized exponential and probabilistic complexity classes
1986
·
Hans Heller
·
Information and Control
·
83
On sparse sets in NP–P
1983
·
Juris Hartmanis
·
Information Processing Letters
·
80
On Reducibility to Complex or Sparse Sets
1975
·
Nancy Lynch
·
Journal of the ACM
·
76
PDF
Sparse Sets, Lowness and Highness
1986
·
José L. Balcázar
, Ronald V. Book
, et al.
·
SIAM Journal on Computing
·
75
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
1983
·
Yaacov Yesha
·
SIAM Journal on Computing
·
71
Turing machines with few accepting computations and low sets for PP
1992
·
Johannes Kobler
, Uwe Schïng
, et al.
·
Journal of Computer and System Sciences
·
69
Show more works
View as search
Works count:
409
Citation count:
7,424
Year
Topic
Type