( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Descriptive Complexity of Deterministic Polylogarithmic Time.

, , , , и . WoLLIC, том 11541 из Lecture Notes in Computer Science, стр. 208-222. Springer, (2019)

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.

José-Maria Hinz

José-Maria Hinz

Maria-José Estevão

José Maria Wiest

José Maria Aroni

 

Другие публикации лиц с тем же именем

On Higher Order Query Languages which on Relational Databases Collapse to Second Order Logic., , и . CoRR, (2016)Completeness in Polylogarithmic Time and Space., , , и . CoRR, (2020)Proper Hierarchies in Polylogarithmic Time and Absence of Complete Problems., , , и . FoIKS, том 12012 из Lecture Notes in Computer Science, стр. 90-105. Springer, (2020)Towards an ASM Thesis for Reflective Sequential Algorithms., , и . ABZ, том 9675 из Lecture Notes in Computer Science, стр. 244-249. Springer, (2016)Systematic Refinement of Abstract State Machines with Higher-Order Logic., , , и . ABZ, том 10817 из Lecture Notes in Computer Science, стр. 204-218. Springer, (2018)Descriptive complexity of deterministic polylogarithmic time and space., , , , и . J. Comput. Syst. Sci., (2021)Descriptive Complexity of Deterministic Polylogarithmic Time., , , , и . WoLLIC, том 11541 из Lecture Notes in Computer Science, стр. 208-222. Springer, (2019)A Restricted Second-Order Logic for Non-deterministic Poly-Logarithmic Time., , , и . CoRR, (2019)The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic., , , и . SYNASC, стр. 133-140. IEEE, (2018)Uniform Polylogarithmic Space Completeness., , , и . Frontiers Comput. Sci., (2022)