Computationally related problems

From Semantic Portal Wiki

Jump to: navigation, search

{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}

Edit

Reference: {{#vardefine:pagename|computationally related problems }}

  1. [[]]

bibtex 

{{#vardefine:pagename|Computationally related problems }}{{#vardefine:key| }}

abstract:


download:


Retrieved from "http://tw.rpi.edu/portal/Computationally_related_problems"
Facts about Computationally related problemsRDF feed
AddressPhiladelphia, PA, USA  +
AuthorSartaj Kumar Sahni  +
Bibtypearticle  +
JournalSIAM  +
Key906944  +
NoteThis paper talks about the complexity of finding optimal solution to AND/OR graphs.  +
Paper urlhttp://www.cise.ufl.edu/~sahni/papers/comp.pdf  +
PublisherSIAM  +
RelationAND/OR graph  +
TagComputer science  +
TitleComputationally Related Problems.  +
Year1974  +
Personal tools
Semantic Web Community
Tetherless World constellation
maintenance