scientific article; zbMATH DE number 7315090

zbMATH Open1455.68085arXiv1008.1668MaRDI QIDQ4964009FDOQ4964009

Narad Rampersad, Michel Rigo, Laurent Waxweiler, Émilie Charlier

Publication date: 24 February 2021

Full work available at URL: https://arxiv.org/abs/1008.1668

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Finite state complexity 👍 👎
• The complexity of divisibility 👍 👎
• On the Complexity of Linear Arithmetic with Divisibility 👍 👎
• State Complexity Research and Approximation 👍 👎
• STATE COMPLEXITY AND APPROXIMATION 👍 👎
• State complexity of unique rational operations 👍 👎
• The complexity of Boolean state separation 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964009)