On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q590572
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alberto Bertoni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58338-6_71 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1538001993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing maximal word functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound for nonregular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a complexity hierarchy between L and NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory of synchronous parallel computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic languages and polyominoes enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal languages and enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of ranking simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective entropies and data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5751951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On eliminating nondeterminism from Turing machines which use less than logarithm worktape space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounded computations: Review and new separation results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficient Generation of Language Instances / rank
 
Normal rank

Latest revision as of 21:45, 29 July 2024

scientific article; zbMATH DE number 7573187
Language Label Description Also known as
English
On languages accepted with simultaneous complexity bounds and their ranking problem
scientific article; zbMATH DE number 7573187

    Statements

    On languages accepted with simultaneous complexity bounds and their ranking problem (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2022
    0 references
    0 references
    0 references
    0 references

    Identifiers