Computation and complexity

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Algorithmics, computation, optimization, complexity, com-binatorics and knowledge representation are closely related sub-areas of Theoretical Computer Science. The following summary presents short descriptions of the twelve chapters in this topical part.

Cite

CITATION STYLE

APA

Woeginger, G. J. (2019). Computation and complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10000, pp. 3–8). Springer. https://doi.org/10.1007/978-3-319-91908-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free