全文获取类型
收费全文 | 444篇 |
免费 | 15篇 |
国内免费 | 93篇 |
专业分类
化学 | 32篇 |
晶体学 | 4篇 |
力学 | 8篇 |
综合类 | 14篇 |
数学 | 476篇 |
物理学 | 18篇 |
出版年
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 15篇 |
2013年 | 28篇 |
2012年 | 13篇 |
2011年 | 19篇 |
2010年 | 17篇 |
2009年 | 23篇 |
2008年 | 40篇 |
2007年 | 36篇 |
2006年 | 41篇 |
2005年 | 25篇 |
2004年 | 32篇 |
2003年 | 31篇 |
2002年 | 24篇 |
2001年 | 21篇 |
2000年 | 14篇 |
1999年 | 21篇 |
1998年 | 20篇 |
1997年 | 22篇 |
1996年 | 14篇 |
1995年 | 2篇 |
1994年 | 11篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1985年 | 5篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有552条查询结果,搜索用时 31 毫秒
101.
102.
The isomorphism of polynomials(IP),one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials.Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate public key cryptosystem.In this paper we show the enumeration of the equivalence classes containing ∑n-1 i=0 aiX2qi when char(Fq) = 2,which implies that these polynomials are all weak IP instances.Moreover,we study the cardinality of an equivalence class containing the binomial aX 2q i + bX 2qj(i=j) over Fqn without the restriction that char(Fq) = 2,which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP. 相似文献
103.
104.
105.
We study a noisy graph isomorphism problem, where the goal is to perfectly recover the vertex correspondence between two edge‐correlated graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. We show that it is possible to achieve the information‐theoretic limit of graph sparsity in time polynomial in the number of vertices n. Moreover, we show the number of seeds needed for perfect recovery in polynomial‐time can be as low as in the sparse graph regime (with the average degree smaller than ) and in the dense graph regime, for a small positive constant . Unlike previous work on graph matching, which used small neighborhoods or small subgraphs with a logarithmic number of vertices in order to match vertices, our algorithms match vertices if their large neighborhoods have a significant overlap in the number of seeds. 相似文献
106.
本文利用JGYW-2型双单摆振动示波装置研究和探讨了两个相互垂直方向同频率欠阻尼振动的合成和两个同方向频率相近的欠阻尼振动的合成.通过实验观察和理论分析,得到了欠阻尼振动合成的部分图形和表达式,揭示了等角螺线的物理意义. 相似文献
107.
In the paper, the notion of F function, i.e., a partial recursive function whose resemblance type consists of one isomorphism type, is generalized. 相似文献
108.
A nonempty and nonconstant partial recursive function such that any function resembling it is recursively isomorphic to it is called a t-function. It is proved that the domain of any t-function is neither a simple nor a pseudosimple set. 相似文献
109.
关于半直积的同构 总被引:4,自引:1,他引:3
刘修生 《武汉大学学报(理学版)》2003,49(3):293-296
设N,H是两个群,φ,ψ驴分别是从群H到N的自同构群Aut(N)的两个自同态,本文证明了当群H及同态映射φ,ψ满足一定条件下半直积与半直积同构的三个定理,而其中两个定理包括了已知的两个结果。 相似文献
110.
Every inverse semigroup possesses a natural partial order and therefore convexity with respect to this order is of interest.
We study the extent to which an inverse semigroup is determined by its lattice of convex inverse subsemigroups; that is, if
the lattices of two inverse semigroups are isomorphic, how are the semigroups related? We solve this problem completely for
semilattices and for inverse semigroups in general reduce it to the case where the lattice isomorphism induces an isomorphism
between the semilattices of idempotents of the semigroups. For many inverse semigroups, such as the monogenic ones, this case
is the only one that can occur. In Part II, a study of the reduced case enables us to prove that many inverse semigroups,
such as the free ones, are strictly determined by their lattices of convex inverse subsemigroups, and to show that the answer
obtained here for semilattices can be extended to a broad class of inverse semigroups, including all finite, aperiodic ones.
Received September 24, 2002; accepted in final form December 15, 2002. 相似文献