Dr. Bulling got his article "On the complexity of resource-bounded logics" which he co-authored with Natasha Alechina, Stéphane Demri, and Brian Logan accepted in the journal Theoretical Computer Science (TCS).
© myboys.me/stock.adobe.com
Dr. Bulling got his article "On the complexity of resource-bounded logics" which he co-authored with Natasha Alechina, Stéphane Demri, and Brian Logan accepted in the journal Theoretical Computer Science (TCS).
Our website uses cookies. These have two functions: Firstly, they are necessary for the basic functionality of our website. On the other hand, with the help of cookies, we can continually improve our content for you. For this purpose, pseudonymised data of website visitors is collected and analysed. By clicking on Settings, you can also select the individual cookies you wish to accept. You can revoke your consent to the use of cookies at any time, even partially. You can find more information about cookies on this website in our privacy declaration and about us in the imprint.