Locally definable acceptance types for polynomial time machines (Q5096782): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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/3-540-55210-3_184 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1535036176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting classes: Thresholds, parity, mods, and fewness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of parallel computers from various basis of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 21:43, 29 July 2024

scientific article; zbMATH DE number 7573031
Language Label Description Also known as
English
Locally definable acceptance types for polynomial time machines
scientific article; zbMATH DE number 7573031

    Statements

    Locally definable acceptance types for polynomial time machines (English)
    0 references
    0 references
    0 references
    18 August 2022
    0 references

    Identifiers