Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-022-10074-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4293059963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / 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: Towards an Implicit Characterization of NC k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOGSPACE and PTIME characterized by programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of higher-order types or, life without CONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Non-determinism in Higher-Order Implicit Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit characterizations of FPTIME and NC revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties that characterize LOGCFL / rank
 
Normal rank

Latest revision as of 11:29, 2 August 2024

scientific article; zbMATH DE number 7719393
Language Label Description Also known as
English
Subclasses of \textsc{Ptime} interpreted by programming languages
scientific article; zbMATH DE number 7719393

    Statements

    Subclasses of \textsc{Ptime} interpreted by programming languages (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    cons-free programs
    0 references
    complexity theory
    0 references
    abstract complexity theory
    0 references
    lower bounds
    0 references
    auxiliary pushdown automata
    0 references
    0 references