The following pages link to (Q3311639):
Displaying 27 items.
- A babystep-giantstep method for faster deterministic integer factorization (Q3177725) (← links)
- The Diophantine Equation 𝑥⁴+2𝑦⁴=𝑧⁴+4𝑤⁴ (Q3377004) (← links)
- New perspectives on rhythmic canons and the spectral conjecture (Q3391791) (← links)
- Invited paper Data rate optimization in synchronous circuits (Q3479985) (← links)
- Percolation in quantum computation and (Q3654793) (← links)
- An algorithm for profile and wavefront reduction of sparse matrices (Q3736810) (← links)
- Integer Sets with Distinct Subset-Sums (Q3800132) (← links)
- Generation of three‐dimensional unstructured grids by the advancing‐front method (Q3821773) (← links)
- On alternativep-center problems (Q4015966) (← links)
- (Q4028785) (← links)
- A comparison of algorithms for exact goodness-of-fit tests for multinomial data (Q4387693) (← links)
- Assembly planning with an ordering genetic algorithm (Q4443326) (← links)
- COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ (Q4820145) (← links)
- A QUEUEING MODELLING APPROACH TO CLUSTERED HETEROGENEOUS DISCRETE EVENT DYNAMIC SYSTEMS (Q4820148) (← links)
- Convex hull of planar<i>h</i>-polyhedra (Q4831398) (← links)
- Analysis of quickselect : an algorithm for order statistics (Q4858843) (← links)
- Remarks on History and Presence of Game Tree Search and Research (Q4915265) (← links)
- Worst-case efficient external-memory priority queues (Q5054847) (← links)
- A FORTRAN program for profile and wavefront reduction (Q5203574) (← links)
- The emergence of computational sociology (Q5691272) (← links)
- Assessing hierarchy and balance in dynamic network models (Q5691273) (← links)
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem. (Q5940720) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)
- Computer Go (Q5958205) (← links)
- Weighted domination on cocomparability graphs (Q6487953) (← links)
- An introduction to parallel dynamic programming (Q6560205) (← links)
- Finding strong components using depth-first search (Q6563999) (← links)
