The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract)

@inproceedings{Wagner1984TheCO,
  title={The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract)},
  author={K. Wagner},
  booktitle={MFCS},
  year={1984}
}
  • K. Wagner
  • Published in MFCS 1984
  • Computer Science
  • Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 23 CITATIONS

    Equivalence Problems for Circuits over Sets of Natural Numbers

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

    VIEW 20 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

    • Daniel Meister
    • Mathematics, Computer Science
    • Theory of Computing Systems
    • 2007
    VIEW 16 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals

    VIEW 13 EXCERPTS
    CITES RESULTS & BACKGROUND
    HIGHLY INFLUENCED

    Multiobjective Optimization and Language Equations

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    The complexity of membership problems for circuits over sets of integers

    VIEW 12 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Balance Problems for Integer Circuits

    • Titus Dose
    • Computer Science, Mathematics
    • Electronic Colloquium on Computational Complexity
    • 2018

    Emptiness Problems for Integer Circuits

    Constraint Satisfaction Problems around Skolem Arithmetic

    VIEW 1 EXCERPT
    CITES BACKGROUND