Pages that link to "Item:Q1201152"
From MaRDI portal
The following pages link to Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152):
Displaying 50 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- Limits of Boolean functions on \(\mathbb{F}_p^n\) (Q463037) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Time-space tradeoffs for satisfiability (Q1567402) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- The hardest halfspace (Q1983325) (← links)
- The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free (Q2056741) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- Modular statistics for subgraph counts in sparse random graphs (Q2256135) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- Communication complexity of some number theoretic functions (Q2470553) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- On the number of zero-patterns of a sequence of polynomials (Q2719034) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)
- ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400) (← links)
- Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Construction of Very Hard Functions for Multiparty Communication Complexity (Q4494482) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- (Q4612486) (← links)
- (Q4612487) (← links)
- Unexpected upper bounds on the complexity of some communication games (Q4632411) (← links)
- Interleaved Group Products (Q4634030) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- (Q5005112) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
