scientific article
From MaRDI portal
Publication:3785901
zbMath0643.68012MaRDI QIDQ3785901
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stacksdata structuresnondeterminismcomplexity theorylogics of programscomputational power of programming languageshigher-order arrays
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Data structures (68P05)
Related Items (4)
Computational inductive definability ⋮ On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ Characterizing complexity classes by higher type primitive recursive definitions ⋮ Characterizing complexity classes by general recursive definitions in higher types
This page was built for publication: