Pages that link to "Item:Q5664811"
From MaRDI portal
The following pages link to Computational Work and Time on Finite Machines (Q5664811):
Displaying 20 items.
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- Characterization of all optimal networks for a simultaneous computation of AND and NOR (Q796492) (← links)
- On the complexity of ranking (Q920620) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- Compositional complexity of Boolean functions (Q1162360) (← links)
- Some observations on NP real numbers and P-selective sets (Q1164623) (← links)
- A note on the permanent value problem (Q1198001) (← links)
- Computing with discrete multi-valued neurons (Q1201886) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- A class of Boolean functions with linear combinational complexity (Q1223937) (← links)
- On the complexity of inexact computations (Q1225931) (← links)
- The network complexity and the Turing machine complexity of finite functions (Q1230622) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- On the complexity of the marriage problem (Q2556860) (← links)
- Information and computation: Classical and quantum aspects (Q3077099) (← links)
- Revisiting the simulation of quantum Turing machines by quantum circuits (Q5160678) (← links)
- Energy Complexity of Recurrent Neural Networks (Q5378352) (← links)
