全文获取类型
收费全文 | 296篇 |
免费 | 18篇 |
国内免费 | 11篇 |
专业分类
化学 | 9篇 |
力学 | 4篇 |
综合类 | 1篇 |
数学 | 287篇 |
物理学 | 24篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 8篇 |
2021年 | 5篇 |
2020年 | 12篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 3篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 18篇 |
2012年 | 8篇 |
2011年 | 12篇 |
2010年 | 17篇 |
2009年 | 17篇 |
2008年 | 24篇 |
2007年 | 12篇 |
2006年 | 23篇 |
2005年 | 9篇 |
2004年 | 16篇 |
2003年 | 11篇 |
2002年 | 16篇 |
2001年 | 8篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有325条查询结果,搜索用时 515 毫秒
1.
It has been close to ten years since the publication of Green's influential survey Finite field models in additive combinatorics [28], in which the author championed the use of high-dimensional vector spaces over finite fields as a toy model for tackling additive problems concerning the integers. The path laid out by Green has proven to be a very successful one to follow. In the present article we survey the highlights of the past decade and outline the challenges for the years to come. 相似文献
2.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
3.
Ihsen Yengui 《Mathematische Nachrichten》2003,260(1):93-99
Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 ⊕ … ⊕ Rm (m ≤ deg f), associated to a fundamental system of idempotents e0, … , em, such that the component of f in each Ri[X] has degree coefficient which is a unit of Ri. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials. 相似文献
4.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
5.
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. 相似文献
6.
《Operations Research Letters》2022,50(2):122-128
The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results. 相似文献
7.
El Houssaine Aghezzaf Thomas L. Magnanti Laurence A. Wolsey 《Mathematical Programming》1995,71(2):113-126
Given a treeG = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the rooted subtree problem, is to find a maximum weight subtree, with a specified root, from a given set of subtrees.The second problem, called the subtree packing problem, is to find a maximum weight packing of node disjoint subtrees chosen from a given set of subtrees, where the value of each subtree may depend on its root.We show that the complexity status of both problems is related, and that the subtree packing problem is polynomial if and only if each rooted subtree problem is polynomial. In addition we show that the convex hulls of the feasible solutions to both problems are related: the convex hull of solutions to the packing problem is given by pasting together the convex hulls of the rooted subtree problems.We examine in detail the case where the set of feasible subtrees rooted at nodei consists of all subtrees with at mostk nodes. For this case we derive valid inequalities, and specify the convex hull whenk 4.Research supported in part by Nato Collaborative Research Grant CRG 900281, Science Program SC1-CT91-620 of the EEC, and contract No 26 of the programme Pôle d'attraction interuniversitaire of the Belgian government. 相似文献
10.
Using the coherent state representation we derive some new operator
identities and study some mathematical relations in combinatorics. The
technique of integral within an ordered product (IWOP) of operators plays an
essential role in realizing our goal. 相似文献