| |
Reviews about "Nonnumerical Algorithms And Problems (F.2.2)":
|
Euclidean distance geometry: an introduction
Liberti L., Lavor C., Springer International Publishing, New York, NY, 2017. 133 pp. Type: Book (978-3-319607-91-7)
|
Circuit complexity, proof complexity, and polynomial identity testing: the ideal proof system
Grochow J., Pitassi T. Journal of the ACM 65(6): 1-59, 2018. Type: Article
|
On k-abelian palindromes
Cassaigne J., Karhumki J., Puzynina S. Information and Computation 260(C): 89-98, 2018. Type: Article
|
Hitting forbidden subgraphs in graphs of bounded treewidth
Cygan M., Marx D., Pilipczuk M., Pilipczuk M. Information and Computation 256(C): 62-82, 2017. Type: Article
|
Locating maximal approximate runs in a string
Amit M., Crochemore M., Landau G., Sokol D. Theoretical Computer Science 700 45-62, 2017. Type: Article
|
An introduction to distance geometry applied to molecular geometry
Lavor C., Liberti L., Lodwick W., da Costa T., Springer Publishing Company, Incorporated, New York, NY, 2017. 54 pp. Type: Book (978-3-319571-82-9)
|
Nature-inspired computing: physics and chemistry-based algorithms
Siddique N., Adeli H., Chapman & Hall/CRC, New York, NY, 2017. 622 pp. Type: Book (978-1-482244-82-3)
|
more...
|
|
|
|
