Neither reading few bits twice nor reading illegally helps much (Q1130185): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q430829
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander A. Razborov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Entropy of contact circuits and lower bounds on their complexity / 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: Q3821583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3364203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on branching programs reading some bits twice / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds and hierarchy results for restricted branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of branching programs and decision trees for clique functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superpolynomial lower bound for (1,+k(n))-branching programs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054498950 / rank
 
Normal rank

Latest revision as of 09:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Neither reading few bits twice nor reading illegally helps much
scientific article

    Statements

    Identifiers