Complexity of Bezout s Theorem V: Polynomial Time - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Mike Shub, Steve Smale. Complexity of Bezout s Theorem V: Polynomial Time. Theoretical Computer Science, 133(1):141-164, 1994.

@article{ShubS94,
  title = {Complexity of Bezout s Theorem V: Polynomial Time},
  author = {Mike Shub and Steve Smale},
  year = {1994},
  researchr = {https://researchr.org/publication/ShubS94},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {133},
  number = {1},
  pages = {141-164},
}

runs on WebDSL