The following pages link to SIAM Journal on Computing (Q84798):
Displaying 50 items.
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects (Q2802146) (← links)
- Non-black-box simulation from one-way functions and applications to resettable security (Q2802147) (← links)
- Special section on the forty-fifth annual ACM symposium on the theory of computing (STOC 2013) (Q2805509) (← links)
- An \(o(n)\) monotonicity tester for Boolean functions over the hypercube (Q2805510) (← links)
- Answering \(n^2+o(1)\) counting queries with differential privacy is hard (Q2805511) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
- Maintaining shortest paths under deletions in weighted directed graphs (Q2805514) (← links)
- The geometry of differential privacy: the small database and approximate cases (Q2805515) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias (Q2805518) (← links)
- Approximately counting \(H\)-colorings is \(\#\)BIS-hard (Q2810271) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- Lower bounds for restricted-use objects (Q2812146) (← links)
- The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
- How good is the Chord algorithm? (Q2816293) (← links)
- Special section on the fifty-fourth annual IEEE symposium on foundations of computer science (FOCS 2013) (Q2816295) (← links)
- Candidate indistinguishability obfuscation and functional encryption for all circuits (Q2816296) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Three-player entangled XOR games are NP-hard to approximate (Q2816299) (← links)
- Arithmetic circuits: a chasm at depth 3 (Q2816300) (← links)
- Quantum 3-SAT Is QMA\(_1\)-complete (Q2816302) (← links)
- Optimal bounds on approximation of submodular and XOS functions by juntas (Q2816303) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- Upper and lower bounds on the power of advice (Q2816830) (← links)
- Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
- Special section on the forty-fourth annual ACM symposium on theory of computing (STOC 2012) (Q2817789) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- Computing a nonnegative matrix factorization -- provably (Q2817794) (← links)
- Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space (Q2817796) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Minimizing co-location potential of moving entities (Q2829447) (← links)
- Total space in resolution (Q2829448) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Private matchings and allocations (Q2832895) (← links)
- Mondshein sequences (a.k.a. (2,1)-orders) (Q2832896) (← links)
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning (Q2839169) (← links)
- A dichotomy theorem for the resolution complexity of random constraint satisfaction problems (Q2839170) (← links)
- Information cost tradeoffs for augmented index and streaming language recognition (Q2839171) (← links)
- Error-correcting data structures (Q2839172) (← links)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2839173) (← links)
