Author： Gelman Andrew
Publisher： Taylor & Francis Ltd
ISSN： 1061-8600
Source： Journal of Computational and Graphical Statistics, Vol.20, Iss.1, 2011-01, pp. : 3-7
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The weak □* is really weaker than the full □
The Journal of Symbolic Logic, Vol. 51, Iss. 4, 1986-12 ,pp. :
Access to resources
Recommend
Graphs with fourth Laplacian eigenvalue less than two
By Zhang X.-D.
European Journal of Combinatorics, Vol. 24, Iss. 6, 2003-08 ,pp. :
Reachability is harder for directed than for undirected finite graphs
The Journal of Symbolic Logic, Vol. 55, Iss. 1, 1990-03 ,pp. :
European Journal of Combinatorics, Vol. 21, Iss. 4, 2000-05 ,pp. :