The Chain Method to Separate Counting Classes.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 93, doi. 10.1007/s002240000080
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 1998 AND VI 31 AND IP 1
Results: 9
1
2
Computing Functions on Asynchronous Anonymous Networks.
- Published in:
- 1998
- By:
- Publication type:
- Erratum
3
Functions Computable with Nonadaptive Queries to NP.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 77, doi. 10.1007/s002240000079
- By:
- Publication type:
- Article
4
Frobenius's Degree Formula and Toda's Polynomials.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 67, doi. 10.1007/s002240000078
- By:
- Publication type:
- Article
5
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 63, doi. 10.1007/s002240000077
- By:
- Publication type:
- Article
6
Potential Function Analysis of Greedy Hot-Potato Routing.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 41, doi. 10.1007/s002240000076
- By:
- Publication type:
- Article
7
Isolating an Odd Number of Elements and Applications in Complexity Theory.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 27, doi. 10.1007/s002240000075
- By:
- Publication type:
- Article
8
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 5, doi. 10.1007/s002240000074
- By:
- Publication type:
- Article
9
A Strange Application of Kolmogorov Complexity.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 1, p. 1, doi. 10.1007/s002240000038
- By:
- Publication type:
- Article