Now showing items 1-4 of 4

• #### Computing functions with parallel queries to NP ﻿

(1993-03)
External research report
Open Access
The class "Theta_2^p" of languages polynomial time truth-table reducible to sets in NP has a wide range of different characterizations. We survey some of them studying the classes obtained when the characterizations are ...
• #### Concatenation versus addition in knapsack problems ﻿

(1993-01)
External research report
Open Access
"Appeared in Information Processing Letters 54 (1995),169-174. We consider the complexity of two knapsack problems that are defined with the operation concatenation'' instead of addition''. Whereas both addition ...
• #### Functional oracle queries as a measure of parallel time ﻿

(1990-08)
External research report
Open Access
We discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still ...
• #### Logarithmic space counting classes ﻿

(1990-01)
External research report
Open Access
We consider the logarithmic space counting classes #L, opt-L, and span-L, which are defined analogously to their polynomial time counterparts. We obtain complete functions for these three classes in terms of graphs and ...