A Reference Correction of "Effective Jordan Decomposition".
- Published in:
- 2006
- By:
- Publication type:
- Correction Notice
Works matching IS 14324350 AND DT 2006 AND VI 39 AND IP 2
Results: 6
1
2
Reachability Problems on Regular Ground Tree Rewriting Graphs.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 2, p. 347, doi. 10.1007/s00224-004-1170-6
- By:
- Publication type:
- Article
3
Optimal Implicit Dictionaries over Unbounded Universes.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 2, p. 321, doi. 10.1007/s00224-005-1167-9
- By:
- Publication type:
- Article
4
The Expressive Power of Bijections over Weakly Arithmetized Structures.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 2, p. 297, doi. 10.1007/s00224-005-1165-y
- By:
- Publication type:
- Article
5
Algebraic Characterization of Reversible Logic Gates.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 2, p. 311, doi. 10.1007/s00224-004-1166-2
- By:
- Publication type:
- Article
6
Why Computational Complexity Requires Stricter Martingales.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 2, p. 277, doi. 10.1007/s00224-005-1135-4
- By:
- Publication type:
- Article