全文获取类型
收费全文 | 3548篇 |
免费 | 295篇 |
国内免费 | 241篇 |
专业分类
化学 | 118篇 |
晶体学 | 1篇 |
力学 | 84篇 |
综合类 | 62篇 |
数学 | 3563篇 |
物理学 | 256篇 |
出版年
2024年 | 12篇 |
2023年 | 66篇 |
2022年 | 93篇 |
2021年 | 78篇 |
2020年 | 128篇 |
2019年 | 118篇 |
2018年 | 117篇 |
2017年 | 139篇 |
2016年 | 106篇 |
2015年 | 78篇 |
2014年 | 134篇 |
2013年 | 266篇 |
2012年 | 111篇 |
2011年 | 162篇 |
2010年 | 178篇 |
2009年 | 282篇 |
2008年 | 258篇 |
2007年 | 215篇 |
2006年 | 200篇 |
2005年 | 173篇 |
2004年 | 139篇 |
2003年 | 139篇 |
2002年 | 136篇 |
2001年 | 100篇 |
2000年 | 116篇 |
1999年 | 97篇 |
1998年 | 88篇 |
1997年 | 82篇 |
1996年 | 54篇 |
1995年 | 16篇 |
1994年 | 25篇 |
1993年 | 21篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 16篇 |
1989年 | 17篇 |
1988年 | 16篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 15篇 |
1984年 | 18篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1974年 | 2篇 |
1970年 | 1篇 |
排序方式: 共有4084条查询结果,搜索用时 46 毫秒
1.
2.
For an integer , a graph is -hamiltonian if for any vertex subset with , is hamiltonian, and is -hamiltonian connected if for any vertex subset with , is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of -hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for , a line graph is -hamiltonian if and only if is -connected. In this paper we prove the following.(i) For an integer , the line graph of a claw-free graph is -hamiltonian if and only if is -connected.(ii) The line graph of a claw-free graph is 1-hamiltonian connected if and only if is 4-connected. 相似文献
3.
4.
5.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
6.
7.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
8.
9.
Martín D. Safe 《Journal of Graph Theory》2020,93(2):268-298
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J. Discrete Math., 13 (2000), pp. 179–193]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices for the circular-ones property for rows and for the circular-ones property for rows and columns and show that, also for both variants of the property, one of the corresponding forbidden submatrices can be found (if present) in any given matrix in linear time. We make some final remarks regarding connections to some classes of circular-arc graphs. 相似文献
10.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献