Pages that link to "Item:Q4441893"
From MaRDI portal
The following pages link to On the Autoreducibility of Random Sequences (Q4441893):
Displaying 12 items.
- The hat guessing number of graphs (Q777481) (← links)
- On the pseudorandomness of automatic sequences (Q1667443) (← links)
- Hat problem: a new strategy based on quantum stabilizer codes (Q2107049) (← links)
- Hat guessing numbers of degenerate graphs (Q2200434) (← links)
- Bears with hats and independence polynomials (Q2672444) (← links)
- Finite Dynamical Systems, Hat Games, and Coding Theory (Q4578011) (← links)
- (Q4708572) (← links)
- New Constructions and Bounds for Winkler's Hat Game (Q5254032) (← links)
- On the construction of effectively random sets (Q5311758) (← links)
- Derandomization of auctions (Q5892485) (← links)
- On 1-factorizations of bipartite Kneser graphs (Q5918934) (← links)
- Bears with hats and independence polynomials (Q6599792) (← links)