全文获取类型
收费全文 | 9932篇 |
免费 | 676篇 |
国内免费 | 1324篇 |
专业分类
化学 | 3866篇 |
晶体学 | 45篇 |
力学 | 186篇 |
综合类 | 147篇 |
数学 | 6240篇 |
物理学 | 1448篇 |
出版年
2024年 | 14篇 |
2023年 | 107篇 |
2022年 | 174篇 |
2021年 | 245篇 |
2020年 | 244篇 |
2019年 | 310篇 |
2018年 | 284篇 |
2017年 | 304篇 |
2016年 | 227篇 |
2015年 | 212篇 |
2014年 | 354篇 |
2013年 | 1070篇 |
2012年 | 339篇 |
2011年 | 456篇 |
2010年 | 400篇 |
2009年 | 532篇 |
2008年 | 608篇 |
2007年 | 772篇 |
2006年 | 597篇 |
2005年 | 548篇 |
2004年 | 482篇 |
2003年 | 508篇 |
2002年 | 447篇 |
2001年 | 370篇 |
2000年 | 350篇 |
1999年 | 329篇 |
1998年 | 307篇 |
1997年 | 275篇 |
1996年 | 197篇 |
1995年 | 121篇 |
1994年 | 133篇 |
1993年 | 87篇 |
1992年 | 87篇 |
1991年 | 59篇 |
1990年 | 46篇 |
1989年 | 44篇 |
1988年 | 44篇 |
1987年 | 44篇 |
1986年 | 25篇 |
1985年 | 43篇 |
1984年 | 23篇 |
1983年 | 16篇 |
1982年 | 20篇 |
1981年 | 19篇 |
1980年 | 10篇 |
1979年 | 7篇 |
1978年 | 12篇 |
1977年 | 12篇 |
1976年 | 4篇 |
1936年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 312 毫秒
101.
介绍了19世纪存在于澳大利亚土著中的一种婚姻形式—级别婚,从群论的角度说明级别婚的三种主要形式都对应于一个对称群,从而可以用几何方法形象的表示这种婚姻形式;进而,从对称的观点说明婚姻形式从简单到复杂的演化过程,代数上对应于对称群阶数的增加,几何上则对应于对称性的加强. 相似文献
102.
103.
A subgroup if of a group G is called semipermutable if it is permutable with every subgroup K of G with (|H|, |K|) - 1, and s-semipermutable if it is permutable with every Sylow p-subgroup of G with (p, |H|) = 1. In this paper, some sufficient conditions for a group to be solvable are obtained in terms of s-semipermutability. 相似文献
104.
Vasiliy A. Ustimenko 《Acta Appl Math》2002,74(2):117-153
A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques. 相似文献
105.
XU Yichao CHEN Minru & MA Songya Academy of Mathematics Systems Science Chinese Academy of Sciences Beijing China College of Mathematics Information Sciences Henan University Kaifeng China 《中国科学A辑(英文版)》2006,49(10):1392-1404
We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G. 相似文献
106.
We prove that the coinvariant ring of the irreducible Coxeter group of type H4 has the strong Lefschetz property. 相似文献
107.
Piotr W. Nowak 《Journal of Functional Analysis》2007,243(1):323-344
We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory. 相似文献
108.
Automorphisms of groups acting faithfully on rooted trees are studied. We find conditions under which every automorphism of such a group is induced by a conjugation from the full automorphism group of the rooted tree. These results are applied to known examples such as Grigorchuk groups, Gupta–Sidki group, etc. 相似文献
109.
P. G. Hjorth S. L. Kokkendorff S. Markvorsen 《Proceedings of the American Mathematical Society》2002,130(1):175-181
We study finite metric spaces with elements picked from, and distances consistent with, ambient Riemannian manifolds. The concepts of negative type and strictly negative type are reviewed, and the conjecture that hyperbolic spaces are of strictly negative type is settled, in the affirmative. The technique of the proof is subsequently applied to show that every compact manifold of negative type must have trivial fundamental group, and to obtain a necessary criterion for product manifolds to be of negative type.
110.
An asymptotic formula is obtained for the number of representations of an element of a finite field as a weighted sum of two prescribed powers of primitive elements. This generalises previous work on sums of primitive elements, including that relating to some conjectures of Golomb. 相似文献