全文获取类型
收费全文 | 519篇 |
免费 | 22篇 |
国内免费 | 38篇 |
专业分类
化学 | 12篇 |
力学 | 26篇 |
综合类 | 11篇 |
数学 | 449篇 |
物理学 | 81篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 9篇 |
2021年 | 10篇 |
2020年 | 13篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 15篇 |
2015年 | 4篇 |
2014年 | 15篇 |
2013年 | 29篇 |
2012年 | 18篇 |
2011年 | 19篇 |
2010年 | 18篇 |
2009年 | 27篇 |
2008年 | 29篇 |
2007年 | 32篇 |
2006年 | 36篇 |
2005年 | 33篇 |
2004年 | 38篇 |
2003年 | 21篇 |
2002年 | 28篇 |
2001年 | 21篇 |
2000年 | 31篇 |
1999年 | 14篇 |
1998年 | 13篇 |
1997年 | 15篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 12篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1984年 | 4篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有579条查询结果,搜索用时 15 毫秒
1.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
2.
In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case. 相似文献
3.
4.
We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions.
In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.
Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.相似文献
5.
李斌 《数学的实践与认识》2006,36(8):25-30
在分析我国房地产自有资本收益率操作中所存在问题的基础上,论述了自有资本收益率的实质是自有资金直接资本化率,并在房地产持有期小于抵押贷款期以及房地产持有期和土地批租年限相同的两种情况下,推导出了与土地有限期使用制度相适应的房地产资本化率和自有资本收益率的计算方法,提出了利用债务保障比率的取值范围检验资本化率合理性的基本公式. 相似文献
6.
It is well known that S 12 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S 12 for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
7.
8.
An asymptotic formula is obtained for the number of representations of an element of a finite field as a weighted sum of two prescribed powers of primitive elements. This generalises previous work on sums of primitive elements, including that relating to some conjectures of Golomb. 相似文献
9.
CHEN Falai & YANG Wu Department of Mathematics University of Science Technology of China Hefei China 《中国科学A辑(英文版)》2005,48(9):1260-1273
Wu's elimination method is an important method for solving multivariate poly- nomial equations.In this paper,we apply interval arithmetic to Wu's method and convert the problem of solving polynomial equations into that of solving interval polynomial equa- tions.Parallel results such as zero-decomposition theorem are obtained for interval poly- nomial equations.The advantages of the new approach are two-folds:First,the problem of the numerical instability arisen from floating-point arithmetic is largely overcome.Second, the low efficiency of the algorithm caused by large intermediate coefficients introduced by exact compaction is dramatically improved.Some examples are provided to illustrate the effectiveness of the proposed algorithm. 相似文献
10.
We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game (Section 1 and Appendix). Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game (which is two-dimensional but without labels), by a simple and natural interpretation (Section 2). Jervell proposed another type of a combinatorial game, by abstracting Gentzen's proof-reductions and showed that his game is independent of PA. We show (Section 3) that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φω (0) (while that of PA or of Kirby-Paris' Game is φ1 (0) = ?0) in the Veblen hierarchy of ordinals. 相似文献