The following pages link to Chandan K. Dubey (Q1003767):
Displaying 13 items.
- (Q619901) (redirect page) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power (Q2969652) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- Some Algorithms on Conditionally Critical Indecomposable Graphs (Q3439358) (← links)
- On Indecomposability Preserving Elimination Sequences (Q3591306) (← links)
- Algorithms on Graphs with Small Dominating Targets (Q5459110) (← links)
- Computing and Combinatorics (Q5716991) (← links)
- Sampling a Uniform Random Solution of a Quadratic Equation Modulo $p^k$ (Q6250355) (← links)
- Computing the $p$-adic Canonical Quadratic Form in Polynomial Time (Q6254860) (← links)
- Generating a Quadratic Forms from a Given Genus (Q6254931) (← links)