全文获取类型
收费全文 | 2761篇 |
免费 | 160篇 |
国内免费 | 78篇 |
专业分类
化学 | 81篇 |
晶体学 | 1篇 |
力学 | 5篇 |
综合类 | 29篇 |
数学 | 2752篇 |
物理学 | 131篇 |
出版年
2024年 | 10篇 |
2023年 | 68篇 |
2022年 | 91篇 |
2021年 | 60篇 |
2020年 | 118篇 |
2019年 | 105篇 |
2018年 | 99篇 |
2017年 | 102篇 |
2016年 | 67篇 |
2015年 | 55篇 |
2014年 | 100篇 |
2013年 | 249篇 |
2012年 | 76篇 |
2011年 | 146篇 |
2010年 | 139篇 |
2009年 | 252篇 |
2008年 | 201篇 |
2007年 | 158篇 |
2006年 | 158篇 |
2005年 | 92篇 |
2004年 | 88篇 |
2003年 | 85篇 |
2002年 | 74篇 |
2001年 | 60篇 |
2000年 | 58篇 |
1999年 | 52篇 |
1998年 | 45篇 |
1997年 | 39篇 |
1996年 | 24篇 |
1995年 | 9篇 |
1994年 | 14篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2999条查询结果,搜索用时 31 毫秒
941.
In this article, we infer inequalities representing (upper) bounds for real quantities. The obtained bound is parametric and, hence, it might be applicable to special problems. Here, we apply it to probabilities assigned to complex networks. © 2015 Wiley Periodicals, Inc. Complexity 21: 113–115, 2016 相似文献
942.
943.
944.
We revisit theoretical background on OSIDH (Oriented Supersingular Isogeny Diffie-Hellman protocol), which is an isogeny-based key-exchange protocol proposed by Colò and Kohel at NutMiC 2019. We give a proof of a fundamental theorem for OSIDH. The theorem was stated by Colò and Kohel without proof. Furthermore, we consider parameters of OSIDH, give a sufficient condition on the parameters for the protocol to work, and estimate the size of the parameters for a certain security level. 相似文献
945.
946.
《Journal of Graph Theory》2018,88(3):521-546
Correspondence coloring, or DP‐coloring, is a generalization of list coloring introduced recently by Dvořák and Postle [11]. In this article, we establish a version of Dirac's theorem on the minimum number of edges in critical graphs [9] in the framework of DP‐colorings. A corollary of our main result answers a question posed by Kostochka and Stiebitz [15] on classifying list‐critical graphs that satisfy Dirac's bound with equality. 相似文献
947.
《Operations Research Letters》2020,48(3):266-270
Given a strongly connected, mixed graph with costs on its edges and arcs, the mixed postman problem is to find a minimum cost closed walk traversing its edges and arcs at least once. This problem is NP-hard even on planar graphs but is solvable in polynomial time on series–parallel graphs. We give dynamic programming algorithms for the mixed postman problem and other similar problems on series–parallel graphs with vertices and edges and arcs. 相似文献
948.
949.
Marginal AMP chain graphs are a recently introduced family of models that is based on graphs that may have undirected, directed and bidirected edges. They unify and generalize the AMP and the multivariate regression interpretations of chain graphs. In this paper, we present a constraint based algorithm for learning a marginal AMP chain graph from a probability distribution which is faithful to it. We show that the marginal AMP chain graph returned by our algorithm is a distinguished member of its Markov equivalence class. We also show that our algorithm performs well in practice. Finally, we show that the extension of Meek's conjecture to marginal AMP chain graphs does not hold, which compromises the development of efficient and correct score+search learning algorithms under assumptions weaker than faithfulness. 相似文献
950.