An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/NeffR94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/NeffR94
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/C._Andrew_Neff
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/John_H._Reif
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1994.365737
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1994.365737
>
dc:
identifier
DBLP conf/focs/NeffR94
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1994.365737
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
rdfs:
label
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/C._Andrew_Neff
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/John_H._Reif
>
swrc:
pages
540-547
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS35
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/NeffR94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/NeffR94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs94.html#NeffR94
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1994.365737
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
Boolean model of computation, complex roots problem, univariate polynomial, complex coefficients, imaginary parts, real parts, arithmetic model, complexity, arithmetic computations
(xsd:string)
dc:
title
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document