RSN[sub1-tt][supSN] (NP) Distinguishes Robust Many-One and Turing Completeness.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 3, p. 307, doi. 10.1007/s002240000090
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 1998 AND VI 31 AND IP 3
Results: 5
1
2
Embedding Complete Binary Trees into Star and Pancake Graphs.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 3, p. 279, doi. 10.1007/s002240000089
- By:
- Publication type:
- Article
3
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 3, p. 251, doi. 10.1007/s002240000088
- By:
- Publication type:
- Article
4
Expressiveness and Complexity of Generic Graph Machines.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 3, p. 231, doi. 10.1007/s002240000087
- By:
- Publication type:
- Article
5
A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 3, p. 215, doi. 10.1007/s002240000086
- By:
- Publication type:
- Article