全文获取类型
收费全文 | 7184篇 |
免费 | 600篇 |
国内免费 | 728篇 |
专业分类
化学 | 808篇 |
晶体学 | 17篇 |
力学 | 842篇 |
综合类 | 123篇 |
数学 | 5288篇 |
物理学 | 1434篇 |
出版年
2024年 | 11篇 |
2023年 | 86篇 |
2022年 | 151篇 |
2021年 | 145篇 |
2020年 | 207篇 |
2019年 | 198篇 |
2018年 | 189篇 |
2017年 | 220篇 |
2016年 | 204篇 |
2015年 | 152篇 |
2014年 | 262篇 |
2013年 | 533篇 |
2012年 | 319篇 |
2011年 | 414篇 |
2010年 | 352篇 |
2009年 | 524篇 |
2008年 | 508篇 |
2007年 | 493篇 |
2006年 | 450篇 |
2005年 | 423篇 |
2004年 | 301篇 |
2003年 | 329篇 |
2002年 | 277篇 |
2001年 | 238篇 |
2000年 | 236篇 |
1999年 | 223篇 |
1998年 | 243篇 |
1997年 | 180篇 |
1996年 | 122篇 |
1995年 | 80篇 |
1994年 | 64篇 |
1993年 | 46篇 |
1992年 | 48篇 |
1991年 | 44篇 |
1990年 | 29篇 |
1989年 | 26篇 |
1988年 | 26篇 |
1987年 | 22篇 |
1986年 | 19篇 |
1985年 | 15篇 |
1984年 | 20篇 |
1983年 | 6篇 |
1982年 | 12篇 |
1981年 | 12篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 13篇 |
1977年 | 4篇 |
1974年 | 3篇 |
1972年 | 3篇 |
排序方式: 共有8512条查询结果,搜索用时 15 毫秒
51.
Let E
n:y
2=x
3−n
2
x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups
associated with E
n
to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E
n.
2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90 相似文献
52.
We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel. 相似文献
53.
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. 相似文献
54.
David S. Dummit Brett A. Tangedal Paul B. van Wamelen. 《Mathematics of Computation》2004,73(247):1525-1546
Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.
55.
Bogdan Nita 《General Relativity and Gravitation》2003,35(10):1865-1868
Algebraically special gravitational fields are described using algebraic and differential invariants of the Weyl tensor. A type III invariant is also given and calculated for Robinson-Trautman spaces. 相似文献
56.
57.
介绍未确知数学方法,并用未确知数学方法分析处理物理实验数据,与传统的数据处理方法比较,未确知数学方法不必对数据作任何假设,因此更合理,也更符合实际。 相似文献
58.
Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405. 相似文献
59.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献
60.