#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1989

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Harry Buhrman, Albrecht Hoene, Leen Torenvliet
- STACS
- 1993

We investigate the structure of EXP and NEXP complete and hard sets under various kinds of reductions. In particular, we are interested in the way in which information that makes the set complete is… (More)

- Lane A. Hemaspaandra, Albrecht Hoene, +4 authors Jie Wang
- 1993

A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorithm that given any two strings decides which is ``more likely'''' to be in the set. This paper… (More)

- Hans-Jörg Burtschick, Albrecht Hoene
- MFCS
- 1992

A 1-L function is one that is computable by a logspace Turing machine that moves its input head only in one direction. We show that there exist 1-L complete sets for PSPACE that are not 1-L… (More)

- Albrecht Hoene, Arfst Nickelsen
- STACS
- 1993

We study the query-complexity of counting, selecting, and sorting functions. That is, for a given set A and a positive integer k, we ask, how many queries to an arbitrary oracle does a… (More)

- Lane A. Hemaspaandra, Albrecht Hoene, +4 authors Jie Wang
- Int. J. Found. Comput. Sci.
- 1995

In this note, we study NP-selective sets (formally, sets that are selective via NPSVt functions) as a natural generalization of P-selective sets. We show that, assuming P≠NP∩coNP, the class of… (More)

- Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
- Theor. Comput. Sci.
- 1996

A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorithm that given any two strings decides which is ``more likely'''' to be in the set. This paper… (More)

- Lane A. Hemaspaandra, Albrecht Hoene
- Proceedings Fifth Annual Structure in Complexity…
- 1990

The complexity of implicit membership testing is characterized in terms of the well-known complexity class OptP, optimization polynomial time. It is concluded that many complex sets have… (More)

- Lane A. Hemaspaandra, Albrecht Hoene, Dirk Siefkes, Paul Young
- Theor. Comput. Sci.
- 1991

Abstract Sets whose members are enumerated by some Turing machine are called recursively enumerable. We define a set to be polynomially enumerable by iteration if its members are efficiently… (More)

- William I. Gasarch, Lane A. Hemaspaandra, Albrecht Hoene
- Inf. Comput.
- 1993

Abstract The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion… (More)

- Gerhard Buntrock, Albrecht Hoene
- STACS
- 1989

Auxiliary pushdown automata have been proven to be a useful tool for the characterization of complexity classes. In this paper we consider the pushdown reversal complexity of these machines, and show… (More)