The following pages link to Zeyu Guo (Q540438):
Displaying 21 items.
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Randomness-Efficient Curve Samplers (Q2851887) (← links)
- GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS (Q3089095) (← links)
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430) (← links)
- Greedy Construction of 2-Approximation Minimum Manhattan Network (Q3596702) (← links)
- Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields (Q4608609) (← links)
- Derandomization from Algebraic Hardness (Q5073523) (← links)
- Efficient List-Decoding With Constant Alphabet and List Sizes (Q5080020) (← links)
- (Q5089209) (← links)
- (Q5121898) (← links)
- (Q5215662) (← links)
- Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading (Q5362983) (← links)
- Minimum Manhattan network is NP-complete (Q5370740) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- Variety evasive subspace families (Q6115376) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach (Q6344206) (← links)
- Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric (Q6531372) (← links)
- Variety evasive subspace families (Q6599767) (← links)
- Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets (Q6735923) (← links)
