Pages that link to "Item:Q1107324"
From MaRDI portal
The following pages link to Parallel computation with threshold functions (Q1107324):
Displayed 18 items.
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272) (← links)
- Cellular automata and discrete neural networks (Q807039) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- On the computational efficiency of symmetric neural networks (Q1176243) (← links)
- Some notes on threshold circuits, and multiplication in depth 4 (Q1182104) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Computing with discrete multi-valued neurons (Q1201886) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Speedup of determinism by alternation for multidimensional Turing machines (Q1341727) (← links)
- The parallel complexity of integer prefix summation (Q1350241) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)