A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-immune sets for complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures for distributed counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Almost Everywhere Complex Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulations among multidimensional Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing access pointers into trees and arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On time hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite exponent partition relations and well-ordered choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on arbitrarily complex recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turing machine time hierarchy / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0890-5401(91)90022-t / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045334235 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
scientific article

    Statements

    A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    almost-everywhere-complex sets
    0 references
    deterministic-time-complexity
    0 references
    diagonalization
    0 references

    Identifiers