全文获取类型
收费全文 | 253篇 |
免费 | 4篇 |
国内免费 | 6篇 |
专业分类
化学 | 4篇 |
力学 | 2篇 |
数学 | 234篇 |
物理学 | 23篇 |
出版年
2023年 | 19篇 |
2022年 | 14篇 |
2021年 | 12篇 |
2020年 | 13篇 |
2019年 | 4篇 |
2018年 | 11篇 |
2017年 | 10篇 |
2016年 | 4篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 33篇 |
2012年 | 16篇 |
2011年 | 16篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 15篇 |
2007年 | 13篇 |
2006年 | 12篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有263条查询结果,搜索用时 203 毫秒
1.
Mathematical Programming - A clutter is k-wise intersecting if every k members have a common element, yet no element belongs to all members. We conjecture that, for some integer $$k\ge 4$$ , every... 相似文献
2.
Mathematical Programming - A Correction to this paper has been published: 10.1007/s10107-020-01587-x 相似文献
3.
Mathematical Programming - Given two matroids $$\mathcal {M}_{1} = (E, \mathcal {B}_{1})$$ and $$\mathcal {M}_{2} = (E, \mathcal {B}_{2})$$ on a common ground set E with base sets $$\mathcal... 相似文献
4.
Criado Francisco Joswig Michael Santos Francisco 《Foundations of Computational Mathematics》2022,22(6):1923-1960
Foundations of Computational Mathematics - In this paper we initiate the study of tropical Voronoi diagrams. We start out with investigating bisectors of finitely many points with respect to... 相似文献
5.
On the critical exponents of generalized ballot sequences in three dimensions and large tandem walks
We answer some questions on the asymptotics of ballot walks raised in [S. B. Ekhad and D. Zeilberger, April 2021] and prove that these models are not D-finite. This short note demonstrates how the powerful tools developed in the last decades on lattice paths in convex cones help us to answer some challenging problems that were out of reach for a long time. On the way we generalize tandem walks to the family of large tandem walks whose steps are of arbitrary length and map them bijectively to a generalization of ballot walks in three dimensions.
相似文献6.
7.
8.
This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation of the natural numbers). We observe, e.g., that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non-periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non-commutative and non-Boolean c.e. ring. 相似文献
9.
《Discrete Mathematics》2022,345(3):112721
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates. 相似文献
10.