全文获取类型
收费全文 | 6671篇 |
免费 | 610篇 |
国内免费 | 430篇 |
专业分类
化学 | 491篇 |
晶体学 | 17篇 |
力学 | 142篇 |
综合类 | 146篇 |
数学 | 6206篇 |
物理学 | 709篇 |
出版年
2024年 | 31篇 |
2023年 | 120篇 |
2022年 | 200篇 |
2021年 | 161篇 |
2020年 | 229篇 |
2019年 | 262篇 |
2018年 | 253篇 |
2017年 | 239篇 |
2016年 | 158篇 |
2015年 | 136篇 |
2014年 | 240篇 |
2013年 | 615篇 |
2012年 | 261篇 |
2011年 | 371篇 |
2010年 | 378篇 |
2009年 | 545篇 |
2008年 | 495篇 |
2007年 | 374篇 |
2006年 | 387篇 |
2005年 | 294篇 |
2004年 | 252篇 |
2003年 | 244篇 |
2002年 | 210篇 |
2001年 | 186篇 |
2000年 | 178篇 |
1999年 | 180篇 |
1998年 | 160篇 |
1997年 | 115篇 |
1996年 | 64篇 |
1995年 | 68篇 |
1994年 | 57篇 |
1993年 | 42篇 |
1992年 | 36篇 |
1991年 | 25篇 |
1990年 | 17篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 18篇 |
1984年 | 15篇 |
1983年 | 3篇 |
1982年 | 13篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 4篇 |
1974年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有7711条查询结果,搜索用时 15 毫秒
241.
The book-embedding problem arises in several area, such as very large scale integration (VLSI) design and routing multilayer printed circuit boards (PCBs). It can be used into various practical application fields. A book embedding of a graph G is an embedding of its vertices along the spine of a book, and an embedding of its edges to the pages such that edges embedded on the same page do not intersect. The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G. It is an important measure of the quality for book-embedding. It is NP-hard to research the pagenumber of book-embedding for a graph G. This paper summarizes the studies on the book-embedding of planar graphs in recent years. 相似文献
242.
243.
Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017 相似文献
244.
245.
246.
247.
In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph). Moreover, we investigate the determination of the orders of the elements of a finite group from its directed (resp. undirected) reduced power graph. Consequently, we show that some classes of finite groups are recognizable from their undirected reduced power graphs. Also, we study the relationship between the isomorphism classes of groups corresponding to the equivalence relations induced by the isomorphism of each of these graphs on the set of all finite groups. 相似文献
248.
It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary. 相似文献
249.
A dominating set in a graph G is a connected dominating set of G if it induces a connected subgraph of G. The connected domatic number of G is the maximum number of pairwise disjoint, connected dominating sets in V(G). We establish a sharp lower bound on the number of edges in a connected graph with a given order and given connected domatic number. We also show that a planar graph has connected domatic number at most 4 and give a characterization of planar graphs having connected domatic number 3. 相似文献
250.
王丽 《数学的实践与认识》2012,42(1):234-241
称一个有限简单无向图X是半对称图,如果图X是正则的且边传递但非点传递.主要利用仿射几何构造了一类2p~n阶连通p~3。度的半对称图的无限族,其中p≥n≥8. 相似文献