Pages that link to "Item:Q1165218"
From MaRDI portal
The following pages link to Asymptotically optimal switching circuits (Q1165218):
Displaying 17 items.
- Highly symmetric expanders (Q700158) (← links)
- Low-complexity error correction of Hamming-code-based LDPC codes (Q734298) (← links)
- Smaller superconcentrators of density 28 (Q844173) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Decoding concatenated codes with inner convolutional codes (Q1280739) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- Some ``good'' properties of LDA lattices (Q1752293) (← links)
- Stabilizing network bargaining games by blocking players (Q1801001) (← links)
- Natural bounded concentrators (Q1842573) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- Note on ``Smaller explicit superconcentrators'' (Q2190906) (← links)
- Bipartite multigraphs with expander-like properties (Q2381530) (← links)
- Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
