Pages that link to "Item:Q4522789"
From MaRDI portal
The following pages link to Fast enumeration of combinatorial objects (Q4522789):
Displaying 11 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Constructing perfect steganographic systems (Q719244) (← links)
- Asymptotically optimal perfect steganographic systems (Q734309) (← links)
- Fast enumeration algorithm for words with given constraints on run lengths of ones (Q764093) (← links)
- Fast enumeration of words generated by Dyck grammars (Q2342339) (← links)
- Listing combinatorial objects in parallel (Q3378053) (← links)
- ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION (Q5051175) (← links)
- The design of efficient dynamic programming and transfer matrix enumeration algorithms (Q5363387) (← links)
- (Q5387501) (← links)
- Unconditionally secure short key ciphers based on data compression and randomization (Q6041583) (← links)
- Efficient Enumeration of Distinct Factors Using Package Representations (Q6485942) (← links)