[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jacm/SpielmanT04>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Daniel_A._Spielman>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Shang-Hua_Teng>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F990308.990310>
foaf:homepage <https://doi.org/10.1145/990308.990310>
dc:identifier DBLP journals/jacm/SpielmanT04 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F990308.990310 (xsd:string)
dcterms:issued 2004 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Daniel_A._Spielman>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Shang-Hua_Teng>
swrc:number 3 (xsd:string)
swrc:pages 385-463 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jacm/SpielmanT04/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jacm/SpielmanT04>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jacm/jacm51.html#SpielmanT04>
rdfs:seeAlso <https://doi.org/10.1145/990308.990310>
dc:subject Simplex method, complexity, perturbation, smoothed analysis (xsd:string)
dc:title Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 51 (xsd:string)