scientific article; zbMATH DE number 761756
From MaRDI portal
Publication:4835660
zbMath0822.03022MaRDI QIDQ4835660
Publication date: 8 June 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reducibilityregular languageclosure propertiescomplexity theoryprincipal idealcomplexity classeslanguage classespredicate classespromise classes
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)
Related Items (6)
A characterization of the leaf language classes ⋮ Exact Pairs for Abstract Bounded Reducibilities ⋮ Unambiguous computations and locally definable acceptance types ⋮ Optimal proof systems imply complete sets for promise classes ⋮ Succinct circuit representations and leaf language classes are basically the same concept ⋮ Succinct representation, leaf languages, and projection reductions
This page was built for publication:
