scientific article; zbMATH DE number 1256716
From MaRDI portal
Publication:4228451
zbMATH Open0932.94041MaRDI QIDQ4228451FDOQ4228451
Authors: Shiva Chaudhuri, Jaikumar Radhakrishnan 
Publication date: 18 May 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (42)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials
- Circuit complexity before the dawn of the new millennium
- Title not available (Why is that?)
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
- Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
- Circuit Definitions of Nondeterministic Complexity Classes
- Non-adaptive complex group testing with multiple positive sets
- Distributed broadcast in radio networks of unknown topology.
- Optimal channel utilization with limited feedback
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas
- Title not available (Why is that?)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- On the limits of gate elimination
- On the limits of gate elimination
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
- Deterministic non-adaptive contention resolution on a shared channel
- Title not available (Why is that?)
- A survey of cover-free families: constructions, applications, and generalizations
- New combinatorial structures with applications to efficient group testing with inhibitors
- Hilbert's thirteenth problem and circuit complexity
- Circuits with medium fan-in
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterization of robust immune symmetric Boolean functions
- On the complexity of neighbourhood learning in radio networks
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Circuit complexity of regular languages
- Title not available (Why is that?)
- Randomness buys depth for approximate counting
- Lower bounds against weakly-uniform threshold circuits
- Reviewing bounds on the circuit size of the hardest functions
- Lower bounds for the complexity of restrictions of Boolean functions
- Non-adaptive complex group testing with multiple positive sets
- Lower bounds on threshold and related circuits via communication complexity
- The complexity of word circuits
- Bounds and algorithms for generalized superimposed codes
- Lower bounds for the size of nondeterministic circuits
- The complexity of word circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bootstrapping results for threshold circuits ``just beyond known lower bounds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228451)
