Reductions to sets of low information content

Authors:
V. Arvind;Y. Han;L. Hemachandra;J. Köbler;A. Lozano;M. Mundhenk;M. Ogiwara;U. Schöning;R. Silvestri;T. Thierauf
Affiliations:
-;-;-;-;-;-;-;-;-;-
Venue:
Complexity theory
Year:
1993

Citing 0
Cited 13

Complexity theory column 5: the not-ready-for-prime-time conjectures

ACM SIGACT News
On reductions of NP sets to sparse sets

Journal of Computer and System Sciences
Semi-membership algorithms: some recent advances

ACM SIGACT News
A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions

ACM SIGACT News
There Are No Sparse NPW-Hard Sets

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Competing Provers Yield Improved Karp-Lipton Collapse Results

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Average-case intractability vs. worst-case intractability

Information and Computation
On the reducibility of sets inside NP to sets with low information content

Journal of Computer and System Sciences
Competing provers yield improved Karp-Lipton collapse results

Information and Computation
Introduction

ACM SIGACT News
Competing provers yield improved Karp-Lipton collapse results

Information and Computation
Online learning and resource-bounded dimension: winnow yields new lower bounds for hard sets

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Dimension, halfspaces, and the density of hard sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract