Pages that link to "Item:Q4601837"
From MaRDI portal
The following pages link to On the (non) NP-hardness of computing circuit complexity (Q4601837):
Displaying 22 items.
- Hardness hypotheses, derandomization, and circuit complexity (Q937197) (← links)
- On solving hard problems by polynomial-size circuits (Q1095663) (← links)
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- Discrete logarithm and minimum circuit size (Q2404611) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- On Circuit-Size Complexity and the Low Hierarchy in NP (Q3675520) (← links)
- (Q3817611) (← links)
- Circuit Definitions of Nondeterministic Complexity Classes (Q4016401) (← links)
- New Collapse Consequences of NP Having Small Circuits (Q4210150) (← links)
- (Q4218116) (← links)
- On the complexity of gradient gate circuits (Q4857749) (← links)
- (Q5092472) (← links)
- Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
- On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers (Q5097008) (← links)
- New insights on the (non-)hardness of circuit minimization and related problems (Q5111269) (← links)
- (Q5121893) (← links)
- (Q5121895) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)
