The following pages link to Derandomized graph products (Q1842777):
Displaying 31 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- On codes from hypergraphs. (Q1427432) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- How much randomness is needed to convert MA protocols to AM protocols? (Q2097236) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Logarithmic reduction of the level of randomness in some probabilistic geometric constructions (Q2491601) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Online Admission Control and Embedding of Service Chains (Q3460710) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS (Q3526528) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Deterministic Tensor Completion with Hypergraph Expanders (Q5162629) (← links)
- On the advantage over a random assignment (Q5894908) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- Designing menus of contracts efficiently: the power of randomization (Q6161464) (← links)
