首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3970篇
  免费   211篇
  国内免费   97篇
数理化   4278篇
  2023年   57篇
  2022年   70篇
  2021年   124篇
  2020年   150篇
  2019年   130篇
  2018年   127篇
  2017年   98篇
  2016年   171篇
  2015年   135篇
  2014年   163篇
  2013年   335篇
  2012年   271篇
  2011年   296篇
  2010年   183篇
  2009年   172篇
  2008年   256篇
  2007年   221篇
  2006年   192篇
  2005年   193篇
  2004年   148篇
  2003年   132篇
  2002年   114篇
  2001年   73篇
  2000年   40篇
  1999年   50篇
  1998年   38篇
  1997年   34篇
  1996年   21篇
  1995年   33篇
  1994年   22篇
  1993年   17篇
  1992年   13篇
  1991年   13篇
  1990年   13篇
  1989年   12篇
  1988年   9篇
  1987年   10篇
  1986年   16篇
  1985年   12篇
  1984年   14篇
  1983年   21篇
  1982年   13篇
  1981年   15篇
  1980年   5篇
  1979年   6篇
  1977年   5篇
  1975年   5篇
  1974年   3篇
  1973年   5篇
  1967年   3篇
排序方式: 共有4278条查询结果,搜索用时 31 毫秒
21.
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  相似文献   
22.
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  相似文献   
23.
A new concept of orthogonality in real normed linear spaces is introduced. Typical properties of orthogonality (homogeneity, symmetry, additivity, ...) and relations between this orthogonality and other known orthogonalities (Birkhoff, Boussouis, Unitary-Boussouis and Diminnie) are studied. In particular, some characterizations of inner product spaces are obtained.  相似文献   
24.
The nonlocal initial problem for nonlinear nonautonomous evolution equati-ons in a Banach space is considered. It is assumed that the nonlinearities havethe local Lipschitz properties. The existence and uniqueness of mild solutionsare proved. Applications to integro-differential equations are discussed.The main tool in the paper is the normalizing mapping (the generalizednorm).  相似文献   
25.
 We show that a.s. all of the connected components of the Wired Spanning Forest are recurrent, proving a conjecture of Benjamini, Lyons, Peres and Schramm. Our analysis relies on a simple martingale involving the effective conductance between the endpoints of an edge in a uniform spanning tree. We believe that this martingale is of independent interest and will find further applications in the study of uniform spanning trees and forests. Received: 20 April 2001 / Revised version: 23 July 2002 / Published online: 14 November  相似文献   
26.
This paper describes the enantioselective hydrogenation of vinylthioethers. We show that thioether derivatives of maleic esters can be hydrogenated with full conversion and up to 60% ee, and that α-thioether cinnamic acids can be hydrogenated in 51% ee with modest conversion.  相似文献   
27.
28.
29.
30.
A new class of chiral dienophiles, 5-alkoxy-2(5H)-furanones, has been developed. Both enantiomers of 5-menthyloxy-2(5H)-ftiranone are readily available in enantiomerically pure form, starting from furfural and d- or l-menthol. Excellent diastereoselectivities (d.e. β99%) are obtained in thermal Diels-Alder reactions with several cyclic and acyclic dienes. The use of silyl dienol ethers has resulted in new routes to enantiomerically pure cyclohexanones in a highly regioselective manner.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号