Browse wiki
From Semantic Portal Wiki
| Computationally related problems |
| Address | Philadelphia, PA, USA + |
|---|---|
| Author | Sartaj Kumar Sahni + |
| Bibtype | article + |
| Journal | SIAM + |
| Key | 906944 + |
| Modification dateThis property is a special property in this wiki. | 9 September 2009 20:27:25 + |
| Note | This paper talks about the complexity of finding optimal solution to AND/OR graphs. + |
| Paper url | http://www.cise.ufl.edu/%7Esahni/papers/comp.pdf + |
| Publisher | SIAM + |
| Relation | AND/OR graph + |
| Tag | Computer science + |
| Title | Computationally Related Problems. + |
| Year | 1974 + |
| Categories | Journal Paper, Publication |
| hide properties that link here |
| No properties link to this page. |
