Content deleted Content added
No edit summary |
|||
Line 247:
*{{citation |last=Prasolov |first=Victor V. |contribution=1.2.1 The Gauss–Lucas theorem |contribution-url=https://books.google.com/books?id=b1a7ye_EjZwC&pg=PA12 |doi=10.1007/978-3-642-03980-5 |isbn=3-540-40714-6 |mr=2082772 |pages=12–13 |publisher=Springer |series=Algorithms and Computation in Mathematics |title=Polynomials |volume=11 |year=2004}}
*{{citation |last=Pulleyblank |first=W. R. |author-link=William R. Pulleyblank |editor1-last=Bachem |editor1-first=Achim |editor2-last=Korte |editor2-first=Bernhard |editor3-last=Grötschel |editor3-first=Martin |contribution=Polyhedral combinatorics |doi=10.1007/978-3-642-68874-4_13 |pages=312–345 |publisher=Springer |title=Mathematical Programming: The State of the Art (XIth International Symposium on Mathematical Programming, Bonn 1982) |year=1983 |isbn=978-3-642-68876-8}}
*{{citation |last=Rappoport |first=Ari |author-link1=Ari Rappoport |doi=10.1111/1467-8659.1140235 |issue=4 |journal=Computer Graphics Forum |pages=235–240 |title=An efficient adaptive algorithm for constructing the convex differences tree of a simple polygon |volume=11 |year=1992 |s2cid=20137707}}
*{{citation |last=Reay |first=John R. |doi=10.1007/BF02760885 |doi-access=free |issue=3 |journal=[[Israel Journal of Mathematics]] |mr=570883 |pages=238–244 (1980) |title=Several generalizations of Tverberg's theorem |volume=34 |year=1979 |s2cid=121352925}}
*{{citation |last1=Rieffel |first1=Eleanor G. |author1-link=Eleanor Rieffel |last2=Polak |first2=Wolfgang H. |isbn=978-0-262-01506-6 |pages=215–216 |publisher=MIT Press |title=Quantum Computing: A Gentle Introduction |title-link=Quantum Computing: A Gentle Introduction |year=2011}}
| |||