Jim Huggins / huggins@acm.org
[an error occurred while processing this directive]
URL:
http://web.eecs.umich.edu/gasm/papers/onpoly.html (page only)
last update: Wednesday, 14-Aug-2013 18:19:19 EDT
| Citation: | Andreas Blass, Yuri Gurevich, and Saharon Shelah, "On Polynomial Time Computation Over Unordered Structures". Journal of Symbolic Logic, to appear 2001. |
|---|---|
| Summary: | A consideration of several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time, including choiceless polynomial time. |
| Subjects: | Logic & Computability |
| Download: | From Yuri Gurevich's home page in PostScript. |
| Notes: |
[an error occurred while processing this directive]
URL:
http://web.eecs.umich.edu/gasm/papers/onpoly.html (page only)
last update: Wednesday, 14-Aug-2013 18:19:19 EDT