On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 6, p. 679, doi. 10.1007/s002240000109
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 1998 AND VI 31 AND IP 6
Results: 3
1
2
Expansivity, Permutivity, and Chaos for Cellular Automata.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 6, p. 663, doi. 10.1007/s002240000108
- By:
- Publication type:
- Article
3
Edge-Packing in Planar Graphs.
- Published in:
- Theory of Computing Systems, 1998, v. 31, n. 6, p. 629, doi. 10.1007/s002240000107
- By:
- Publication type:
- Article