Addendum to “Choiceless polynomial time”

, &
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,219

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”: Ann. Pure Appl. Logic 100 (1999) 141–187.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2001 - Annals of Pure and Applied Logic 112 (1):117.
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.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.
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.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Machines Over the Reals and Non‐Uniformity.Felipe Cucker - 1997 - Mathematical Logic Quarterly 43 (2):143-157.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
The Analytic Polynomial-Time Hierarchy.Herbert Baier & Klaus W. Wagner - 1998 - Mathematical Logic Quarterly 44 (4):529-544.
On the Consistency Strength of Two Choiceless Cardinal Patterns.Arthur W. Apter - 1999 - Notre Dame Journal of Formal Logic 40 (3):341-345.
The algebraic structure of the isomorphic types of tally, polynomial time computable sets.Yongge Wang - 2002 - Archive for Mathematical Logic 41 (3):215-244.
Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.

Analytics

Added to PP
2014-01-16

Downloads
7 (#1,323,891)

6 months
2 (#1,182,310)

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