A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 5, p. 495, doi. 10.1007/BF02679459
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 1997 AND VI 30 AND IP 5
Results: 4
1
2
Deciding a Class of Path Formulas for Conflict-Free Petri Nets.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 5, p. 475, doi. 10.1007/s002240000063
- By:
- Publication type:
- Article
3
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 5, p. 447, doi. 10.1007/s002240000062
- By:
- Publication type:
- Article
4
Editorial.
- Published in:
- 1997
- By:
- Publication type:
- Editorial