On the hierarchy of nondeterministic branching k-programs (Q5055950): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/BFb0036199 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bfb0036199 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1575676006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for read-once-only branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on read-$k$ times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3364203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347300 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0036199 / rank
 
Normal rank

Latest revision as of 15:46, 30 December 2024

scientific article; zbMATH DE number 7631387
Language Label Description Also known as
English
On the hierarchy of nondeterministic branching k-programs
scientific article; zbMATH DE number 7631387

    Statements

    Identifiers