The following pages link to Pankaj Rohatgi (Q676457):
Displaying 18 items.
- On completeness under random reductions (Q676458) (← links)
- Improving known solutions is hard (Q687508) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- How to sign digital streams (Q1854413) (← links)
- On unique satisfiability and the threshold behavior of randomized reductions (Q1894445) (← links)
- Saving queries with randomness (Q1894455) (← links)
- Improved algorithms via approximations of probability distributions (extended abstract) (Q2817653) (← links)
- Fast practical algorithms for the Boolean-product-witness-matrix problem (Q3454755) (← links)
- (Q3971264) (← links)
- (Q4005200) (← links)
- (Q4036579) (← links)
- (Q4364551) (← links)
- (Q4712652) (← links)
- Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems (Q4857593) (← links)
- Structural complexity theory: Recent surprises (Q5056087) (← links)
- On the complexity of incremental computation (Q5096828) (← links)
- Randomness-optimal unique element isolation, with applications to perfect matching and related problems (Q5248515) (← links)
