SIGACT news complexity theory column 48
ACM SIGACT News
Comparing reductions to NP-complete sets
Information and Computation
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Two open problems on effective dimension
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Dimension, halfspaces, and the density of hard sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |