The following pages link to Theory of Cryptography (Q5898359):
Displayed 50 items.
- (Q5207055) (← links)
- (Q5214179) (← links)
- (Q5214238) (← links)
- Segmentation, Incentives, and Privacy (Q5219697) (← links)
- Fingerprinting codes and the price of approximate differential privacy (Q5259533) (← links)
- Analyze gauss (Q5259534) (← links)
- Private matchings and allocations (Q5259535) (← links)
- Rounding sum-of-squares relaxations (Q5259536) (← links)
- Constant factor approximation for balanced cut in the PIE model (Q5259537) (← links)
- Entropy, optimization and counting (Q5259538) (← links)
- Polynomial bounds for the grid-minor theorem (Q5259539) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Cops, robbers, and threatening skeletons (Q5259541) (← links)
- Pseudorandom generators with optimal seed length for non-boolean poly-size circuits (Q5259543) (← links)
- On derandomizing algorithms that err extremely rarely (Q5259544) (← links)
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (Q5259545) (← links)
- Lower bounds for depth 4 formulas computing iterated matrix multiplication (Q5259546) (← links)
- The limits of depth reduction for arithmetic formulas (Q5259547) (← links)
- A super-polynomial lower bound for regular arithmetic formulas (Q5259548) (← links)
- A characterization of locally testable affine-invariant properties via decomposition theorems (Q5259549) (← links)
- L <sub>p</sub> -testing (Q5259550) (← links)
- Turnstile streaming algorithms might as well be linear sketches (Q5259551) (← links)
- Linear time construction of compressed text indices in compact space (Q5259552) (← links)
- Formulas vs. circuits for small distance connectivity (Q5259554) (← links)
- Toward better formula lower bounds (Q5259555) (← links)
- Breaking the minsky-papert barrier for constant-depth circuits (Q5259556) (← links)
- Economic efficiency requires interaction (Q5259557) (← links)
- The sample complexity of revenue maximization (Q5259558) (← links)
- Optimal competitive auctions (Q5259559) (← links)
- Homological product codes (Q5259561) (← links)
- A quantum algorithm for computing the unit group of an arbitrary degree number field (Q5259563) (← links)
- Primal beats dual on online packing LPs in the random-order model (Q5259564) (← links)
- Competitive algorithms from competitive equilibria (Q5259565) (← links)
- Minimum bisection is fixed parameter tractable (Q5259566) (← links)
- An efficient parallel solver for SDD linear systems (Q5259567) (← links)
- Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time (Q5259568) (← links)
- From hierarchical partitions to hierarchical covers (Q5259570) (← links)
- Shortest paths on polyhedral surfaces and terrains (Q5259571) (← links)
- Embedding and canonizing graphs of bounded genus in logspace (Q5259572) (← links)
- Testing surface area with arbitrary accuracy (Q5259573) (← links)
- Coin flipping of <i>any</i> constant bias implies one-way functions (Q5259574) (← links)
- Infinite randomness expansion with a constant number of devices (Q5259577) (← links)
- The average sensitivity of an intersection of half spaces (Q5259578) (← links)
- From average case complexity to improper learning complexity (Q5259579) (← links)
- Bandits with switching costs (Q5259581) (← links)
- Online local learning via semidefinite programming (Q5259582) (← links)
- How to use indistinguishability obfuscation (Q5259583) (← links)
- How to delegate computations (Q5259584) (← links)
- Circuits resilient to additive attacks with applications to secure computation (Q5259585) (← links)
- On the existence of extractable one-way functions (Q5259586) (← links)