The following pages link to (Q4004078):
Displaying 50 items.
- A dimension gap for continued fractions with independent digits -- the non stationary case (Q1617950) (← links)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- An improved bound for disjoint directed cycles (Q1637139) (← links)
- Multiple domination models for placement of electric vehicle charging stations in road networks (Q1652655) (← links)
- A Gale-Berlekamp permutation-switching problem in higher dimensions (Q1715621) (← links)
- Bipartite Ramsey numbers of paths for random graphs (Q1720323) (← links)
- Sparse multipartite graphs as partition universal for graphs with bounded degree (Q1743481) (← links)
- On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks (Q1749800) (← links)
- Rigidity and separation indices of Paley graphs (Q1763348) (← links)
- Antipodality properties of finite sets in Euclidean space (Q1772418) (← links)
- Local statistics for random domino tilings of the Aztec diamond (Q1816472) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Chromatic capacities of graphs and hypergraphs (Q1827711) (← links)
- The Vapnik-Chervonenkis dimension of a random graph (Q1842142) (← links)
- On generalized Ramsey theory: The bipartite case (Q1850469) (← links)
- Nowhere-zero flows in random graphs (Q1850523) (← links)
- The extremal function for complete minors (Q1850528) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Choosability in random hypergraphs (Q1850565) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- Graph imperfection. II (Q1850632) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- On the robustness of interconnections in random graphs: a symbolic approach. (Q1853495) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- Sandwiching random graphs: universality between random graph models (Q1886582) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs (Q1906843) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Computing sparse approximations deterministically (Q1915603) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
- Applications of the crossing number (Q1920423) (← links)
- Comparison of independent, stratified and random covering sample schemes in optimization problems (Q1921106) (← links)
- Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
- On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma (Q1944918) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
- On membership comparable sets (Q1961377) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Noise stability of weighted majority (Q1983068) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph (Q1985447) (← links)
- On the degree of restrictions of \(q\)-valued logic vector functions to linear manifolds (Q2031163) (← links)
