- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Reasoning about action in polynomial time
Artificial Intelligence 115 (1):1-24 (1999)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Polynomial time ultrapowers and the consistency of circuit lower bounds.Jan Bydžovský & Moritz Müller - 2020 - Archive for Mathematical Logic 59 (1-2):127-147.
A second-order system for polytime reasoning based on Grädel's theorem.Stephen Cook & Antonina Kolokolova - 2003 - Annals of Pure and Applied Logic 124 (1-3):193-231.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
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.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
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.
Polynomial Time Operations in Explicit Mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
Polynomial games and determinacy.Tomoyuki Yamakami - 1996 - Annals of Pure and Applied Logic 80 (1):1-16.
Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
A Simple Observation Regarding Iterations Of Finite-valued Polynomial-time Functions.Jerzy Mycka - 2009 - Reports on Mathematical Logic:19-29.
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
Every polynomial-time 1-degree collapses if and only if P = PSPACE.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.
Feasible Operations and Applicative Theories Based on λη.Andrea Cantini - 2000 - Mathematical Logic Quarterly 46 (3):291-312.
Analytics
Added to PP
2020-12-22
Downloads
2 (#1,800,073)
6 months
1 (#1,469,469)
2020-12-22
Downloads
2 (#1,800,073)
6 months
1 (#1,469,469)
Historical graph of downloads
Citations of this work
A unifying approach to temporal constraint reasoning.Peter Jonsson & Christer Bäckström - 1998 - Artificial Intelligence 102 (1):143-155.
Point algebras for temporal reasoning: Algorithms and complexity.Mathias Broxvall & Peter Jonsson - 2003 - Artificial Intelligence 149 (2):179-220.
Reasoning about action in polynomial time.Thomas Drakengren & Marcus Bjäreland - 1999 - Artificial Intelligence 115 (1):1-24.
An initial study of time complexity in infinite-domain constraint satisfaction.Peter Jonsson & Victor Lagerkvist - 2017 - Artificial Intelligence 245 (C):115-133.
References found in this work
Reasoning about action in polynomial time.Thomas Drakengren & Marcus Bjäreland - 1999 - Artificial Intelligence 115 (1):1-24.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-55b469568f-bzrbm uwo