scientific article; zbMATH DE number 1052322

MaRDI QIDQ4349929zbMATHFDO

Authors Bernard M. E. Moret

Publication date 26 August 1997

zbMATH Keywords

theory of computation

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68N99)

Recommendations

• What can be computed? A practical guide to the theory of computation
• Limits of computation. An introduction to the undecidable and the intractable
• Concise guide to computation theory.
• Theory of computation
• Computational Complexity

Cited in

(17)

• The Foundations of Computability Theory
• Computer science. The hardware, software and heart of it
• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
• The Foundations of Computability Theory
• Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
• Constructivity, Computability and Computers in Economic Theory: Some Cautionary Notes
• Simultaneous orthogonal planarity
• Computability and complexity. Foundations and tools for pursuing scientific applications
• Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
• Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks
• scientific article; zbMATH DE number 1061261 (Why is no real title available?)
• A heuristic approach to domino grid problem
• Theory of computation.
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• The perfect matching cut problem revisited
• scientific article; zbMATH DE number 6164359 (Why is no real title available?)
• Kolmogorov Complexity Theory over the Reals

This page was built for publication:

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