Addendum to “Choiceless polynomial time”: Ann. Pure Appl. Logic 100 (1999) 141–187

, &
Annals of Pure and Applied Logic 112 (1):117 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(01)00086-0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Addendum to “Choiceless polynomial time”.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2001 - Annals of Pure and Applied Logic 112 (1):117.
Choiceless polynomial time.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs.Anuj Dawar, David Richerby & Benjamin Rossman - 2008 - Annals of Pure and Applied Logic 152 (1):31-50.
Time polynomial in input or output.Yuri Gurevich & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (3):1083-1088.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
Erratum to “Zero-one laws for modal logic” [Ann. Pure Appl. Logic 69 (1994) 157–193].Joseph Y. Halpern & Bruce M. Kapron - 2003 - Annals of Pure and Applied Logic 121 (2-3):281-283.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.

Analytics

Added to PP
2014-03-18

Downloads
8 (#1,243,760)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Choiceless polynomial time.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.

Add more references