Number of the records: 1  

Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth

  1. 1.
    de Oliveira Oliveira, Mateus
    Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth.
    11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Guo, J.; Hermelin, D.), s. 1-12, č. článku 25. Leibniz International Proceedings in Informatics, 63. ISBN 978-3-95977-023-1. ISSN 1868-8969.
    [11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Aarhus (DK), 24.08.2016-26.08.2016]
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://drops.dagstuhl.de/opus/volltexte/2017/6925/
    http://hdl.handle.net/11104/0272695
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.