全文获取类型
收费全文 | 7745篇 |
免费 | 771篇 |
国内免费 | 668篇 |
专业分类
化学 | 823篇 |
晶体学 | 16篇 |
力学 | 894篇 |
综合类 | 191篇 |
数学 | 5808篇 |
物理学 | 1452篇 |
出版年
2024年 | 11篇 |
2023年 | 80篇 |
2022年 | 166篇 |
2021年 | 218篇 |
2020年 | 225篇 |
2019年 | 206篇 |
2018年 | 187篇 |
2017年 | 270篇 |
2016年 | 294篇 |
2015年 | 195篇 |
2014年 | 371篇 |
2013年 | 550篇 |
2012年 | 385篇 |
2011年 | 464篇 |
2010年 | 409篇 |
2009年 | 587篇 |
2008年 | 521篇 |
2007年 | 508篇 |
2006年 | 464篇 |
2005年 | 435篇 |
2004年 | 327篇 |
2003年 | 331篇 |
2002年 | 282篇 |
2001年 | 205篇 |
2000年 | 214篇 |
1999年 | 182篇 |
1998年 | 222篇 |
1997年 | 150篇 |
1996年 | 130篇 |
1995年 | 74篇 |
1994年 | 65篇 |
1993年 | 52篇 |
1992年 | 66篇 |
1991年 | 43篇 |
1990年 | 29篇 |
1989年 | 32篇 |
1988年 | 30篇 |
1987年 | 20篇 |
1986年 | 21篇 |
1985年 | 34篇 |
1984年 | 28篇 |
1983年 | 14篇 |
1982年 | 17篇 |
1981年 | 16篇 |
1980年 | 15篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1972年 | 3篇 |
排序方式: 共有9184条查询结果,搜索用时 15 毫秒
101.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
102.
研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1 无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2 无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3 无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 . 相似文献
103.
The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model. 相似文献
104.
Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations. 相似文献
105.
利用第一类Chebyshev多项式的性质以及其与Lucas数的关系得到了关于Lucas数立方的一些恒等式. 相似文献
106.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
107.
Frank N. Proske Madan L. Puri 《Proceedings of the American Mathematical Society》2003,131(9):2937-2944
In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.
108.
109.
Chen Yongnian 《模糊系统与数学》1995,(1)
ANTIFUZZYVECTORSPACES(Ⅱ)ChenYongnian(DepartmentofMathematics,XinjiangNormalUniversity,830054,Xinjiang,P.R.China)ANTIFUZZYVECT... 相似文献
110.
Dao-sheng Zheng 《计算数学(英文版)》1998,(2)
1.IntroductionSince1984,severalchinesemathematicianshaveobtailledmanyresultsboutmatrixoperatornormcondition.umbe.[ll'12'18].Twokindsmatrixconditionnllmbers[9]are:(1)IfAECoxsisnonsingular,thellunlberK.(A)~IIAll.llA--'if.iscalledtheor--normconditionnumberof… 相似文献