A note on relativizing complexity classes with tally
Hemachandra, L.A., Rubinstein, R.S.
Published in Proceedings Fifth Annual Structure in Complexity Theory Conference (1990)
Published in Proceedings Fifth Annual Structure in Complexity Theory Conference (1990)
Get full text
Conference Proceeding
On sets with efficient implicit membership tests
Hemachandra, L.A., Hoene, A.
Published in Proceedings Fifth Annual Structure in Complexity Theory Conference (1990)
Published in Proceedings Fifth Annual Structure in Complexity Theory Conference (1990)
Get full text
Conference Proceeding
A complexity theory for feasible closure properties
Ogiwara, M., Hemachandra, L.A.
Published in [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991)
Published in [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991)
Get full text
Conference Proceeding
How hard are sparse sets?
Hemachandra, L.A., Ogiwara, M., Watanabe, O.
Published in [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference (1992)
Published in [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference (1992)
Get full text
Conference Proceeding
Enumerative counting is hard
Cai, J.-Y., Hemachandra, L.A.
Published in [1988] Proceedings. Structure in Complexity Theory Third Annual Conference (1988)
Published in [1988] Proceedings. Structure in Complexity Theory Third Annual Conference (1988)
Get full text
Conference Proceeding
Relating equivalence and reducibility to sparse sets
Allender, E., Hemachandra, L.A., Ogiwara, M., Watanabe, O.
Published in [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991)
Published in [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991)
Get full text
Conference Proceeding