The following pages link to (Q5491026):
Displaying 17 items.
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- Sublinear-time algorithms for tournament graphs (Q652634) (← links)
- Sublinear time algorithms in the theory of groups and semigroups. (Q716397) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Testing the expansion of a graph (Q963057) (← links)
- Trigger detection for adaptive scientific workflows using percentile sampling (Q2830613) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- Borel oracles. An analytical approach to constant-time algorithms (Q3581114) (← links)
- Testing Monotone Continuous Distributions on High-Dimensional Real Cubes (Q4933371) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Sublinear Computation Paradigm (Q5153706) (← links)
- Solving variational inequalities with Stochastic Mirror-Prox algorithm (Q5168840) (← links)
- Sublinear-Time Algorithms for Tournament Graphs (Q5323094) (← links)
- (Q5743440) (← links)
- Recognizing the tractability in big data computing (Q5918820) (← links)
