Guangyan Zhou

Orcid: 0000-0001-7290-5579

According to our database1, Guangyan Zhou authored at least 21 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Further Explanations on "SAT Requires Exhaustive Search".
CoRR, 2024

2023
MicrobiomeAnalyst 2.0: comprehensive statistical, functional and integrative analysis of microbiome data.
Nucleic Acids Res., July, 2023

Large Language Model for Science: A Study on P vs. NP.
CoRR, 2023

Hard Examples Requiring Exhaustive Search do Exist.
CoRR, 2023

2022
OmicsNet 2.0: a web-based platform for multi-omics integration and network visual analytics.
Nucleic Acids Res., 2022

Super solutions of the model RB.
Frontiers Comput. Sci., 2022

2021
The number of satisfying assignments of random 2-SAT formulas.
Random Struct. Algorithms, 2021

OmicsAnalyst: a comprehensive web-based platform for visual analytics of multi-omics data.
Nucleic Acids Res., 2021

MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights.
Nucleic Acids Res., 2021

Hiding solutions in model RB: Forced instances are almost as hard as unforced ones.
CoRR, 2021

2020
miRNet 2.0: network-based visual analytics for miRNA functional analysis and systems biology.
Nucleic Acids Res., 2020

Exact Phase Transitions of Model RB with Slower-Growing Domains.
CoRR, 2020

The random 2-SAT partition function.
CoRR, 2020

2019
Super solutions of random (3 + <i>p</i>)-SAT.
Theor. Comput. Sci., 2019

NetworkAnalyst 3.0: a visual analytics platform for comprehensive gene expression profiling and meta-analysis.
Nucleic Acids Res., 2019

On the Lower Bounds of (1, 0)-Super Solutions for Random k-SAT.
Int. J. Found. Comput. Sci., 2019

2018
OmicsNet: a web-based tool for creation and visual analysis of biological networks in 3D space.
Nucleic Acids Res., 2018

On the lower bounds of random Max 3 and 4-SAT.
J. Comb. Optim., 2018

2016
On the Lower Bounds of Random Max 3 and 4-SAT.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
On the constraint length of random k-CSP.
J. Comb. Optim., 2015

2013
A New Upper Bound for Random (2 + <i>P</i>)-SAT by Flipping Two Variables.
Int. J. Found. Comput. Sci., 2013


  Loading...