首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3948篇
  免费   129篇
  国内免费   58篇
化学   2494篇
晶体学   15篇
力学   133篇
数学   735篇
物理学   758篇
  2024年   4篇
  2023年   28篇
  2022年   104篇
  2021年   116篇
  2020年   102篇
  2019年   117篇
  2018年   112篇
  2017年   92篇
  2016年   159篇
  2015年   124篇
  2014年   144篇
  2013年   264篇
  2012年   292篇
  2011年   296篇
  2010年   194篇
  2009年   162篇
  2008年   259篇
  2007年   219篇
  2006年   259篇
  2005年   235篇
  2004年   183篇
  2003年   137篇
  2002年   122篇
  2001年   60篇
  2000年   43篇
  1999年   47篇
  1998年   28篇
  1997年   24篇
  1996年   25篇
  1995年   22篇
  1994年   27篇
  1993年   10篇
  1992年   16篇
  1991年   17篇
  1990年   6篇
  1989年   5篇
  1988年   4篇
  1986年   3篇
  1985年   7篇
  1984年   6篇
  1983年   8篇
  1982年   5篇
  1981年   6篇
  1980年   7篇
  1979年   5篇
  1976年   4篇
  1911年   3篇
  1888年   2篇
  1887年   3篇
  1885年   3篇
排序方式: 共有4135条查询结果,搜索用时 0 毫秒
71.
72.
73.
74.
The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.  相似文献   
75.
76.
Abstract

Hexafluoroacetone imine easily interacts with compounds (I, R = OMe, OCH2CF2CHF2, NEt2, Ph) in two directions unlike hexafluoroacttone and gives 1,4,2-oxazaphosphepines (II) (pathway I) or 1,3,2-oxszaphosphepines (III) (pathway 2). The compound (II) (R = NEt2) lightly hydrolyzes to yield the salt (IV). The structure of heterocycles II-IV) has been confirmed by X-ray analysis (see fig. I, II, R = OMe; fig. 2, IV). The detail structural peculiarities of the compounds am discussed.  相似文献   
77.
The preparation of partially substituted thiacalix[4]arenes 26 has been accomplished by conducting the reaction of the thiacalixarene 1 with N-(p-nitrophenyl)-α-bromoacetamide in acetone or acetonitrile in the presence of M2CO3 (M = Na, K and Cs). The influence of the reaction conditions (temperature, time, solvent, ratio of the reagents and the nature of the alkali metal carbonate) on regio- and stereoselectivity of this reaction is described.  相似文献   
78.
79.
The sequential addition of CN? or CH3? and electrophiles to three perfluoroalkylfullerenes (PFAFs), Cs‐C70(CF3)8, C1‐C70(CF3)10, and Csp‐C60(CF3)2, was carried out to determine the most reactive individual fullerene C atoms (as opposed to the most reactive C?C bonds, which has previously been studied). Each PFAF reacted with CH3? or CN? to generate metastable PFAF(CN)? or PFAF(CH3)22? species with high regioselectivity (i.e., one or two predominant isomers). They were treated with electrophiles E+ to generate PFAF(CN)(E) or PFAF(CH3)2(E)2 derivatives, also with high regioselectivity (E+=CN+, CH3+, or H+). All of the predominant products, characterized by mass spectrometry and 19F NMR spectroscopy, are new compounds. Some could be purified by HPLC to give single isomers. Two of them, C70(CF3)8(CN)2 and C70(CF3)10(CH3)2(CN)2, were characterized by single‐crystal X‐ray diffraction. DFT calculations were used to propose whether a particular reaction is under kinetic or thermodynamic control.  相似文献   
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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