全文获取类型
收费全文 | 5461篇 |
免费 | 208篇 |
国内免费 | 206篇 |
专业分类
化学 | 200篇 |
晶体学 | 1篇 |
力学 | 269篇 |
综合类 | 22篇 |
数学 | 4399篇 |
物理学 | 984篇 |
出版年
2024年 | 11篇 |
2023年 | 96篇 |
2022年 | 130篇 |
2021年 | 210篇 |
2020年 | 277篇 |
2019年 | 127篇 |
2018年 | 139篇 |
2017年 | 251篇 |
2016年 | 272篇 |
2015年 | 249篇 |
2014年 | 458篇 |
2013年 | 411篇 |
2012年 | 392篇 |
2011年 | 363篇 |
2010年 | 291篇 |
2009年 | 306篇 |
2008年 | 216篇 |
2007年 | 265篇 |
2006年 | 242篇 |
2005年 | 167篇 |
2004年 | 75篇 |
2003年 | 71篇 |
2002年 | 80篇 |
2001年 | 130篇 |
2000年 | 45篇 |
1999年 | 99篇 |
1998年 | 73篇 |
1997年 | 53篇 |
1996年 | 33篇 |
1995年 | 24篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 82篇 |
1987年 | 81篇 |
1986年 | 68篇 |
1985年 | 13篇 |
1984年 | 6篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1959年 | 1篇 |
1937年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有5875条查询结果,搜索用时 15 毫秒
1.
2.
4.
6.
7.
To construct a class of new multiwave interaction solutions for the (3+1)-dimensional generalized Kadomtsev-Petviashvili equation, we calculate different types of interaction solutions among solitons, periodic waves and rational waves using the direct algebraic method together with the inheritance solving skill. Moreover, a new algorithm is proposed with the aid of the simplified Hirota method, the conjugated parameters assignment and long wave limit strategies, from which multiwave interaction solutions among solitons, breathers and lump waves are generated. 相似文献
8.
9.
10.
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. 相似文献