Descriptive Complexity
| Use attributes for filter ! | |
| Google books | books.google.com |
|---|---|
| Originally published | 1999 |
| Authors | Neil Immerman |
| Date of Reg. | |
| Date of Upd. | |
| ID | 3142244 |
About Descriptive Complexity
A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. . . .