全文获取类型
收费全文 | 6929篇 |
免费 | 503篇 |
国内免费 | 585篇 |
专业分类
化学 | 623篇 |
晶体学 | 3篇 |
力学 | 95篇 |
综合类 | 167篇 |
数学 | 6736篇 |
物理学 | 393篇 |
出版年
2024年 | 16篇 |
2023年 | 127篇 |
2022年 | 159篇 |
2021年 | 153篇 |
2020年 | 231篇 |
2019年 | 255篇 |
2018年 | 249篇 |
2017年 | 252篇 |
2016年 | 166篇 |
2015年 | 132篇 |
2014年 | 229篇 |
2013年 | 631篇 |
2012年 | 271篇 |
2011年 | 367篇 |
2010年 | 373篇 |
2009年 | 528篇 |
2008年 | 493篇 |
2007年 | 381篇 |
2006年 | 415篇 |
2005年 | 312篇 |
2004年 | 290篇 |
2003年 | 264篇 |
2002年 | 259篇 |
2001年 | 222篇 |
2000年 | 219篇 |
1999年 | 206篇 |
1998年 | 164篇 |
1997年 | 120篇 |
1996年 | 94篇 |
1995年 | 80篇 |
1994年 | 65篇 |
1993年 | 38篇 |
1992年 | 37篇 |
1991年 | 30篇 |
1990年 | 19篇 |
1989年 | 27篇 |
1988年 | 21篇 |
1987年 | 12篇 |
1986年 | 8篇 |
1985年 | 24篇 |
1984年 | 17篇 |
1983年 | 5篇 |
1982年 | 18篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1975年 | 6篇 |
1974年 | 2篇 |
排序方式: 共有8017条查询结果,搜索用时 187 毫秒
91.
92.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
93.
为改进Fuzzy HX环的结果,使之包含Fuzzy商环,提出了弱Fuzzy HX环的概念,研究了它的性质与结构,并重新讨论了拟Fuzzy商环,证明了在正则条件下拟Fuzzy商环与弱Fuzzy HX环的统一性:同时也得到了一致弱Fuzzy HX环与普通Fuzzy商环的关系。 相似文献
94.
Gerhard Lischke 《Mathematical Logic Quarterly》2006,52(1):20-28
Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
95.
96.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
97.
Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C4 as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order. 相似文献
98.
It was shown by G. A. Jones and the first author in [8] that underlying any map on a compact orientable surface S there is a natural complex structure making S into a Riemann surface. In this paper we consider regular maps and enquire about the Weierstrass points on the underlying Riemann surface. We are particularly interested to know when these are geometric, i.e. whether they lie at vertices, face-centres or edge-centres of the map. 相似文献
99.
关于RNP和SCS的若干等价条件 总被引:1,自引:0,他引:1
使用切片方法,讨论了Banach空间中有界闭凸子集的RNP和SCS的若干等价条件. 相似文献
100.
We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam. 相似文献