Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Complexity Measures And Classes (F.1.3)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 137 Reviews about "Complexity Measures And Classes (F.1.3)": Date Reviewed   Cognition and intractability: a guide to classical and parameterized complexity analysis van Rooij I., Blokpoel M., Kwisthout J., Wareham T., Cambridge University Press, New York, NY, 2019. 374 pp.  Type: Book (978-1-108728-97-3) Is thinking computable--not just in principle, but in practice? In the past this was the subject of vigorous exchanges between philosophers [1,2,3]; today, with the promise of artificial intelligence (AI) appearing ever bright... Jun 15 2021   A complexity trichotomy for approximately counting list H-colorings Galanis A., Goldberg L., Jerrum M. ACM Transactions on Computation Theory 9(2): 1-22, 2017.  Type: Article H-colorings are essential in the exploration of language syntax expositions. An H-coloring is the allocation of adjacent colors to neighboring vertices of a graph G. An ... Jan 11 2018   Controlling loosely cooperating processes Muscholl A., Schewe S. Theoretical Computer Science 611(C): 136-141, 2016.  Type: Article Modern computing is heavily dependent on systems of loosely cooperating processes, whose knowledge of each other is limited to what can be inferred from local history of joint action.... Apr 27 2016   The complexity of reasoning with FODD and GFODD Hescott B., Khardon R. Artificial Intelligence 2291-32, 2015.  Type: Article First-order logic in a logical language invites undecidable complexity of inference irrespective of the language’s restrictions. First-order decision diagrams (FODDs) and generalized first-order decision diagrams (GFODDs) rep... Apr 26 2016   Verifying time complexity of Turing machines Gajser D. Theoretical Computer Science 600(C): 86-97, 2015.  Type: Article For any function T, consider the following decision problem HALTT: does a given Turing machine M run in time at most T(n)? More g... Dec 8 2015    Computational complexity via finite types Asperti A. ACM Transactions on Computational Logic 16(3): 1-25, 2015.  Type: Article Undergraduate-level computer science can feel disjointed at times: for example, at that level, one feels that operating systems and programming languages are entirely separate subdisciplines, whose practitioners have apparently never s... Sep 1 2015   Networks of networks: the last frontier of complexity D’Agostino G., Scala A., Springer Publishing Company, Incorporated, Cham, Switzerland, 2014. 355 pp.  Type: Book (978-3-319035-17-8), Reviews: (2 of 2) A network is a fundamental entity observed everywhere in nature. We observe a wide variety of networks around us, such as computer networks, social networks, communication networks, transport (rail and road) networks, financial network... Mar 11 2015   Quotient space based problem solving: a theoretical foundation of granular computing Zhang L., Zhang B., Morgan Kaufmann Publishers Inc., San Francisco, CA, 2014. 396 pp.  Type: Book (978-0-124103-87-0) Quotient spaces in mathematics are wonderful, powerful, and useful. I personally remember (after many years) how the notion of a quotient illuminated group theory and made it come alive. Since then, I’ve encountered quotient ... Nov 6 2014   Networks of networks: the last frontier of complexity D’Agostino G., Scala A., Springer Publishing Company, Incorporated, Cham, Switzerland, 2014. 355 pp.  Type: Book (978-3-319035-17-8), Reviews: (1 of 2) Networks of networks is an exciting new field, and this book about it is one of a kind. Indeed, a decade and a half ago scientists started to realize the importance of networks. Models of artificial networks and confirmation of univers... Sep 4 2014   Towards a complexity theory for local distributed computing Fraigniaud P., Korman A., Peleg D. Journal of the ACM 60(5): 1-26, 2013.  Type: Article Background on the topic of distributed local computing is given in great detail in this paper. Most of the papers mentioned in the motivation section are recent and valuable in the area. Furthermore, some of the mathematical analysis i... Apr 24 2014       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy