全文获取类型
收费全文 | 25857篇 |
免费 | 614篇 |
国内免费 | 161篇 |
专业分类
化学 | 15671篇 |
晶体学 | 199篇 |
力学 | 820篇 |
综合类 | 1篇 |
数学 | 3857篇 |
物理学 | 6084篇 |
出版年
2023年 | 146篇 |
2022年 | 220篇 |
2021年 | 309篇 |
2020年 | 376篇 |
2019年 | 366篇 |
2018年 | 279篇 |
2017年 | 261篇 |
2016年 | 593篇 |
2015年 | 506篇 |
2014年 | 582篇 |
2013年 | 1163篇 |
2012年 | 1188篇 |
2011年 | 1390篇 |
2010年 | 879篇 |
2009年 | 772篇 |
2008年 | 1220篇 |
2007年 | 1302篇 |
2006年 | 1182篇 |
2005年 | 1224篇 |
2004年 | 1024篇 |
2003年 | 809篇 |
2002年 | 755篇 |
2001年 | 604篇 |
2000年 | 552篇 |
1999年 | 344篇 |
1998年 | 300篇 |
1997年 | 307篇 |
1996年 | 376篇 |
1995年 | 336篇 |
1994年 | 313篇 |
1993年 | 372篇 |
1992年 | 347篇 |
1991年 | 321篇 |
1990年 | 265篇 |
1989年 | 256篇 |
1988年 | 268篇 |
1987年 | 258篇 |
1986年 | 227篇 |
1985年 | 321篇 |
1984年 | 310篇 |
1983年 | 242篇 |
1982年 | 268篇 |
1981年 | 245篇 |
1980年 | 242篇 |
1979年 | 239篇 |
1978年 | 246篇 |
1977年 | 179篇 |
1976年 | 198篇 |
1975年 | 169篇 |
1974年 | 189篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
We prove lower bounds of the form exp(nε d), εd > 0, on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d, for any constant d. This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known. 相似文献
92.
A modified expansion-shock tube for nucleation and condensation studies in a supersaturated vapour is described. An analysis is made of the gas-dynamical properties of the new tube configuration and numerical simulations with the Random Choice Method are compared with experiments. It is shown that with the modified configuration one single nucleation pulse can be realized. 相似文献
93.
94.
95.
We prove a general embedding theorem for Sobolev spaces on open manifolds of bounded geometry and infer from this the module structure theorem. Thereafter we apply this to weighted Sobolev spaces. 相似文献
96.
Jan Kraí
ek 《Mathematical Logic Quarterly》1998,44(4):450-458
We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game (cf. [3]) and of real communication complexity, and relate this complexity to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (defined in [4, Definition 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation theorems for prepositional logic (by a problem posed in [5, Section 8], in particular). Our main objective is to extend the communication complexity approach of [4, 5] to a wider class of proof systems. In this direction we obtain an effective interpolation in a form of a protocol of small real communication complexity. Together with the above mentioned lower bound for tree-like protocols this yields as a corollary a lower bound on the number of steps for particular semantic derivations of Hall's theorem (these include tree-like cutting planes proofs for which an exponential lower bound was demonstrated in [2]). 相似文献
97.
This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families. 相似文献
98.
99.
Marek Pękała Jan Mucha Benedicte Vertruyen Rudi Cloots Marcel Ausloos 《Journal of magnetism and magnetic materials》2006
Samples of La0.7Ca0.3Mn1−xGaxO3 with x=0, 0.025, 0.05 and 0.10 were prepared by standard solid-state reaction. They were first characterized chemically, including the microstructure. The magnetic properties and various transport properties, i.e. the electrical resistivity, magnetoresistivity (for a field below 8 T), thermoelectric power and thermal conductivity measured each time on the same sample, are reported. The markedly different behaviour of the x=0.1 sample from those with a smaller Ga content, is discussed. The dilution of the Mn3+/Mn4+ interactions with Ga doping considerably reduces the ferromagnetic double exchange interaction within the manganese lattice leading to a decrease of the Curie temperature. The polaron binding energy varies from 224 to 243 meV with increased Ga doping. 相似文献
100.
Jan Krrman 《Random Structures and Algorithms》1994,5(1):95-98
In the theory of random graphs, several classes of graphs occur that are exceptional cases in limit theorems for subgraph counts. The purpose of this article is to show the existence of graphs in one of these classes, by providing an explicit, computer generated, example. We also show that the class is closed under complementation. © 1994 John Wiley & Sons, Inc. 相似文献