Author:
Shukla Sandeep K.,Hunt Harry B.,Rosenkrantz Daniel J.,Stearns Richard E.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. W.F. Dowling and J.H. Gallier. Linear time algorithm for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 3:267–284, 1984.
2. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, SanFrancisco, 1979.
3. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-completeness Theory. Oxford University Press, 1995.
4. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1984.
5. Dung T. Huynh and Lu Tian. On deciding some equivalences for concurrent processes. Theoretical Informatics and Applications, 28(1):51–71, 1994.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献