Corpus ID: 54100300

Word problems requiring exponential time

@inproceedings{Stockmeyer1973WordPR,
  title={Word problems requiring exponential time},
  author={L. Stockmeyer and A. Meyer},
  booktitle={STOC 1973},
  year={1973}
}
  • L. Stockmeyer, A. Meyer
  • Published in STOC 1973
  • Computer Science
  • Topics from this paper.

    Algorithms for Kleene algebra with converse
    3
    Complexity of Equations over Sets of Natural Numbers
    30
    EXTENSION OF THE IDEA OF ANOTHER SOLUTION PROBLEMS AND THEIR COMPLEXITY ANALYSIS SCHEME OUTSIDE FNP
    The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
    48
    The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
    6
    Backdoor Sets of Quantified Boolean Formulas
    76
    Complexity results for prefix grammars
    Complexity theoretic hardness results for query learning
    36
    Computational Complexity of NFA Minimization for Finite and Unary Languages
    34
    Depletable channels: dynamics, behaviour, and efficiency in network design
    2