Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.
- Published in:
- Theory of Computing Systems, 1999, v. 32, n. 4, p. 487, doi. 10.1007/s002240000128
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 1999 AND VI 32 AND IP 4
Results: 5
1
2
Integer Linear Programming and the Analysis of Some Petri Net Problems.
- Published in:
- Theory of Computing Systems, 1999, v. 32, n. 4, p. 467, doi. 10.1007/s002240000127
- By:
- Publication type:
- Article
3
Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates.
- Published in:
- Theory of Computing Systems, 1999, v. 32, n. 4, p. 453, doi. 10.1007/s002240000126
- By:
- Publication type:
- Article
4
Zero-Dimensional Dynamical Systems, Formal Languages, and Universality.
- Published in:
- Theory of Computing Systems, 1999, v. 32, n. 4, p. 423, doi. 10.1007/s002240000124
- By:
- Publication type:
- Article
5
Bounding the Expected Length of Longest Common Sequences and Forests.
- Published in:
- Theory of Computing Systems, 1999, v. 32, n. 4, p. 435, doi. 10.1007/s002240000125
- By:
- Publication type:
- Article