On the Complexity of Non-preemptive Shop Scheduling with Two Jobs.
- Published in:
- Computing, 2002, v. 69, n. 1, p. 37, doi. 10.1007/s00607-002-1455-z
- By:
- Publication type:
- Article
Works matching IS 0010485X AND DT 2002 AND VI 69 AND IP 1
Results: 4
1
2
A Note on the Performance of the “Ahrens Algorithm”.
- Published in:
- Computing, 2002, v. 69, n. 1, p. 83, doi. 10.1007/s00607-002-1456-y
- By:
- Publication type:
- Article
3
Data-sparse Approximation by Adaptive ℋ[sup 2] -Matrices.
- Published in:
- Computing, 2002, v. 69, n. 1, p. 1, doi. 10.1007/s00607-002-1450-4
- By:
- Publication type:
- Article
4
Horner's Rule for Interval Evaluation Revisited.
- Published in:
- Computing, 2002, v. 69, n. 1, p. 51, doi. 10.1007/s00607-002-1448-y
- By:
- Publication type:
- Article