Semi-membership algorithms: some recent advances
ACM SIGACT News
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The Density of Weakly Complete Problems under Adaptive Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Reductions between disjoint NP-pairs
Information and Computation
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
ACM SIGACT News
On the asymmetric complexity of the group-intersection problem
Information Processing Letters
The Fault Tolerance of NP-Hard Problems
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
SIGACT news complexity theory column 64
ACM SIGACT News
Reductions between disjoint NP-Pairs
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The fault tolerance of NP-hard problems
Information and Computation
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
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
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Sparse selfreducible sets and polynomial size circuit lower bounds
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Mitosis in computational complexity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |