The following pages link to Circuit minimization problem (Q3191973):
Displaying 49 items.
- 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)
- The complexity of explicit constructions (Q693069) (← links)
- Almost-natural proofs (Q716305) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- Optimising attractor computation in Boolean automata networks (Q2232265) (← links)
- The hidden subgroup problem and MKTP (Q2330111) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Discrete logarithm and minimum circuit size (Q2404611) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (Q2407103) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Natural Proofs versus Derandomization (Q2805512) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Limits on the Computational Power of Random Strings (Q3012814) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- (Q3304139) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- (Q5091189) (← links)
- (Q5091223) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- (Q5092470) (← links)
- (Q5092472) (← links)
- Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
- (Q5092482) (← links)
- (Q5111269) (← links)
- (Q5121893) (← links)
- (Q5121895) (← links)
- The Evolution of Representation in Simple Cognitive Networks (Q5378245) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- Easiness assumptions and hardness tests: Trading time for zero error (Q5956013) (← links)
- (Q6054746) (← links)
- Arithmetic Expression Construction. (Q6065408) (← links)
- (Q6084358) (← 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)
- Constructive separations and their consequences (Q6566463) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)
