scientific article; zbMATH DE number 1052322
From MaRDI portal
Publication:4349929
zbMATH Open0948.68070MaRDI QIDQ4349929FDOQ4349929
Publication date: 26 August 1997
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68N99)
Cited In (15)
- Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructivity, Computability and Computers in Economic Theory: Some Cautionary Notes
- A heuristic approach to domino grid problem
- Simultaneous Orthogonal Planarity
- The perfect matching cut problem revisited
- Theory of computation.
- Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks
- Title not available (Why is that?)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
- Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
- The Foundations of Computability Theory
- Kolmogorov Complexity Theory over the Reals
- The Foundations of Computability Theory
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)