scientific article
From MaRDI portal
Publication:3992696
zbMath0743.68010MaRDI QIDQ3992696
S. C. van Westrhenen, R. Sommerhalder
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reducibilitycompletenessapproximation algorithmscomputabilityrecursion theoryrandomized and parallel algorithms
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)
Related Items (11)
Efficient unidimensional universal cellular automaton ⋮ Linear programs in a simple reversible language. ⋮ Subrecursive Complexity of Identifying the Ramsey Structure of Posets ⋮ Using the Hamiltonian path operator to capture NP ⋮ On a class of fuzzy computable functions ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ A family of fuzzy programming languages ⋮ The influence of domain interpretations on computational models ⋮ Partition theorems for factorizations of ascending parameter words ⋮ On the Meaning Maximization Doctrine: An Alternative to the Utilitarian Doctrine ⋮ Computability, complexity and economics
This page was built for publication:
