全文获取类型
收费全文 | 1678篇 |
免费 | 34篇 |
国内免费 | 6篇 |
专业分类
化学 | 107篇 |
力学 | 7篇 |
综合类 | 2篇 |
数学 | 1339篇 |
物理学 | 263篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 3篇 |
2021年 | 9篇 |
2020年 | 4篇 |
2019年 | 27篇 |
2018年 | 22篇 |
2017年 | 17篇 |
2016年 | 9篇 |
2015年 | 10篇 |
2014年 | 21篇 |
2013年 | 113篇 |
2012年 | 131篇 |
2011年 | 105篇 |
2010年 | 103篇 |
2009年 | 116篇 |
2008年 | 129篇 |
2007年 | 125篇 |
2006年 | 87篇 |
2005年 | 57篇 |
2004年 | 21篇 |
2003年 | 42篇 |
2002年 | 49篇 |
2001年 | 55篇 |
2000年 | 64篇 |
1999年 | 79篇 |
1998年 | 52篇 |
1997年 | 14篇 |
1996年 | 28篇 |
1995年 | 31篇 |
1994年 | 39篇 |
1993年 | 21篇 |
1992年 | 18篇 |
1991年 | 8篇 |
1990年 | 15篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有1718条查询结果,搜索用时 437 毫秒
21.
Henrik Stetkaer 《Aequationes Mathematicae》1995,49(1):252-275
We study properties of solutionsf, g, h C(G) of the functional equation
相似文献
22.
In this paper, we prove the first approximate max-flow min-cut theorem for undirected multicommodity flow. We show that for a feasible flow to exist in a multicommodity problem, it is sufficient that every cut's capacity exceeds its demand by a factor ofO(logClogD), whereC is the sum of all finite capacities andD is the sum of demands. Moreover, our theorem yields an algorithm for finding a cut that is approximately minimumrelative to the flow that must cross it. We use this result to obtain an approximation algorithm for T. C. Hu's generalization of the multiway-cut problem. This algorithm can in turn be applied to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF formula, via minimization, and other problems. We also generalize the theorem to hypergraph networks; using this generalization, we can handle CNF clauses with an arbitrary number of literals per clause.Most of the results in this paper were presented in preliminary form in Approximation through multicommodity flow,Proceedings, 31th Annual Symposium on Foundations of Computer Science (1990), pp. 726–737.Research supported by the National Science Foundation under NSF grant CDA 8722809, by the Office of Naval and the Defense Advanced Research Projects Agency under contract N00014-83-K-0146, and ARPA Order No. 6320, Amendament 1.Research supported by NSF grant CCR-9012357 and by an NSF Presidential Young Investigator Award. 相似文献
23.
Oliver Pretzel 《Order》1995,12(2):135-147
We prove generalizations to chain groups, of Minty's Arc Colouring Lemma and its extension, the well-known Farkas Lemma. In these the orientation of the edges is replaced by an arbitrary chain.A function on a chain groupN isrepresentable if there exists a chainR such that (X)=R·X for allXN. Anorientation is a chain with values ±1. We prove that for a regular chain group a linear function that is representable by an orientation for each chainXN locally, is representable by an orientation globally. 相似文献
24.
Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399). 相似文献
25.
Florian A. Potra 《Mathematical Programming》1994,67(1-3):383-406
A predictor—corrector method for solving linear programs from infeasible starting points is analyzed. The method is quadratically convergent and can be combined with Ye's finite termination scheme under very general assumptions. If the starting points are large enough then the algorithm hasO(nL) iteration complexity. If the ratio between feasibility and optimality at the starting points is small enough then the algorithm has O(
) iteration complexity. For feasible starting points the algorithm reduces to the Mizuno—Todd—Ye predictor—corrector method.This work was supported by an interdisciplinary research grant from the Institute for Advanced Studies of the University of Iowa. 相似文献
26.
LetX be a real normed linear space,f, f
n, n , be extended real-valued proper closed convex functions onX. A sequence {x
n} inX is called diagonally stationary for {f
n} if for alln there existsx*
n f
n (x
n) such that x*
n * 0. Such sequences arise in approximation methods for the problem of minimizingf. Some general convergence results based upon variational convergence theory and appropriate equi-well-posedness are presented. 相似文献
27.
John A. Baker 《Aequationes Mathematicae》1996,52(1):302-312
Summary In a recent communication to J. Aczél, R. Duncan Luce asked about the functional equationU(x)U(G(x)F(y)) = U(G(x))U(xy) forx, y > 0, (1) which has arisen in his research on certainty equivalents of gambles. He was particularly interested in cases in which the unknowns (U, F andG) are strictly increasing functions from (0, + ) into (0, + ). In this paper we solve (1) in the case whereU, F andG are continuously differentiable with everywhere positive first derivatives. Our solution is perhaps novel in that in certain cases (1) reduces to a functional equation in a single variable and in other cases to a functional equation in several variables; see [1] for the terminology. 相似文献
28.
Set-valued mappings from a topological space into subsets of a Banach space which satisfy a restricted form of weak upper semi-continuity, have particularly noteworthy properties. We establish a selection theorem for certain set-valued mappings from a (-) unfavourable topological space into subsets of a Banach space and as a consequence derive the property that restricted weak upper semi-continuous set-valued mappings which satisfy a minimality condition, from a (-) unfavourable topological space into subsets of a Banach space are single-valued and norm upper semi-continuous at the points of a residual subset of their domain. 相似文献
29.
Originating from work in operations research the cutting plane refutation systemCP is an extension of resolution, where unsatisfiable propositional logic formulas in conjunctive normal form are recognized by showing the non-existence of boolean solutions to associated families of linear inequalities. Polynomial sizeCP proofs are given for the undirecteds-t connectivity principle. The subsystemsCP
q ofCP, forq2, are shown to be polynomially equivalent toCP, thus answering problem 19 from the list of open problems of [8]. We present a normal form theorem forCP
2-proofs and thereby for arbitraryCP-proofs. As a corollary, we show that the coefficients and constant terms in arbitrary cutting plane proofs may be exponentially bounded by the number of steps in the proof, at the cost of an at most polynomial increase in the number of steps in the proof. The extensionCPLE
+, introduced in [9] and there shown top-simulate Frege systems, is proved to be polynomially equivalent to Frege systems. Lastly, since linear inequalities are related to threshold gates, we introduce a new threshold logic and prove a completeness theorem.Supported in part by NSF grant DMS-9205181 and by US-Czech Science and Technology Grant 93-205Partially supported by NSF grant CCR-9102896 and by US-Czech Science and Technology Grant 93-205 相似文献
30.
Fractionally colouring total graphs 总被引:3,自引:0,他引:3
Bchzad and Vizing have conjectured that given any simple graph of maximum degree , one can colour its edges and vertices with +2 colours so that no two adjacent vertices, or two incident edges, or an edge and either of its ends receive the same colour. We show that for any simple graphG, V(G)E(G) can be fractionally coloured with +2 colours. 相似文献
|