Pages that link to "Item:Q4228451"

The following pages link to Deterministic restrictions in circuit complexity (Q4228451):

Displaying 32 items.

• Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
• Randomness buys depth for approximate counting (Q483707) (← links)
• Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
• Characterization of robust immune symmetric Boolean functions (Q892387) (← links)
• On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
• Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
• Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
• Geometric arguments yield better bounds for threshold circuits and distributed computing (Q1365681) (← links)
• Isolating and odd number of elements and applications in complexity theory (Q1384703) (← links)
• Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
• On the limits of gate elimination (Q1635510) (← links)
• \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
• Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
• Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
• New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
• Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
• Non-adaptive Complex Group Testing with Multiple Positive Sets (Q3010399) (← links)
• (Q3352964) (← links)
• (Q3817611) (← links)
• Circuit Definitions of Nondeterministic Complexity Classes (Q4016401) (← links)
• Circuits with medium fan-in (Q4601838) (← links)
• Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
• (Q5077146) (← links)
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
• Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (Q5415496) (← links)
• (Q5875501) (← links)
• Circuit complexity of regular languages (Q5895106) (← links)
• Optimal channel utilization with limited feedback (Q5925513) (← links)
• Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
• Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
• A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)