全文获取类型
收费全文 | 501篇 |
免费 | 38篇 |
国内免费 | 27篇 |
专业分类
化学 | 2篇 |
综合类 | 17篇 |
数学 | 515篇 |
物理学 | 32篇 |
出版年
2023年 | 8篇 |
2022年 | 17篇 |
2021年 | 11篇 |
2020年 | 22篇 |
2019年 | 23篇 |
2018年 | 20篇 |
2017年 | 23篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 14篇 |
2013年 | 46篇 |
2012年 | 15篇 |
2011年 | 18篇 |
2010年 | 32篇 |
2009年 | 43篇 |
2008年 | 25篇 |
2007年 | 25篇 |
2006年 | 32篇 |
2005年 | 28篇 |
2004年 | 18篇 |
2003年 | 19篇 |
2002年 | 11篇 |
2001年 | 18篇 |
2000年 | 14篇 |
1999年 | 14篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
排序方式: 共有566条查询结果,搜索用时 6 毫秒
41.
42.
Daniel Allcock 《Geometriae Dedicata》1997,65(2):215-217
We provide a convenient identification between two models of the projective plane over the alternative field of octaves: Aslaksen's coordinate approach and the classic approach via Jordan algebras. We do this by modifying a 1949 lemma of P. Jordan. 相似文献
43.
Analterable digraph is a digraph with a subset of its edges marked alterable and their orientations left undecided. We say that an alterable digraph has an invariant ofk on the length of the longest circuit if it has a circuit of length at leastk regardless of the orientations over its alterable edges. Computing the maximum invariant on the length of the longest circuit in an alterable digraph is aglobal optimization problem. We show that it is hard to approximate the global optimal solution for the maximum invariant problem.Research supported in part by NSF grant CCR 9121472. 相似文献
44.
关于Abel群上Cayley图的Hamilton圈分解 总被引:3,自引:0,他引:3
设G(F,T∩T^-1)是有限Abel群F上的Cayley图,T∩T^-1只含2阶元,此文证明了当T是F的极小生成元集时,若d(G)=2k,则G是k个边不相交的Hamilton圈的并,若d(G)=2k+1,则G是k个边不相交的Hamilton圈与一个1-因子的并。 相似文献
45.
In this paper, we prove that a Cayley digraph Γ = Cay(G, S) is a nontrivial lexicographical product if and only if there is a nontrivial subgroup H of G such that S∖H is a union of some double cosets of H in G.
相似文献
46.
This paper characterizes directed graphs which are Cayley graphs of strong semilattices of groups and, in particular, strong chains of groups, i.e. of completely regular semigroups which are also called Clifford semigroups. 相似文献
47.
Donald E. Knuth 《Journal of Algebraic Combinatorics》1997,6(3):259-267
A pleasant family of graphs defined by Godsil and McKay is shown to have easily computed eigenvalues in many cases. 相似文献
48.
49.
An n‐state deterministic finite automaton over a k‐letter alphabet can be seen as a digraph with n vertices which all have k labeled out‐arcs. Grusho (Publ Math Inst Hungarian Acad Sci 5 (1960), 17–61). proved that whp in a random k‐out digraph there is a strongly connected component of linear size, i.e., a giant, and derived a central limit theorem. We show that whp the part outside the giant contains at most a few short cycles and mostly consists of tree‐like structures, and present a new proof of Grusho's theorem. Among other things, we pinpoint the phase transition for strong connectivity. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 428–458, 2017 相似文献
50.