Author:
Beigel Richard,Gill John,Hertramp Ulrich
Publisher
Springer Berlin Heidelberg
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Barnette’s Conjecture Through the Lens of the $$Mod_{k}P$$ Complexity Classes;Discrete and Computational Geometry, Graphs, and Games;2021
2. Exact Computation of the Number of Accepting Paths of an NTM;Algorithms and Discrete Applied Mathematics;2018
3. On Functions and Relations;Discrete Mathematics and Theoretical Computer Science;2003
4. Generalized Regular Counting Classes;Lecture Notes in Computer Science;1999
5. Restrictive acceptance suffices for equivalence problems;Fundamentals of Computation Theory;1999