Work

Languages which capture complexity classes

Year: 1983

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/800061.808765

Author: Neil Immerman

Institutions: Tufts University, Massachusetts Institute of Technology

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2093779107

FWCI: 4.909

Cites: 28

Cited by: 113

Related to: 10