受强制性开放获取政策约束的文章 - Gregory Sorkin了解详情
可在其他位置公开访问的文章：6 篇
The satisfiability threshold for k-XORSAT
B Pittel, GB Sorkin
Combinatorics, Probability and Computing 25 (2), 236-268, 2016
强制性开放获取政策： US National Science Foundation
The Ising antiferromagnet and max cut on random regular graphs
A Coja-Oghlan, P Loick, BF Mezei, GB Sorkin
SIAM Journal on Discrete Mathematics 36 (2), 1306-1342, 2022
强制性开放获取政策： German Research Foundation
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
S Gaspers, GB Sorkin
ACM Transactions on Algorithms (TALG) 13 (4), 1-36, 2017
强制性开放获取政策： US National Science Foundation, Australian Research Council
The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights
A Frieze, W Pegden, GB Sorkin
SIAM Journal on Discrete Mathematics 32 (3), 2115-2133, 2018
强制性开放获取政策： US National Science Foundation
Successive minimum spanning trees
S Janson, GB Sorkin
Random Structures & Algorithms 61 (1), 126-172, 2022
强制性开放获取政策： Knut and Alice Wallenberg Foundation
On the distribution of the minimum weight clique
AM Frieze, W Pegden, GB Sorkin
to appear, 2016
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定