全文获取类型
收费全文 | 793篇 |
免费 | 31篇 |
国内免费 | 78篇 |
专业分类
化学 | 19篇 |
力学 | 1篇 |
综合类 | 8篇 |
数学 | 808篇 |
物理学 | 66篇 |
出版年
2024年 | 3篇 |
2023年 | 15篇 |
2022年 | 27篇 |
2021年 | 19篇 |
2020年 | 27篇 |
2019年 | 20篇 |
2018年 | 34篇 |
2017年 | 16篇 |
2016年 | 6篇 |
2015年 | 14篇 |
2014年 | 18篇 |
2013年 | 103篇 |
2012年 | 13篇 |
2011年 | 24篇 |
2010年 | 22篇 |
2009年 | 49篇 |
2008年 | 48篇 |
2007年 | 39篇 |
2006年 | 40篇 |
2005年 | 39篇 |
2004年 | 44篇 |
2003年 | 46篇 |
2002年 | 41篇 |
2001年 | 46篇 |
2000年 | 36篇 |
1999年 | 25篇 |
1998年 | 24篇 |
1997年 | 24篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 6篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有902条查询结果,搜索用时 15 毫秒
1.
2.
3.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献
4.
5.
We characterise the abelianisation of a group that has a presentation for which the set of relations is invariant under the full symmetric group acting on the set of generators. This improves a result of Emerson.
6.
The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and
Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application
of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder
metric (see §5). 相似文献
7.
Using a combinatorial approach that avoids geometry, this paper studies the structure of KT(G/B), the T-equivariant K-theory of the generalized flag variety G/B. This ring has a natural basis
(the double Grothendieck polynomials), where
is the structure sheaf of the Schubert variety Xw. For rank two cases we compute the corresponding structure constants of the ring KT(G/B) and, based on this data, make a positivity conjecture for general G which generalizes the theorems of M. Brion (for K(G/B)) and W. Graham (for HT*(G/B)). Let [Xλ]KT(G/B) be the class of the homogeneous line bundle on G/B corresponding to the character of T indexed by λ. For general G we prove “Pieri–Chevalley formulas” for the products
,
,
, and
, where λ is dominant. By using the Chern character and comparing lowest degree terms the products which are computed in this paper also give results for the Grothendieck polynomials, double Schubert polynomials, and ordinary Schubert polynomials in, respectively K(G/B), HT*(G/B) and H*(G/B). 相似文献
8.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
9.
Balázs Szegedy 《Journal of Combinatorial Theory, Series A》2007,114(1):20-34
We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many cosets we need, if we want to cover all but one element of an Abelian group. This result is a group theoretical extension of the theorem of Brouwer, Jamison and Schrijver about the blocking number of an affine space. We show that these covering problems are closely related to combinatorial problems, including the so-called additive basis conjecture, the three-flow conjecture, and a conjecture of Alon, Jaeger and Tarsi about nowhere zero vectors. 相似文献
10.