全文获取类型
收费全文 | 5842篇 |
免费 | 243篇 |
国内免费 | 111篇 |
专业分类
化学 | 3699篇 |
晶体学 | 65篇 |
力学 | 237篇 |
综合类 | 6篇 |
数学 | 1165篇 |
物理学 | 1024篇 |
出版年
2023年 | 59篇 |
2022年 | 76篇 |
2021年 | 129篇 |
2020年 | 154篇 |
2019年 | 126篇 |
2018年 | 137篇 |
2017年 | 91篇 |
2016年 | 184篇 |
2015年 | 143篇 |
2014年 | 178篇 |
2013年 | 381篇 |
2012年 | 329篇 |
2011年 | 404篇 |
2010年 | 237篇 |
2009年 | 224篇 |
2008年 | 329篇 |
2007年 | 319篇 |
2006年 | 311篇 |
2005年 | 323篇 |
2004年 | 260篇 |
2003年 | 230篇 |
2002年 | 212篇 |
2001年 | 115篇 |
2000年 | 69篇 |
1999年 | 61篇 |
1998年 | 55篇 |
1997年 | 58篇 |
1996年 | 63篇 |
1995年 | 53篇 |
1994年 | 40篇 |
1993年 | 50篇 |
1992年 | 35篇 |
1991年 | 34篇 |
1989年 | 26篇 |
1988年 | 33篇 |
1987年 | 26篇 |
1986年 | 27篇 |
1985年 | 46篇 |
1984年 | 38篇 |
1983年 | 39篇 |
1982年 | 49篇 |
1981年 | 56篇 |
1980年 | 42篇 |
1979年 | 32篇 |
1978年 | 29篇 |
1977年 | 29篇 |
1976年 | 31篇 |
1975年 | 26篇 |
1974年 | 29篇 |
1973年 | 34篇 |
排序方式: 共有6196条查询结果,搜索用时 15 毫秒
21.
22.
23.
Ben Craps Matthias R. Gaberdiel Jeffrey A. Harvey 《Communications in Mathematical Physics》2003,234(2):229-251
We study D-branes in the bosonic closed string theory whose automorphism group is the Bimonster group (the wreath product
of the Monster simple group with ℤ2). We give a complete classification of D-branes preserving the chiral subalgebra of Monster invariants and show that they
transform in a representation of the Bimonster. Our results apply more generally to self-dual conformal field theories which
admit the action of a compact Lie group on both the left- and right-moving sectors.
Received: 20 February 2002 / Accepted: 17 August 2002 Published online: 19 December 2002
Communicated by R.H. Dijkgraaf 相似文献
24.
We prove some basic properties of Donaldson’s flow of surfaces in a hyperkähler 4-manifold. When the initial submanifold is symplectic with respect to one Kähler form and Lagrangian with respect to another, we show that certain kinds of singularities cannot form, and we prove a convergence result under a condition related to one considered by M.-T. Wang for the mean curvature flow. 相似文献
25.
26.
27.
28.
We continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials (which are a special case of tensor codes). Combining these two results gives us a generic construction of codes of inverse polynomial rate that are testable with poly‐logarithmically many queries. We note that these locally testable tensor codes can be obtained from any linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006 相似文献
29.
30.
Ben J. Morris 《Random Structures and Algorithms》2002,21(2):135-146
We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums ri and the column sums cj satisfy ri = Ω(n3/2m log m), and cj = Ω(m3/2n log n). This algorithm is based on a reduction to continuous sampling from a convex set. The same approach was taken by Dyer, Kannan, and Mount in previous work. However, the algorithm we present is simpler and has weaker requirements on the row and column sums. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 135–146, 2002 相似文献