全文获取类型
收费全文 | 20262篇 |
免费 | 1822篇 |
国内免费 | 1750篇 |
专业分类
化学 | 3773篇 |
晶体学 | 67篇 |
力学 | 1058篇 |
综合类 | 593篇 |
数学 | 13721篇 |
物理学 | 4622篇 |
出版年
2024年 | 46篇 |
2023年 | 228篇 |
2022年 | 469篇 |
2021年 | 505篇 |
2020年 | 537篇 |
2019年 | 599篇 |
2018年 | 576篇 |
2017年 | 604篇 |
2016年 | 581篇 |
2015年 | 412篇 |
2014年 | 819篇 |
2013年 | 1471篇 |
2012年 | 837篇 |
2011年 | 1187篇 |
2010年 | 1153篇 |
2009年 | 1500篇 |
2008年 | 1420篇 |
2007年 | 1344篇 |
2006年 | 1308篇 |
2005年 | 991篇 |
2004年 | 870篇 |
2003年 | 829篇 |
2002年 | 756篇 |
2001年 | 652篇 |
2000年 | 580篇 |
1999年 | 552篇 |
1998年 | 491篇 |
1997年 | 364篇 |
1996年 | 325篇 |
1995年 | 253篇 |
1994年 | 207篇 |
1993年 | 169篇 |
1992年 | 168篇 |
1991年 | 111篇 |
1990年 | 97篇 |
1989年 | 104篇 |
1988年 | 83篇 |
1987年 | 74篇 |
1986年 | 35篇 |
1985年 | 82篇 |
1984年 | 62篇 |
1983年 | 33篇 |
1982年 | 67篇 |
1981年 | 42篇 |
1980年 | 43篇 |
1979年 | 57篇 |
1978年 | 32篇 |
1977年 | 30篇 |
1976年 | 21篇 |
1974年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
11.
12.
13.
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a -approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers. 相似文献
14.
《Discrete Mathematics》2020,343(12):112117
Let be an edge-colored graph of order . The minimum color degree of , denoted by , is the largest integer such that for every vertex , there are at least distinct colors on edges incident to . We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if , then contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if and , then contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if , then contains vertex-disjoint rainbow triangles. For any integer , we show that if and , then contains vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of edge-disjoint rainbow triangles. 相似文献
15.
Bobby Wilson 《偏微分方程通讯》2015,40(8):1521-1542
This article explores the questions of long time orbital stability in high order Sobolev norms of plane wave solutions to the NLSE in the defocusing case. 相似文献
16.
17.
18.
《Discrete Mathematics》2019,342(3):623-627
Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1]. 相似文献
19.
《Discrete Mathematics》2019,342(2):339-343
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. Let be a connected planar graph with girth and maximum degree . We show that either is isomorphic to a subgraph of a very special -regular graph with girth , or has a strong edge-coloring using at most colors. 相似文献
20.
采用DIS数字信息化系统,对不同浓度的蓝墨水溶液在激光光源照射下的透射平均照度及照度分布图像进行实验研究,得到了平均照度值随溶液浓度变化的规律。对不同颜色塑料膜片对白炽灯光源透过照度值及照度分布图像进行实验研究得到及其相关之规律。 相似文献