Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGLOG News, 2014. Verfasst von Neil Immerman.
Abstract (Originalsprache)
I am pleased to announce that I will be editing a quarterly column on Logic and Complexity for the SIGLOG newsletter. The topic of logic and complexity is quite broad: computational complexity is a central issue for most areas in logic and computer science. While checking if a program has a certain property, or more generally if a statement is true, is typically undecidable, as a community we have made great progress in developing algorithms and building tools that perform these tasks in many useful cases. Similarly we have shown that many key problems are complete for a wide range of complexity classes.
Zitieren
APA
Immerman, N. (2014). Complexity column. ACM SIGLOG News. https://doi.org/10.1145/2657460.2657463
Vancouver
Immerman N. Complexity column. ACM SIGLOG News. 2014. doi:10.1145/2657460.2657463
BibTeX
@article{Immerman2014,
author = {Immerman, Neil},
title = {Complexity column},
journal = {ACM SIGLOG News},
year = {2014},
doi = {10.1145/2657460.2657463}
}
EUVIMED