Computational Work and Time on Finite Machines
From MaRDI portal
Publication:5664811
DOI10.1145/321724.321731zbMath0251.68031OpenAlexW1982704699MaRDI QIDQ5664811
Publication date: 1972
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321724.321731
Related Items
On the construction of parallel computers from various basis of Boolean functions, Parallel computation with threshold functions, Polynomial time quantum computation with advice, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\), A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity, Compositional complexity of Boolean functions, Some observations on NP real numbers and P-selective sets, Energy Complexity of Recurrent Neural Networks, On the complexity of ranking, Succinct circuit representations and leaf language classes are basically the same concept, Revisiting the simulation of quantum Turing machines by quantum circuits, A note on the permanent value problem, Computing with discrete multi-valued neurons, A comparison of polynomial time reducibilities, A class of Boolean functions with linear combinational complexity, On the complexity of inexact computations, On the combinational complexity of certain symmetric Boolean functions, The network complexity and the Turing machine complexity of finite functions, Information and computation: Classical and quantum aspects, On the complexity of the marriage problem, Characterization of all optimal networks for a simultaneous computation of AND and NOR, The performance of multilective VLSI algorithms
