Positive versions of polynomial time (Q1281503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Clemens Lautemann / rank
Normal rank
 
Property / author
 
Property / author: Thomas Schwentick / rank
Normal rank
 
Property / author
 
Property / author: Clemens Lautemann / rank
 
Normal rank
Property / author
 
Property / author: Thomas Schwentick / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073674197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone versus positive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on time-storage trade off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone separation of logarithmic space from logarithmic depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Problems Involving Boolean Labelled Structures and Projection Transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Hamiltonian path operator to capture NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Description of Monotone NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-sensitive transitive closure operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness of path-problems via logical reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:01, 28 May 2024

scientific article
Language Label Description Also known as
English
Positive versions of polynomial time
scientific article

    Statements

    Positive versions of polynomial time (English)
    0 references
    22 March 1999
    0 references
    complexity class
    0 references
    0 references
    0 references

    Identifiers