The following pages link to Shuichi Hirahara (Q1751255):
Displaying 33 items.
- Virtual machine placement for minimizing connection cost in data center networks (Q1751257) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity (Q2922621) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- Identifying an honest EXP NP oracle among many (Q4601831) (← links)
- On characterizations of randomized computation using plain Kolmogorov complexity1 (Q4608445) (← links)
- (Q5072483) (← links)
- (Q5092470) (← links)
- (Q5111137) (← links)
- (Q5111269) (← links)
- (Q5121893) (← links)
- Unexpected hardness results for Kolmogorov complexity under uniform reductions (Q5144987) (← links)
- New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems (Q5205823) (← links)
- (Q5368752) (← links)
- (Q5875741) (← links)
- (Q5875777) (← links)
- Beyond Natural Proofs: Hardness Magnification and Locality (Q5889786) (← links)
- (Q6054746) (← links)
- (Q6084358) (← links)
- Hardness of constant-round communication complexity (Q6115394) (← links)
- (Q6126276) (← links)
- (Q6126325) (← links)
- (Q6126326) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- (Q6168476) (← links)
- (Q6187822) (← links)
- Beyond Natural Proofs: Hardness Magnification and Locality (Q6329480) (← links)
- Finding errorless pessiland in error-prone heuristica (Q6568368) (← links)
- Symmetry of information from meta-complexity (Q6568369) (← links)
- Kolmogorov complexity characterizes statistical zero knowledge (Q6610263) (← links)
- Learning versus pseudorandom generators in constant parallel time (Q6610340) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
- Bounded relativization (Q6640340) (← links)
