Hanlin Ren
YOU?
Author Swipe
View article: Insomnia and internet addiction: a longitudinal examination using random intercept cross-lagged panel modeling
Insomnia and internet addiction: a longitudinal examination using random intercept cross-lagged panel modeling Open
The increasing prominence of insomnia and internet addiction among university students has raised significant concerns, as these conditions substantially impair physical and mental well-being as well as academic performance. Understanding …
View article: Symmetric Exponential Time Requires Near-Maximum Circuit Size
Symmetric Exponential Time Requires Near-Maximum Circuit Size Open
We show that there is a language in S 2 E (symmetric exponential time) that requires circuit complexity at least 2 n / n on every input length. In particular, the above also implies the same near-maximum circuit lower bounds for Σ 2 E∩ Π 2…
View article: Mindfulness, perceived social support, and suicidal ideation among Chinese adolescents: the mediating role of self-compassion
Mindfulness, perceived social support, and suicidal ideation among Chinese adolescents: the mediating role of self-compassion Open
Objective Previous studies have demonstrated that mindfulness and perceived social support are protective factors against suicide. However, the potential common mechanisms underlying these relationships remain unclear. This study aimed to …
View article: Metamathematics of Resolution Lower Bounds: A TFNP Perspective
Metamathematics of Resolution Lower Bounds: A TFNP Perspective Open
This paper studies the *refuter* problems, a family of decision-tree $\mathsf{TFNP}$ problems capturing the metamathematical difficulty of proving proof complexity lower bounds. Suppose $φ$ is a hard tautology that does not admit any lengt…
View article: The characteristics and associations between trait and state time perspective in adolescents with depression: a questionnaire and sandplay study
The characteristics and associations between trait and state time perspective in adolescents with depression: a questionnaire and sandplay study Open
Background Time perspective is strongly associated with depression. However, the characteristics and associations between trait and state time perspective in adolescents with depression remain unknown. Methods A total of 211 adolescents wi…
View article: Symmetric Exponential Time Requires Near-Maximum Circuit Size
Symmetric Exponential Time Requires Near-Maximum Circuit Size Open
We show that there is a language in S2E/1 (symmetric exponential time with one bit of advice) with circuit complexity at least 2n/n. In particular, the above also implies the same near-maximum circuit lower bounds for the classes Σ2E, (Σ2E…
View article: Preschoolers Can Match the Facial and Bodily Emotional Expressions: A Behavior and Eye-Tracking Study
Preschoolers Can Match the Facial and Bodily Emotional Expressions: A Behavior and Eye-Tracking Study Open
The preschool age is an important period in the development of children’s emotional abilities. The face and body are both vital carriers of emotional information and adults readily match the emotional cues coming from these two modalities.…
View article: Symmetric Exponential Time Requires Near-Maximum Circuit Size
Symmetric Exponential Time Requires Near-Maximum Circuit Size Open
We show that there is a language in $\mathsf{S}_2\mathsf{E}/_1$ (symmetric exponential time with one bit of advice) with circuit complexity at least $2^n/n$. In particular, the above also implies the same near-maximum circuit lower bounds …
View article: Characteristics of psychological time in patients with depression and potential intervention strategies
Characteristics of psychological time in patients with depression and potential intervention strategies Open
Psychological time reveals information about an individual’s psychological state and psychopathological traits and, thus, has become a new perspective through which the occurrence and development of depression can be examined. Psychologica…
View article: Polynomial-Time Pseudodeterministic Construction of Primes
Polynomial-Time Pseudodeterministic Construction of Primes Open
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open pro…
View article: NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach Open
It is a long-standing open problem whether the Minimum Circuit Size Problem (MCSP) and related meta-complexity problems are NP-complete. Even for the rare cases where the NP-hardness of meta-complexity problems are known, we only know very…
View article: Maintaining exact distances under multiple edge failures
Maintaining exact distances under multiple edge failures Open
We present the first compact distance oracle that tolerates multiple failures and maintains *exact* distances. Given an undirected weighted graph G = (V, E) and an arbitrarily large constant d, we construct an oracle that given vertices u,…
View article: Robustness of average-case meta-complexity via pseudorandomness
Robustness of average-case meta-complexity via pseudorandomness Open
We show broad equivalences in the average-case complexity of many different meta-complexity problems, including Kolmogorov complexity, time-bounded Kolmogorov complexity, and the Minimum Circuit Size Problem. These results hold for a wide …
View article: A Relativization Perspective on Meta-Complexity
A Relativization Perspective on Meta-Complexity Open
Meta-complexity studies the complexity of computational problems about complexity theory, such as the Minimum Circuit Size Problem (MCSP) and its variants. We show that a relativization barrier applies to many important open questions in m…
View article: Maintaining Exact Distances under Multiple Edge Failures
Maintaining Exact Distances under Multiple Edge Failures Open
We present the first compact distance oracle that tolerates multiple failures and maintains exact distances. Given an undirected weighted graph $G = (V, E)$ and an arbitrarily large constant $d$, we construct an oracle that given vertices …
View article: Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time
Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time Open
We continue the study of distance sensitivity oracles (DSOs). Given a directed graph G with n vertices and edge weights in {1, 2, … , M}, we want to build a data structure such that given any source vertex u, any target vertex v, and any f…
View article: Hardness of KT Characterizes Parallel Cryptography
Hardness of KT Characterizes Parallel Cryptography Open
A recent breakthrough of Liu and Pass (FOCS'20) shows that one-way functions exist if and only if the (polynomial-)time-bounded Kolmogorov complexity, K^t, is bounded-error hard on average to compute. In this paper, we strengthen this resu…
View article: Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time
Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time Open
We continue the study of distance sensitivity oracles (DSOs). Given a directed graph G with n vertices and edge weights in {1, 2, … , M}, we want to build a data structure such that given any source vertex u, any target vertex v, and any f…
View article: Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time Open
We consider the problem of building Distance Sensitivity Oracles (DSOs). Given a directed graph $G=(V, E)$ with edge weights in $\{1, 2, \dots, M\}$, we need to preprocess it into a data structure, and answer the following queries: given v…
View article: Strong average-case lower bounds from non-trivial derandomization
Strong average-case lower bounds from non-trivial derandomization Open
We prove that for all constants a, NQP = NTIME[n polylog(n)] cannot be (1/2 + 2−log a n )-approximated by 2log a n -size ACC 0 ∘ THR circuits ( ACC 0 circuits with a bottom layer of THR gates). Previously, it was even open whether E NP can…
View article: Approximate Distance Oracles Subject to Multiple Vertex Failures
Approximate Distance Oracles Subject to Multiple Vertex Failures Open
Given an undirected graph $G=(V,E)$ of $n$ vertices and $m$ edges with weights in $[1,W]$, we construct vertex sensitive distance oracles (VSDO), which are data structures that preprocess the graph, and answer the following kind of queries…
View article: Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. Open
We consider the problem of building Distance Sensitivity Oracles (DSOs). Given a directed graph G = (V, E) with edge weights in {1, 2, … , M}, we need to preprocess it into a data structure, and answer the following queries: given vertices…
View article: Single-atomic cobalt sites embedded in hierarchically ordered porous nitrogen-doped carbon as a superior bifunctional electrocatalyst
Single-atomic cobalt sites embedded in hierarchically ordered porous nitrogen-doped carbon as a superior bifunctional electrocatalyst Open
Significance A crucial component in the design of the single-atomic-site (SAS) catalysts for electrochemical applications is the specific surface area and porous structure. Here, we synthesize a type of Co catalyst with single-atomic Co si…
View article: Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time Open
In the bounded-leg shortest path (BLSP) problem, we are given a weighted graph G with nonnegative edge lengths, and we want to answer queries of the form "what's the shortest path from u to v, where only edges of length <=L are considered?…