The following pages link to (Q3003675):
Displaying 50 items.
- On some extensions of the Ailon-Rudnick theorem (Q328599) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- A strictly stationary \(\beta\)-mixing process satisfying the central limit theorem but not the weak invariance principle (Q404595) (← links)
- An entropy argument for counting matroids (Q462939) (← links)
- The Bargmann transform and powers of harmonic oscillator on Gelfand-Shilov subspaces (Q506251) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order (Q684195) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Lie groups of controlled characters of combinatorial Hopf algebras (Q826435) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Randomized oblivious integral routing for minimizing power cost (Q897952) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- Universality in a class of fragmentation-coalescence processes (Q1650135) (← links)
- Autonomous quantum machines and finite-sized clocks (Q1712561) (← links)
- Simulating aggregates of bivalents in \(2n=40\) mouse meiotic spermatocytes through inhomogeneous site percolation processes (Q1789072) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Probabilistic representation formula for the solution of fractional high-order heat-type equations (Q2000975) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Gravity as an ensemble and the moment problem (Q2044940) (← links)
- Sharp and simple bounds for the raw moments of the binomial and Poisson distributions (Q2070605) (← links)
- Invertibility of frame operators on Besov-type decomposition spaces (Q2117498) (← links)
- \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
- Compartmental observability approach for the optimal transparency problem in multi-agent systems (Q2158971) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Disassociation energies for the finite-density \(N\)-body problem (Q2212396) (← links)
- Extending Bell numbers for parsimonious chase estimation (Q2296734) (← links)
- Green's relations in deterministic finite automata (Q2311884) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- On the quantitative dynamical Mordell-Lang conjecture (Q2352014) (← links)
- Using probabilistic models to study the asymptotic behavior of Bell numbers (Q2400057) (← links)
- An Itô calculus for a class of limit processes arising from random walks on the complex plane (Q2402425) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- A cooperative game-theoretic approach to the social ridesharing problem (Q2407882) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Popular subsets for Euler's \(\varphi \)-function (Q2423413) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- The distribution of numbers with many factorizations (Q2664683) (← links)
- The Poisson binomial distribution -- old \& new (Q2684692) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width (Q3304141) (← links)
- Diagonal Discriminant Analysis With Feature Selection for High-Dimensional Data (Q3391457) (← links)
- Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form (Q4558324) (← links)
- Computing highly oscillatory integrals (Q4586621) (← links)
- Stirling number of the fourth kind and lucky partitions of a finite set (Q4957560) (← links)
- (Q4989400) (← links)
