全文获取类型
收费全文 | 2828篇 |
免费 | 143篇 |
国内免费 | 243篇 |
专业分类
化学 | 75篇 |
力学 | 85篇 |
综合类 | 46篇 |
数学 | 2895篇 |
物理学 | 113篇 |
出版年
2023年 | 14篇 |
2022年 | 17篇 |
2021年 | 28篇 |
2020年 | 35篇 |
2019年 | 50篇 |
2018年 | 44篇 |
2017年 | 69篇 |
2016年 | 74篇 |
2015年 | 58篇 |
2014年 | 98篇 |
2013年 | 136篇 |
2012年 | 138篇 |
2011年 | 98篇 |
2010年 | 87篇 |
2009年 | 140篇 |
2008年 | 149篇 |
2007年 | 181篇 |
2006年 | 178篇 |
2005年 | 153篇 |
2004年 | 138篇 |
2003年 | 127篇 |
2002年 | 156篇 |
2001年 | 112篇 |
2000年 | 139篇 |
1999年 | 97篇 |
1998年 | 107篇 |
1997年 | 107篇 |
1996年 | 62篇 |
1995年 | 54篇 |
1994年 | 43篇 |
1993年 | 46篇 |
1992年 | 31篇 |
1991年 | 29篇 |
1990年 | 25篇 |
1989年 | 13篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 15篇 |
1985年 | 19篇 |
1984年 | 15篇 |
1983年 | 4篇 |
1982年 | 15篇 |
1981年 | 15篇 |
1980年 | 13篇 |
1979年 | 9篇 |
1978年 | 12篇 |
1977年 | 12篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1974年 | 6篇 |
排序方式: 共有3214条查询结果,搜索用时 15 毫秒
61.
Victor Alexandrov 《Geometriae Dedicata》2004,107(1):169-186
Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image. 相似文献
62.
We provide a new and short proof for Rockafellar's characterization of maximal monotone operators in reflexive Banach spaces based on S. Fitzpatrick's function and a technique used by R. S. Burachik and B. F. Svaiter for proving their result on the representation of a maximal monotone operator by convex functions.
63.
We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers Vλ⊗N of an irreducible representation Vλ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope. 相似文献
64.
65.
A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval
of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval.
This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system.
Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01.
Research supported by CONACyT of Mexico, Grant 130036.
Research partially supported by CONACyT of Mexico, Grant 44003. 相似文献
66.
The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above. The results are based on restricting the solution set, such that the remaining multi-stage stochastic program is easy to solve. An example where the methods can be applied is presented.Supported in part by NATO Collaborative Research Grant No. 0785/87. 相似文献
67.
S. Park 《Journal of Optimization Theory and Applications》1997,95(2):409-417
From a general minimax inequality or an abstract lopsided saddle-point theorem, we deduce general Karamardian-type equilibrium theorems and generalized complementarity theorems. Our new results extend a number of well-known earlier works of many authors. 相似文献
68.
Contingent epiderivatives and set-valued optimization 总被引:24,自引:0,他引:24
In this paper we introduce the concept of the contingent epiderivative for a set-valued map which modifies a notion introduced by Aubin [2] as upper contingent derivative. It is shown that this kind of a derivative has important properties and is one possible generalization of directional derivatives in the single-valued convex case. For optimization problems with a set-valued objective function optimality conditions based on the concept of the contingent epiderivative are proved which are necessary and sufficient under suitable assumptions. 相似文献
69.
We present a new approach, requiring the solution of a SemiDefinite Program, for decomposing the Hessian of a nonseparable mixed-integer quadratic problem to permit using perspective cuts to improve its continuous relaxation bound. The new method favorably compares with a previously proposed one requiring a minimum eigenvalue computation. 相似文献
70.
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.