Pages that link to "Item:Q2875127"
From MaRDI portal
The following pages link to Proceedings of the forty-second ACM symposium on Theory of computing (Q2875127):
Displaying 50 items.
- Sorting under partial information (without the ellipsoid algorithm). (Q2439837) (← links)
- Pseudorandom Generators for Polynomial Threshold Functions (Q2848221) (← links)
- Spectral methods for matrices and tensors (Q2875128) (← links)
- Are many small sets explicitly small? (Q2875129) (← links)
- Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs (Q2875130) (← links)
- Extensions and limits to vertex sparsification (Q2875131) (← links)
- Subgraph sparsification and nearly optimal ultrasparsifiers (Q2875132) (← links)
- How to compress interactive communication (Q2875133) (← links)
- A strong direct product theorem for disjointness (Q2875134) (← links)
- Hardness amplification in proof complexity (Q2875135) (← links)
- Load balancing and orientability thresholds for random hypergraphs (Q2875136) (← links)
- The maximum multiflow problems with bounded fractionality (Q2875137) (← links)
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (Q2875138) (← links)
- A full characterization of quantum advice (Q2875139) (← links)
- BQP and the polynomial hierarchy (Q2875140) (← links)
- A quantum lovász local lemma (Q2875141) (← links)
- Near-optimal extractors against quantum storage (Q2875142) (← links)
- Public-key cryptography from different assumptions (Q2875143) (← links)
- Oblivious RAMs without cryptogrpahic assumptions (Q2875144) (← links)
- On the round complexity of covert computation (Q2875145) (← links)
- Detecting high log-densities (Q2875146) (← links)
- Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (Q2875147) (← links)
- Optimal homologous cycles, total unimodularity, and linear programming (Q2875148) (← links)
- Improving exhaustive search implies superpolynomial lower bounds (Q2875149) (← links)
- On the complexity of circuit satisfiability (Q2875150) (← links)
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (Q2875151) (← links)
- Recognizing well-parenthesized expressions in the streaming model (Q2875152) (← links)
- Measuring independence of datasets (Q2875153) (← links)
- Zero-one frequency laws (Q2875154) (← links)
- Improved algorithms for computing fisher's market clearing prices (Q2875155) (← links)
- Bayesian algorithmic mechanism design (Q2875156) (← links)
- Multi-parameter mechanism design and sequential posted pricing (Q2875157) (← links)
- A sparse Johnson (Q2875159) (← links)
- Saving space by algebraization (Q2875160) (← links)
- On the structure of cubic and quartic polynomials (Q2875161) (← links)
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (Q2875162) (← links)
- Matroid matching (Q2875164) (← links)
- Budget constrained auctions with heterogeneous items (Q2875165) (← links)
- On the searchability of small-world networks with arbitrary underlying structure (Q2875166) (← links)
- Almost tight bounds for rumour spreading with conductance (Q2875167) (← links)
- On the list-decodability of random linear codes (Q2875168) (← links)
- Local list-decoding and testing of random linear codes from high error (Q2875169) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171) (← links)
- The limits of buffering (Q2875172) (← links)
- Maintaining a large matching and a small vertex cover (Q2875173) (← links)
- Connectivity oracles for failure prone graphs (Q2875174) (← links)
- Approximate sparse recovery (Q2875175) (← links)
- The HOM problem is decidable (Q2875176) (← links)
- Complexity theory for operators in analysis (Q2875177) (← links)
- Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem (Q2875178) (← links)