Positive versions of polynomial time
type: Item
instance of: scholarly article
title: Positive versions of polynomial time
zbMATH Open document ID: 0927.68037
published in: Information and Computation
publication date: 1999-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1267928
zbMATH Keywords: complexity class
author: Clemens Lautemann
author: Thomas Schwentick
MaRDI profile type: Publication
OpenAlex ID: W2073674197
cites work: Monotone versus positive
cites work: Q3791123
cites work: Q4385519
cites work: On Relating Time and Space to Size and Depth
cites work: Alternation
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: An observation on time-storage trade off
cites work: Q3775538
cites work: Q4850061
cites work: Q4198056
cites work: Q4843270
cites work: Q4128417
cites work: Q4036700
cites work: Monotone separation of logarithmic space from logarithmic depth
cites work: Q4525283
cites work: Q4346734
cites work: Relational queries computable in polynomial time
cites work: Languages that Capture Complexity Classes
cites work: Nondeterministic Space is Closed under Complementation
cites work: Q3221403
cites work: Lower bounds on monotone complexity of the logical permanent
cites work: Q4431372
cites work: Complete Problems Involving Boolean Labelled Structures and Projection Transactions
cites work: Using the Hamiltonian path operator to capture NP
cites work: Logical Description of Monotone NP Problems
cites work: Context-sensitive transitive closure operators
cites work: Completeness of path-problems via logical reductions
cites work: The method of forced enumeration for nondeterministic automata
DOI: 10.1006/INCO.1998.2742
description: scientific article; zbMATH DE number 1267928