The following pages link to (Q5495769):
Displaying 50 items.
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Natural Proofs versus Derandomization (Q2805512) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
- The Complexity of Finite-Valued CSPs (Q3177814) (← links)
- Low-Rank Approximation and Regression in Input Sparsity Time (Q3177880) (← links)
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings (Q4561499) (← links)
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (Q4962204) (← links)
- A PRG for lipschitz functions of polynomials with applications to sparsest cut (Q5495770) (← links)
- Improved Cheeger's inequality (Q5495771) (← links)
- On the complexity of trial and error (Q5495773) (← links)
- Coevolutionary opinion formation games (Q5495774) (← links)
- Prior-independent mechanisms for scheduling (Q5495775) (← links)
- Combinatorial walrasian equilibrium (Q5495776) (← links)
- Efficient rounding for the noncommutative grothendieck inequality (Q5495777) (← links)
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression (Q5495779) (← links)
- Sparsity lower bounds for dimensionality reducing maps (Q5495780) (← links)
- Recursive composition and bootstrapping for SNARKS and proof-carrying data (Q5495781) (← links)
- How robust are linear sketches to adaptive inputs? (Q5495782) (← links)
- Equivalence of deterministic one-counter automata is NL-complete (Q5495783) (← links)
- Explicit lower bounds via geometric complexity theory (Q5495784) (← links)
- From information to exact communication (Q5495785) (← links)
- An information complexity approach to extended formulations (Q5495786) (← links)
- Average-case lower bounds for formula size (Q5495787) (← links)
- The complexity of non-monotone markets (Q5495788) (← links)
- Tatonnement beyond gross substitutes? (Q5495789) (← links)
- Simultaneous auctions are (almost) efficient (Q5495790) (← links)
- Composable and efficient mechanisms (Q5495791) (← links)
- Non-black-box simulation in the fully concurrent setting (Q5495792) (← links)
- Non-black-box simulation from one-way functions and applications to resettable security (Q5495793) (← links)
- On the impossibility of approximate obfuscation and applications to resettable cryptography (Q5495794) (← links)
- Shielding circuits with groups (Q5495795) (← links)
- Quasipolynomial-time canonical form for steiner designs (Q5495796) (← links)
- Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (Q5495797) (← links)
- Sparsest cut on bounded treewidth graphs (Q5495798) (← links)
- Large-treewidth graph decompositions and applications (Q5495799) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q5495801) (← links)
- Quasi-polynomial hitting-set for set-depth-Δ formulas (Q5495802) (← links)
- Beyond worst-case analysis in private singular vector computation (Q5495803) (← links)
- Differential privacy for the analyst via private equilibrium computation (Q5495804) (← links)
- Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard (Q5495806) (← links)
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence (Q5495807) (← links)
- Fast routing table construction using small messages (Q5495808) (← links)
- Multidimensional approximate agreement in Byzantine asynchronous systems (Q5495809) (← links)
- Byzantine agreement in polynomial expected time (Q5495810) (← links)
- A o(n) monotonicity tester for boolean functions over the hypercube (Q5495811) (← links)
- Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (Q5495812) (← links)
- Every locally characterized affine-invariant property is testable (Q5495813) (← links)
- Testing subdivision-freeness (Q5495814) (← links)
- Approximation resistance from pairwise independent subgroups (Q5495815) (← links)
- Approximation resistance on satisfiable instances for predicates with few accepting inputs (Q5495816) (← links)
