Pages that link to "Item:Q1107324"
From MaRDI portal
The following pages link to Parallel computation with threshold functions (Q1107324):
Displaying 36 items.
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits (Q293467) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272) (← links)
- Cellular automata and discrete neural networks (Q807039) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← 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)
- Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- Higher-Order Threshold Implementations (Q2936616) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- Lower Bounds for Threshold and Symmetric Functions in Parallel Computation (Q3990657) (← links)
- On the computational complexity of the Dirichlet Problem for Poisson's Equation (Q4593239) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts (Q6096734) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
