The following pages link to Ravi B. Boppana (Q290254):
Displaying 27 items.
- The average sensitivity of bounded-depth circuits (Q290255) (← links)
- The average-case parallel complexity of sorting (Q582080) (← links)
- Threshold functions and bounded depth monotone circuits (Q1088970) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- (Q1196451) (redirect page) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- (Q1266177) (redirect page) (← links)
- An asymptotic isoperimetric inequality (Q1266178) (← links)
- The decision-tree complexity of element distinctness (Q1342263) (← links)
- Tomaszewski's problem on randomly signed sums, revisited (Q2030761) (← links)
- Tomaszewski's problem on randomly signed sums: breaking the 3/8 barrier (Q2401426) (← links)
- (Q3753481) (← links)
- Some properties of Hueckel-type edge operators (Q3954844) (← links)
- (Q4359309) (← links)
- (Q4385519) (← links)
- (Q4636457) (← links)
- The Biased Coin Problem (Q4875433) (← links)
- Perfect-Information Leader Election with Optimal Resilience (Q4943872) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- The tree search game for two players (Q5080909) (← links)
- Brief Announcement (Q5197678) (← links)
- Bounded Independence versus Symmetric Tests (Q5205817) (← links)
- The biased coin problem (Q5248493) (← links)
- Simple and local independent set approximation (Q5915922) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
