Improved Bounds for Functions Related to Busy Beavers.
- Published in:
- Theory of Computing Systems, 2002, v. 35, n. 1, p. 1, doi. 10.1007/s00224-001-1052-0
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2002 AND VI 35 AND IP 1
Results: 5
1
2
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones.
- Published in:
- Theory of Computing Systems, 2002, v. 35, n. 1, p. 81
- By:
- Publication type:
- Article
3
Hamiltonicity of the Hierarchical Cubic Network.
- Published in:
- Theory of Computing Systems, 2002, v. 35, n. 1, p. 59, doi. 10.1007/s00224-001-1021-7
- By:
- Publication type:
- Article
4
Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes.
- Published in:
- Theory of Computing Systems, 2002, v. 35, n. 1, p. 39
- By:
- Publication type:
- Article
5
On the Representation of Real Numbers Using Regular Languages.
- Published in:
- Theory of Computing Systems, 2002, v. 35, n. 1, p. 13, doi. 10.1007/s00224-001-1007-5
- By:
- Publication type:
- Article