Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F)     Theory Of Computation (F) See Reviews     F.0 General (79) F.1 Computation By Abstract Devices   General (67)   Models Of Computation (230)   Modes Of Computation (171)   Complexity Measures And Classes (230)   Miscellaneous (7) F.2 Analysis Of Algorithms And Problem Complexity   General (298)   Numerical Algorithms And Problems (321)   Nonnumerical Algorithms And Problems (606)   Tradeoffs between Complexity Measures (26)   Miscellaneous (22) F.2 Analysis Of Algorithms And Problem Complexity (cont.) F.3 Logics And Meanings Of Programs   General (41)   Specifying And Verifying And Reasoning About Programs (31)   Semantics Of Programming Languages (292)   Studies Of Program Constructs (115)   Miscellaneous (0) F.4 Mathematical Logic And Formal Languages   General (66)   Mathematical Logic (7)   Grammars And Other Rewriting Systems (141)   Formal Languages (186)   Miscellaneous (13) F.m Miscellaneous (26)               Reviews limited to: All General Terms Algorithms Design Documentation Economics Experimentation Human factors Languages Legal Aspects Management Measurement Performance Reliability Security Standardization Theory Verification     Reviews in category "Theory Of Computation (F)": Deciding polynomial-transcendental problems McCallum S., Weispfenning V.  Journal of Symbolic Computation 47(1): 16-31, 2012. Type: Article Matrix analysis Horn R., Johnson C.,  Cambridge University Press, New York, NY, 2012. 664 pp. Type: Book (978-0-521548-23-6) On the distinctness of modular reductions of primitive sequences modulo square-free odd integers Zheng Q., Qi W., Tian T.  Information Processing Letters 112(22): 872-875, 2012. Type: Article Reaction-diffusion automata: phenomenology, localisations, computation Adamatzky A.,  Springer Publishing Company, Incorporated, New York, NY, 2012. 343 pp. Type: Book (978-3-642310-77-5) The complexity of the list homomorphism problem for graphs Egri L., Krokhin A., Larose B., Tesson P.  Theory of Computing Systems 51(2): 143-178, 2012. Type: Article more... Related Topics F.1.1 Models Of Computation   - Mathematical Logic F.2 Analysis Of Algorithms And Problem Complexity   - Complexity Measures And Classes   - Logic Design   - Integrated Circuits F.2.1 Numerical Algorithms And Problems   - Numerical Analysis   - Symbolic and Algebraic Manipulation   - Mathematical Software    more
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc. Terms of Use | Privacy Policy