全文获取类型
收费全文 | 4003篇 |
免费 | 215篇 |
国内免费 | 139篇 |
专业分类
化学 | 87篇 |
晶体学 | 1篇 |
力学 | 12篇 |
综合类 | 33篇 |
数学 | 4021篇 |
物理学 | 203篇 |
出版年
2024年 | 14篇 |
2023年 | 62篇 |
2022年 | 88篇 |
2021年 | 74篇 |
2020年 | 119篇 |
2019年 | 116篇 |
2018年 | 126篇 |
2017年 | 115篇 |
2016年 | 82篇 |
2015年 | 69篇 |
2014年 | 140篇 |
2013年 | 302篇 |
2012年 | 174篇 |
2011年 | 199篇 |
2010年 | 199篇 |
2009年 | 363篇 |
2008年 | 344篇 |
2007年 | 250篇 |
2006年 | 236篇 |
2005年 | 156篇 |
2004年 | 134篇 |
2003年 | 126篇 |
2002年 | 108篇 |
2001年 | 98篇 |
2000年 | 81篇 |
1999年 | 86篇 |
1998年 | 76篇 |
1997年 | 71篇 |
1996年 | 50篇 |
1995年 | 33篇 |
1994年 | 32篇 |
1993年 | 27篇 |
1992年 | 24篇 |
1991年 | 19篇 |
1990年 | 19篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 10篇 |
1982年 | 14篇 |
1981年 | 8篇 |
1980年 | 15篇 |
1979年 | 4篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有4357条查询结果,搜索用时 734 毫秒
51.
Mitre C. Dourado Fábio Protti Jayme L. Szwarcfiter 《Discrete Applied Mathematics》2007,155(18):2435-2443
Let p?1 and q?0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F′⊆F formed by p or less members has total intersection of cardinality at least q. A family of sets F is (p,q)-Helly when every (p,q)-intersecting subfamily F′⊆F has total intersection of cardinality at least q. A graph G is a (p,q)-clique-Helly graph when its family of (maximal) cliques is (p,q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p=2,q=1. In this work we present a characterization for (p,q)-clique-Helly graphs. For fixed p,q, this characterization leads to a polynomial-time recognition algorithm. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard. 相似文献
52.
The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the
signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also
prove that every non-empty set of integers is the signed degree set of some connected signed graph. 相似文献
53.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
54.
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. 相似文献
55.
Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model. 相似文献
56.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
57.
记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2},本得到:若n阶图G的Ore2≥n 1,则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。 相似文献
58.
凸集的广义Reuleaux三角形 总被引:1,自引:1,他引:0
常宽凸集的面积最小者为Reulaux三角形,而非常宽凸集的面积最小者为何呢?它就是本文将给出的广义Reuleaux三角形△R。 相似文献
59.
60.
The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n˙ Log (n)) execution time, may give an O(n˙n˙ Log (n)) to peel all the set; an O(n˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n˙n) performance. 相似文献