New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract)

DOI10.1007/3-540-45089-0_16zbMATH Open1279.68110OpenAlexW1486759533MaRDI QIDQ3559784FDOQ3559784

Authors: Gaoyan Xie, Cheng Li, Zhe Dang 

Publication date: 7 May 2010

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45089-0_16

Recommendations

• Linear reachability problems and minimal solutions to linear Diophantine equation systems
• ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
• scientific article; zbMATH DE number 1405441
• The complexity of counting models of linear-time temporal logic
• Reachability in timed counter systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (2)

• Linear reachability problems and minimal solutions to linear Diophantine equation systems
• Title not available (Why is that?)

This page was built for publication: New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract)

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