Tessellations with local transformations
Journal of Computer and System Sciences
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Complexity of linear cellular automata over Zm*
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
Hi-index | 0.00 |
In this paper, P(#P) and PF(#P) are characterized in terms of a largely different computation structure, where P(#P) (resp., PF(#P)) is the class of sets (resp., functions) that are polynomial-time Turing reducible to #P functions. Let MidP be the class ...