scientific article
From MaRDI portal
Publication:3219765
zbMath0556.68016MaRDI QIDQ3219765
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Categories of machines, automata (18B20) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (3)
Sublinear-communication secure multiparty computation does not require FHE ⋮ The size and depth of layered Boolean circuits ⋮ Constructive universal algebra: An introduction
This page was built for publication:
