Pages that link to "Item:Q1083204"
From MaRDI portal
The following pages link to On the construction of parallel computers from various basis of Boolean functions (Q1083204):
Displaying 37 items.
- Computing with planar toppling domino arrangements (Q256439) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Modulo classes and logarithmic advice (Q672652) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- Computing with discrete multi-valued neurons (Q1201886) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- On closure properties of GapP (Q1337146) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Universally serializable computation (Q1384538) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
- The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
- THE THOMPSON–HIGMAN MONOIDS M<sub>k,i</sub>: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY (Q2996837) (← links)
- Generation of universal series-parallel Boolean functions (Q3158543) (← links)
- Towards Parallel Boolean Functional Synthesis (Q3303903) (← links)
- Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
- (Q4295951) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)
- Strong self-reducibility precludes strong immunity (Q4895818) (← links)
- (Q5005151) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- Locally definable acceptance types for polynomial time machines (Q5096782) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
