Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F)  
  Theory Of Computation (F) See Reviews  
 
F.0 General (125)
F.1 Computation By Abstract Devices
  General (72)
  Models Of Computation (274)
  Modes Of Computation (13)
  Complexity Measures And Classes (262)
  Miscellaneous (7)
F.2 Analysis Of Algorithms And Problem Complexity
  General (322)
  Numerical Algorithms And Problems (389)
  Nonnumerical Algorithms And Problems (667)
  Tradeoffs between Complexity Measures (27)
  Miscellaneous (23)
F.2 Analysis Of Algorithms And Problem Complexity (cont.)
F.3 Logics And Meanings Of Programs
  General (45)
  Specifying And Verifying And Reasoning About Programs (35)
  Semantics Of Programming Languages (316)
  Studies Of Program Constructs (119)
  Miscellaneous (0)
F.4 Mathematical Logic And Formal Languages
  General (70)
  Mathematical Logic (8)
  Grammars And Other Rewriting Systems (152)
  Formal Languages (197)
  Miscellaneous (13)
F.m Miscellaneous (26)
 
         
 
Reviews limited to:
 
 

Reviews in category "Theory Of Computation (F)":
On the foundations of computing
Primiero G.,  Oxford University Press, Oxford, UK, 2020. 320 pp. Type: Book (978-0-198835-65-3)
Multimodal scene understanding
Ying Yang M., Rosenhahn B., Murino V.,  ACADEMIC PRESS, London, UK, 2019. 412 pp. Type: Book (978-0-128173-58-9)
Cubical Agda: a dependently typed programming language with univalence and higher inductive types
Vezzosi A., Mörtberg A., Abel A.  Proceedings of the ACM on Programming Languages 3(ICFP): 1-29, 2019. Type: Article
Constructing quotient inductive-inductive types
Kaposi A., Kovács A., Altenkirch T.  Proceedings of the ACM on Programming Languages 3(POPL): 1-24, 2019. Type: Article
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)
more...

Related Topics

F.1.1
Models Of Computation
  - Mathematical Logic

F.2
Analysis Of Algorithms And Problem Complexity
  - Logic Design
  - Integrated Circuits
  - Complexity Measures And Classes

F.2.1
Numerical Algorithms And Problems
  - Numerical Analysis
  - Mathematical Software
  - Symbolic and Algebraic Manipulation
   more
   
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy