Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 878 Reviews about "Analysis Of Algorithms And Problem Complexity (F.2)": Date Reviewed   Algorithm 993: efficient computation with Kronecker products Fackler P. ACM Transactions on Mathematical Software 45(2): 1-9, 2019.  Type: Article The Kronecker product of two matrices replaces each element of the first matrix with a multiple of a copy of the second matrix. The history, applications, and properties of the Kronecker and the symmetric products are well known [1,2].... Aug 14 2019   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) If someone has a set of objects whose positions are known, calculating the distances between them is not a problem. However, the inverse problem is difficult, that is, given a set of distances between objects, determine their positions... May 14 2019   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 Cook and Reckhow [1] proved that NP ≠ coNP if and only if in every propositional proof system there is a tautology whose proof size has a super-polynomial lower bound (in terms of the size of the proved formula). Currently, i... Feb 13 2019   On k-abelian palindromes Cassaigne J., Karhumki J., Puzynina S. Information and Computation 260(C): 89-98, 2018.  Type: Article This paper explores words (finite strings over a fixed finite alphabet Σ with at least two letters) that are k-abelian equivalent to their reversals. Two words are k-abelian equivalent if ... Oct 17 2018   What can (and can’t) we do with sparse polynomials? Roche D.  ISSAC 2018 (Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New York, NY, Jul 16-19, 2018) 25-30, 2018.  Type: Proceedings This is the paper version of Roche’s ISSAC 2018 tutorial, which serves as an update to my work [1]. It is an excellent tutorial, written in a clear and accessible style. ISSAC is to be commended for these tutorials, and I wis... Oct 10 2018   Once upon an algorithm: how stories explain computing Erwig M., The MIT Press, Cambridge, MA, 2017. 336 pp.  Type: Book (978-0-262036-63-4) Martin Erwig emphasizes the general nature of computation and the use of computer science (CS) in this book. He uses well-known stories to explain computing concepts to readers not familiar with the field.... Sep 21 2018   A verified ODE solver and the Lorenz attractor Immler F. Journal of Automated Reasoning 61(1-4): 73-111, 2018.  Type: Article Lorenz used a system of ordinary differential equations (ODEs) to study atmospheric dynamics phenomena [1]. He established the great sensitivity of the results obtained by this simplified model to very small, nearly negligible changes ... Aug 27 2018   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 For a given linear transform A over a given vector space Q starting at point x, the orbit of x under A is an infinite sequence (x Jul 23 2018   Locating maximal approximate runs in a string Amit M., Crochemore M., Landau G., Sokol D. Theoretical Computer Science 700 45-62, 2017.  Type: Article Repetition and periodicity play an essential role in efficient pattern matching, data analysis, and data compression. This paper presents an efficient algorithm to identify maximal sequences of approximate repetitions within a string, ... Jul 3 2018   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) The most common way of determining the structures of molecules in a solution is nuclear magnetic resonance (NMR). The signals measured are caused by the flipping of the spins of paramagnetic nuclei in a magnetic field. The strengths of... Jun 7 2018       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy