Is the euclidean algorithm optimal among its Peers?
Bulletin of Symbolic Logic 10 (3):390-418 (2004)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesMareike B. Wieth & Rose T. Zacks (2011). Time of Day Effects on Problem Solving: When the Non-Optimal is Optimal. Thinking and Reasoning 17 (4):387 - 401.
Mark Vorobej (2011). Distant Peers. Metaphilosophy 42 (5):708-722.
Wojciech Buszkowski & Gerald Penn (1990). Categorial Grammars Determined From Linguistic Data by Unification. Studia Logica 49 (4):431 - 454.
David Stump (1991). Poincaré's Thesis of the Translatability of Euclidean and Non-Euclidean Geometries. Noûs 25 (5):639-657.
Rodney G. Downey & Asher M. Kach (2010). Euclidean Functions of Computable Euclidean Domains. Notre Dame Journal of Formal Logic 52 (2):163-172.
Louden Dries & Yiannis N. Moschovakis (2004). Is the Euclidean Algorithm Optimal Among its Peers? Bulletin of Symbolic Logic 10 (3):390 - 418.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #180,404 of 556,837 )Recent downloads (6 months)1 ( #64,847 of 556,837 )How can I increase my downloads? |
My notes
Discussion
