[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/Ferreira91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Afonso_Ferreira>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F12.73593>
foaf:homepage <https://doi.org/10.1109/12.73593>
dc:identifier DBLP journals/tc/Ferreira91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F12.73593 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label A Parallel Time/Hardware Tradeoff T . H = O(2^{n/2}) for the Knapsack Problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Afonso_Ferreira>
swrc:number 2 (xsd:string)
swrc:pages 221-225 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/Ferreira91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/Ferreira91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc40.html#Ferreira91>
rdfs:seeAlso <https://doi.org/10.1109/12.73593>
dc:subject SIMD machine; parallel time/hardware tradeoff; knapsack problem; parallel algorithm; shared memory; concurrent reading; concurrent writing; linear time; computational complexity; parallel algorithms. (xsd:string)
dc:title A Parallel Time/Hardware Tradeoff T . H = O(2^{n/2}) for the Knapsack Problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 40 (xsd:string)