The following pages link to Eric Bach (Q165878):
Displaying 50 items.
- Toward a theory of Pollard's rho method (Q752762) (← links)
- Bounds for the expected duration of the monopolist game (Q845901) (← links)
- Factoring polynomials using fewer random bits (Q912919) (← links)
- Efficient verification of Tunnell's criterion (Q957686) (← links)
- A novel information transmission problem and its optimal solution (Q963637) (← links)
- Iterative root approximation in \(p\)-adic numerical analysis (Q1049397) (← links)
- DNA models and algorithms for NP-complete problems (Q1276167) (← links)
- Sheaf cohomology is \(\#\)P-hard (Q1283198) (← links)
- Moments in the duration of play (Q1375860) (← links)
- On testing for zero polynomials by a set of points with bounded precision. (Q1401255) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- One-dimensional quantum walks with absorbing boundaries (Q1765300) (← links)
- The complexity of number-theoretic constants (Q1861411) (← links)
- Tensor products and computability (Q1897569) (← links)
- Weil bounds for singular curves (Q1919700) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- Sieve algorithms for perfect power testing (Q2366224) (← links)
- Baby-step giant-step algorithms for the symmetric group (Q2409009) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- On the number of distinct functional graphs of affine-linear transformations over finite fields (Q2637117) (← links)
- 2-designs and redundant syndrome extraction for quantum error correction (Q2687175) (← links)
- Random bisection and evolutionary walks (Q2748448) (← links)
- (Q2766831) (← links)
- Exploiting product distributions to identify relevant variables of correlation immune functions (Q2880978) (← links)
- Approximately counting semismooth integers (Q2963209) (← links)
- Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test (Q2985807) (← links)
- Baby-Step Giant-Step Algorithms for the Symmetric Group (Q2985808) (← links)
- Computing prime harmonic sums (Q3055200) (← links)
- THRESHOLD RULES FOR ONLINE SAMPLE SELECTION (Q3084694) (← links)
- Estimating completion time ratios of a fork-join barrier synchronization (Q3122376) (← links)
- Statistical Evidence for Small Generating Sets (Q3137449) (← links)
- (Q3138894) (← links)
- Factor Refinement (Q3141529) (← links)
- A Parallel Approach in Computing Correlation Immunity up to Six Variables (Q3186055) (← links)
- (Q3211422) (← links)
- Explicit Bounds for Primality Testing and Related Problems (Q3478501) (← links)
- The hardness of computing an eigenform (Q3533254) (← links)
- Threshold Rules for Online Sample Selection (Q3578349) (← links)
- Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions (Q3583323) (← links)
- Phase transition of multivariate polynomial systems (Q3616213) (← links)
- (Q3689236) (← links)
- Sums of Divisors, Perfect Numbers and Factoring (Q3744218) (← links)
- How to Generate Factored Random Numbers (Q3783345) (← links)
- Factoring with Cyclotomic Polynomials (Q3809851) (← links)
- (Q4325958) (← links)
- (Q4335193) (← links)
- Comments on search procedures for primitive roots (Q4372647) (← links)
- Energy Arguments in the Theory of Algorithms (Q4373323) (← links)
- Efficient prediction of Marsaglia-Zaman random number generators (Q4400348) (← links)
- (Q4551384) (← links)
