![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 1 | Keiko Nakamura, Kiyohiko Nakamura, Atsunobu Ichikawa: A Class of Petri Nets and a Reachability Problem Solvable in Deterministic Polynomial Time. PNPM 1989: 258-265 |
Selection of 1 from 7 records - Kiyohiko Nakamura has 7 coauthors
Copyright © 2009-12-07 by Michael Ley (ley@uni-trier.de)