The following pages link to (Q4004078):
Displaying 50 items.
- More on BPP and the polynomial-time hierarchy (Q1351599) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- On the Ramsey number \(r(H+\overline{K_ n},K_ n)\) (Q1363675) (← links)
- Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- The abstract lace expansion (Q1373442) (← links)
- On embedding expanders into \(\ell_p\) spaces (Q1376045) (← links)
- Constructive bounds for a Ramsey-type problem (Q1376057) (← links)
- Ramsey properties of random hypergraphs (Q1380335) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- The local density of triangle-free graphs (Q1382812) (← links)
- A lower bound for irredundant Ramsey numbers (Q1382826) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Probabilistic existence theorems in group testing (Q1395870) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- Two sensitivity theorems in fuzzy integer programming. (Q1421465) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Maximum antichains in random subsets of a finite set (Q1570763) (← links)
- Cellular telephone networks and random maps in hypergraphs (Q1570826) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- A near-optimal polynomial time algorithm for learning in certain classes of stochastic games (Q1583226) (← links)
- An extremal problem for subset-sum-distinct sequences with congruence conditions (Q1584356) (← links)
- Sign-balanced covering matrices (Q1584386) (← links)
- Averaging sequences, deranged mappings, and a problem of Lampert and Slater (Q1584653) (← links)
- Measure and probability for concurrency theorists (Q1589655) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
- A manifesto for the computational method (Q1603721) (← links)
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Sparse universal graphs (Q1612288) (← links)
- On a generalization of Polya inequality and some of its statistical implications (Q1612293) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
