AN O(N1+epsilon LOG-B) ALGORITHM FOR THE COMPLEX ROOTS PROBLEM
Publication
, Conference
NEFF, CA; REIF, JH
Published in: 35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS
1994
Duke Scholars
Published In
35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS
ISSN
0272-5428
ISBN
0-8186-6580-7
Publication Date
1994
Start / End Page
540 / 547
Citation
APA
Chicago
ICMJE
MLA
NLM
NEFF, C. A., & REIF, J. H. (1994). AN O(N1+epsilon LOG-B) ALGORITHM FOR THE COMPLEX ROOTS PROBLEM. In 35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS (pp. 540–547).
NEFF, C. A., and J. H. REIF. “AN O(N1+epsilon LOG-B) ALGORITHM FOR THE COMPLEX ROOTS PROBLEM.” In 35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 540–47, 1994.
NEFF CA, REIF JH. AN O(N1+epsilon LOG-B) ALGORITHM FOR THE COMPLEX ROOTS PROBLEM. In: 35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS. 1994. p. 540–7.
NEFF, C. A., and J. H. REIF. “AN O(N1+epsilon LOG-B) ALGORITHM FOR THE COMPLEX ROOTS PROBLEM.” 35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1994, pp. 540–47.
NEFF CA, REIF JH. AN O(N1+epsilon LOG-B) ALGORITHM FOR THE COMPLEX ROOTS PROBLEM. 35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS. 1994. p. 540–547.
Published In
35TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS
ISSN
0272-5428
ISBN
0-8186-6580-7
Publication Date
1994
Start / End Page
540 / 547