The following pages link to (Q4137124):
Displayed 22 items.
- A binary algorithm with low divergence for modular inversion on SIMD architectures (Q480385) (← links)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
- Molecular dynamics on vector computers (Q1073533) (← links)
- Learning optimization in simplifying fuzzy rules (Q1125358) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- The Kantorovich metric for probability measures on the circle (Q1893595) (← links)
- An improved exact sampling algorithm for the standard normal distribution (Q2135885) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Quantum and classical tradeoffs (Q2575086) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Deniable Functional Encryption (Q2798776) (← links)
- Parallel tempering for the planted clique problem (Q3303299) (← links)
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers (Q5041226) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- A time-randomness tradeoff for selection in parallel (Q5060137) (← links)
- Investigation of finite-sample properties of robust location and scale estimators (Q5083008) (← links)
- (Q5092465) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
- Exact sublinear binomial sampling (Q5963375) (← links)
- On some \(\Pi_q\)-identities of Gosper (Q6144655) (← links)