Anel Auyezova, Aigerim Aitim, Aksulu Mukhanova. Polynomial methods for solving the subset sum problem with applications to unstructured information search. // Procedia Computer Science. – 2026. – DOI: 10.1016/j.procs.2026.08.473. – URL: https://doi.org/10.1016/j.procs.2026.08.473
Anel Auyezova, Aigerim Aitim, & Aksulu Mukhanova (2026). Polynomial methods for solving the subset sum problem with applications to unstructured information search. Procedia Computer Science. https://doi.org/10.1016/j.procs.2026.08.473
Anel Auyezova, et al. “Polynomial methods for solving the subset sum problem with applications to unstructured information search.” Procedia Computer Science, 2026. doi:10.1016/j.procs.2026.08.473.
@article{Auyezova2026,
title = {Polynomial methods for solving the subset sum problem with applications to unstructured information search},
author = {Auyezova, Anel and Aitim, Aigerim and Mukhanova, Aksulu},
journal = {Procedia Computer Science},
year = {2026},
doi = {10.1016/j.procs.2026.08.473},
url = {https://doi.org/10.1016/j.procs.2026.08.473}
}