Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
One query reducibilities between partial information classes
Theoretical Computer Science - Mathematical foundations of computer science 2004
Combining self-reducibility and partial information algorithms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
ON A QUANTITATIVE NOTION OF UNIFORMITY
Fundamenta Informaticae
| Hi-index | 0.00 |