Pages that link to "Item:Q619899"

The following pages link to The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899):

Displaying 26 items.

• On parametric timed automata and one-counter machines (Q515666) (← links)
• The complexity of Boolean formula minimization (Q619911) (← links)
• Avoiding simplicity is complex (Q693072) (← links)
• Algorithmic networks: central time to trigger expected emergent open-endedness (Q2315017) (← links)
• The minimum oracle circuit size problem (Q2410683) (← links)
• Resource-bounded Kolmogorov complexity revisited (Q2784486) (← links)
• Asymptotic density and the coarse computability bound (Q2799747) (← links)
• The Complexity of Complexity (Q2973719) (← links)
• On Resource-Bounded Versions of the van Lambalgen Theorem (Q2988817) (← 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)
• Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
• (Q4258583) (← links)
• Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
• Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)
• Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts (Q5090471) (← links)
• Randomness and Intractability in Kolmogorov Complexity (Q5091181) (← links)
• Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
• (Q5092482) (← links)
• New insights on the (non-)hardness of circuit minimization and related problems (Q5111269) (← links)
• (Q5121893) (← links)
• The non-hardness of approximating circuit size (Q5918358) (← links)
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← 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)