Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 570 Reviews about "Nonnumerical Algorithms And Problems (F.2.2)": Date Reviewed   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   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   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) In recent years, a great deal of research interest has grown in nature-inspired computing, that is, computing involving the fundamental concepts of physics, chemistry, and biology. The discipline is now quite mature and established. Si... Jan 15 2018   In-place algorithms for exact and approximate shortest unique substring problems Hon W., Thankachan S., Xu B. Theoretical Computer Science 690 12-25, 2017.  Type: Article The problem of exact shortest unique substring (SUS) is formulated as follows:... Dec 27 2017   Graph isomorphism in quasipolynomial time [extended abstract] Babai L.  STOC 2016 (Proceedings of the 48th Annual ACM SIGACT Symposium on the Theory of Computing, Cambridge, MA, Jun 19-21, 2016) 684-697, 2016.  Type: Proceedings The graph isomorphism (GI) problem is an extremely interesting problem for computer scientists and mathematicians alike, and it is one of those problems whose complexity status is still unresolved. To this end, in this paper, Babai pre... Jun 27 2017   Estimating the subsystem reliability of bubblesort networks Kung T., Hung C. Theoretical Computer Science 67045-55, 2017.  Type: Article A bubblesort network consists of nodes labeled with permutations of characters, so that two nodes have a direct connection when their corresponding permutations differ by the interchange of two adjacent characters. A multiprocessor sys... Jun 2 2017       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy