全文获取类型
收费全文 | 962篇 |
免费 | 64篇 |
国内免费 | 126篇 |
专业分类
化学 | 6篇 |
力学 | 2篇 |
综合类 | 11篇 |
数学 | 1079篇 |
物理学 | 54篇 |
出版年
2024年 | 6篇 |
2023年 | 24篇 |
2022年 | 29篇 |
2021年 | 17篇 |
2020年 | 50篇 |
2019年 | 33篇 |
2018年 | 42篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 27篇 |
2014年 | 25篇 |
2013年 | 109篇 |
2012年 | 27篇 |
2011年 | 50篇 |
2010年 | 41篇 |
2009年 | 60篇 |
2008年 | 86篇 |
2007年 | 53篇 |
2006年 | 55篇 |
2005年 | 49篇 |
2004年 | 29篇 |
2003年 | 45篇 |
2002年 | 46篇 |
2001年 | 37篇 |
2000年 | 23篇 |
1999年 | 42篇 |
1998年 | 37篇 |
1997年 | 21篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1152条查询结果,搜索用时 15 毫秒
91.
David McKinnon 《Proceedings of the American Mathematical Society》2003,131(1):1-12
In this paper, we prove Vojta's Main Conjecture for split blowups of products of certain elliptic curves with themselves. We then deduce from the conjecture bounds on the average number of rational points lying on curves on these surfaces, and expound upon this connection for abelian surfaces and rational surfaces.
92.
Crossing by lines all edges of a line arrangement 总被引:1,自引:0,他引:1
93.
Rzvan Licanu 《Expositiones Mathematicae》2007,25(1):37-51
This paper is devoted to the statement known as the Bogomolov conjecture on small points. We present the outline of Zhang's proof of the generalized version of the conjecture. An explicit bound for the height of a non-torsion variety of an abelian variety is obtained in the frame of Arakelov theory. Some further developments are mentioned. 相似文献
94.
Xuding Zhu 《Discrete Mathematics》1998,190(1-3):215-222
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: for any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let Mn = min[rc(G): χ(G) = n]. It was conjectured by Burr et al. (1976) that Mn = (n − 1)2 + 1. This conjecture has been confirmed previously for n 4. In this paper, we shall prove that the conjecture is true for n = 5. We shall also improve the upper bounds for M6 and M7. 相似文献
95.
S. M. Natanzon 《Functional Analysis and Its Applications》2003,37(1):21-31
We derive formulas making it possible to calculate the Taylor expansion coefficients of the string solution for the Gelfand–Dikii hierarchy. According to the Witten conjecture, these coefficients coincide with the Mumford–Morita–Miller intersection numbers (correlators) of stable cohomology classes for the moduli space of n-spin bundles on Riemann surfaces with punctures. 相似文献
96.
Based on the eigensystem {λj,φj}of -Δ, the multiple solutions for nonlinear problem Δu f(u) =0 in Ω, u=0 on Ω are approximated. A new search-extension method (SEM), which consists of three steps in three level subspaces, is proposed. Numerical simulations for several typical nonlinear cases, i.e. f(u) = u~3,u~2(u-p),u~2(u~2 -p), 相似文献
97.
Andreas Rosenschon 《Topology》2005,44(6):1159-1179
We solve the homotopy limit problem for two-primary algebraic K-theory of fields, that is, the Quillen-Lichtenbaum conjecture at the prime 2. 相似文献
98.
Başak Karpuz 《Journal of Difference Equations and Applications》2017,23(12):1929-1942
We consider difference equations with a single delay term and obtain sufficient conditions for both oscillation and nonoscillation. Moreover, our nonoscillation theorem improves the affirmative answer to Ladas’ corrected conjecture given by Tang and Yu in [Comput. Math. Appl. 38(11–12) (1999), pp. 229–237]. We also present a detailed discussion with examples to emphasize the significance and the sharpness of the new results. 相似文献
99.
本文利用Luthar-Passi方法,研究了五次交错群A_5与六阶二面体群D_6直积的整群环的挠单位,得到了该群的Zassenhaus猜想成立. 相似文献
100.
Tutte's 5‐flow conjecture from 1954 states that every bridgeless graph has a nowhere‐zero 5‐flow. It suffices to prove the conjecture for cyclically 6‐edge‐connected cubic graphs. We prove that every cyclically 6‐edge‐connected cubic graph with oddness at most 4 has a nowhere‐zero 5‐flow. This implies that every minimum counterexample to the 5‐flow conjecture has oddness at least 6. 相似文献