Pages that link to "Item:Q3614150"
From MaRDI portal
The following pages link to Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table (Q3614150):
Displayed 23 items.
- Compact DSOP and partial DSOP forms (Q385501) (← links)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (Q3012837) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- (Q5091223) (← links)
- (Q5092470) (← links)
- (Q5092472) (← links)
- Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
- (Q5121893) (← links)
- (Q5121895) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Partially unate Boolean functions: properties of their sum-of-products representations (Q6110617) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)