Pages that link to "Item:Q1230622"
From MaRDI portal
The following pages link to The network complexity and the Turing machine complexity of finite functions (Q1230622):
Displaying 25 items.
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Characterization of all optimal networks for a simultaneous computation of AND and NOR (Q796492) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- The complexity of deciding reachability properties of distributed negotiation schemes (Q924139) (← links)
- Complex Boolean networks obtained by diagonalization (Q1060185) (← links)
- Uncontrollable computational growth in theoretical physics (Q1071512) (← links)
- Complete divisibility problems for slowly utilized oracles (Q1083192) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- A 3n-lower bound on the network complexity of Boolean functions (Q1142030) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- On the complexity of 2-output Boolean networks (Q1159183) (← links)
- The equivalence of Horn and network complexity for Boolean functions (Q1160604) (← links)
- Compositional complexity of Boolean functions (Q1162360) (← links)
- A survey of space complexity (Q1193412) (← links)
- A lower bound on the number of additions in monotone computations (Q1232179) (← links)
- On the simulation of quantum Turing machines. (Q1401393) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- PAC-learning gains of Turing machines over circuits and neural networks (Q2111729) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- The complexity of contract negotiation (Q2457671) (← links)
- (Q3049813) (← links)
- Information and computation: Classical and quantum aspects (Q3077099) (← links)
- Nonuniform complexity classes specified by lower and upper bounds (Q4730777) (← links)
