Computational Complexity

DOI10.1007/978-1-4614-1800-9MaRDI QIDQ5894361zbMATH OpenOpenAlexFDO

Authors

Publication date 21 November 2011

Full work available at URL https://doi.org/10.1007/978-1-4614-1800-9

zbMATH Keywords

agent based modelingcellular automatacomplex systemsintelligent systemssoft computingunconventional computing

Mathematics Subject Classification ID

General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of computing (68Q01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 47903
• scientific article; zbMATH DE number 486435
• Current Trends in Theoretical Computer Science
• Theories of computational complexity
• Complexity theory and theory of algorithms
• Computational Complexity
• scientific article; zbMATH DE number 1418967
• Theory of Computational Complexity

Cited in

(5)

• Emergent computation. A Festschrift for Selim G. Akl
• scientific article; zbMATH DE number 2161335 (Why is no real title available?)
• Current Trends in Theoretical Computer Science
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• Complexity of two-level systems

This page was built for publication: Computational Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894361)