A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Regular Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Pseudorandom Generators for Depth 2 Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On beating the hybrid argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for group products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank

Latest revision as of 09:04, 5 July 2024

scientific article
Language Label Description Also known as
English
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3
scientific article

    Statements

    Identifiers