Computability and Complexity over Finite Unordered Structures; e.g., Graphs (1979-1982)
Author: David Harel
Paper Information
Title: | Computability and Complexity over Finite Unordered Structures; e.g., Graphs (1979-1982) |
Authors: | David Harel |
Proceedings: | VardiFest22 Talk Abstracts |
Editors: | Kuldeep S. Meel, Giuseppe De Giacomo, Kristin Yvonne Rozier, Priyanka Golia and Suwei Yang |
Keywords: | computable queries, computability over structures, complexity over structures, QPTIME |
Pages: | 1 |
Talk: | Jul 31 16:55 (Session 20) |
Paper: |