Pages that link to "Item:Q5091223"

The following pages link to (Q5091223):

Displaying 11 items.

• Lower Bounds for Coin-Weighing Problems (Q2947551) (← links)
• Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
• Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
• A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
• (Q5092482) (← links)
• A fixed-depth size-hierarchy theorem for AC ⁰ [⊕] via the coin problem (Q5212785) (← links)
• (Q5875732) (← links)
• The non-hardness of approximating circuit size (Q5918358) (← links)
• Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
• A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
• One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)