Computational Work and Time on Finite Machines
From MaRDI portal
Cited in
(23)- The performance of multilective VLSI algorithms
- On the construction of parallel computers from various basis of Boolean functions
- Parallel computation with threshold functions
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Compositional complexity of Boolean functions
- Some observations on NP real numbers and P-selective sets
- 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
- The network complexity and the Turing machine complexity of finite functions
- Polynomial time quantum computation with advice
- On the complexity of the marriage problem
- Information and computation: Classical and quantum aspects
- On the combinational complexity of certain symmetric Boolean functions
- A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Energy complexity of recurrent neural networks
- Succinct circuit representations and leaf language classes are basically the same concept
- Characterization of all optimal networks for a simultaneous computation of AND and NOR
- On the complexity of ranking
This page was built for publication: Computational Work and Time on Finite Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5664811)
