Work

Descriptive and computational complexity

Year: 1989

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-51498-8_23

Author: Neil Immerman

Institution: University of Massachusetts Amherst

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1495098865

FWCI: 4.62

Cites:

Cited by: 116

Related to: 10