Author of the publication

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.

, , , and . VPT/HCVS@ETAPS, volume 320 of EPTCS, page 65-79. (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Affordances of Broken Affordances., and . INTERACT (3), volume 9298 of Lecture Notes in Computer Science, page 185-202. Springer, (2015)Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution., and . CoRR, (2020)On confluence and residuals in Cauchy convergent transfinite rewriting.. Inf. Process. Lett., 91 (3): 141-146 (2004)Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria., and . ACM Trans. Economics and Comput., 10 (1): 3:1-3:39 (2022)On the Computability of the Topological Entropy of Subshifts.. Discret. Math. Theor. Comput. Sci., 8 (1): 83-96 (2006)Complex-valued Neural Network-based Quantum Language Models., , , , , , and . ACM Trans. Inf. Syst., 40 (4): 84:1-84:31 (2022)Liouville Numbers and the Computational Complexity of Changing Bases., and . CiE, volume 12098 of Lecture Notes in Computer Science, page 50-62. Springer, (2020)Brief Announcement: Labeling Schemes for Power-Law Graphs., , , and . PODC, page 39-41. ACM, (2016)Specker sequences revisited.. Math. Log. Q., 51 (5): 532-540 (2005)Computability in the Lattice of Equivalence Relations., and . DICE-FOPARA@ETAPS, volume 248 of EPTCS, page 38-46. (2017)