全文获取类型
收费全文 | 20148篇 |
免费 | 2744篇 |
国内免费 | 584篇 |
专业分类
化学 | 937篇 |
晶体学 | 13篇 |
力学 | 1027篇 |
综合类 | 336篇 |
数学 | 5923篇 |
物理学 | 2916篇 |
无线电 | 12324篇 |
出版年
2024年 | 63篇 |
2023年 | 219篇 |
2022年 | 405篇 |
2021年 | 498篇 |
2020年 | 497篇 |
2019年 | 422篇 |
2018年 | 443篇 |
2017年 | 646篇 |
2016年 | 873篇 |
2015年 | 891篇 |
2014年 | 1450篇 |
2013年 | 1401篇 |
2012年 | 1409篇 |
2011年 | 1546篇 |
2010年 | 1093篇 |
2009年 | 1251篇 |
2008年 | 1391篇 |
2007年 | 1448篇 |
2006年 | 1219篇 |
2005年 | 1025篇 |
2004年 | 860篇 |
2003年 | 758篇 |
2002年 | 653篇 |
2001年 | 515篇 |
2000年 | 454篇 |
1999年 | 333篇 |
1998年 | 316篇 |
1997年 | 260篇 |
1996年 | 229篇 |
1995年 | 164篇 |
1994年 | 114篇 |
1993年 | 123篇 |
1992年 | 108篇 |
1991年 | 47篇 |
1990年 | 64篇 |
1989年 | 38篇 |
1988年 | 41篇 |
1987年 | 25篇 |
1986年 | 34篇 |
1985年 | 37篇 |
1984年 | 33篇 |
1983年 | 12篇 |
1982年 | 24篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 656 毫秒
71.
72.
73.
We present a practical polynomial-time algorithm for computing the
zeta function of a Kummer curve over a finite field of small
characteristic. Such algorithms have recently been obtained using a
method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of
interest in cryptography. We take a different approach.
The problem is reduced to that of computing the L-function
of a multiplicative character sum. This latter task is achieved via a
cohomological formula based upon the work of Dwork and Reich. We show,
however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota 相似文献
74.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
75.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献
76.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
77.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
78.
79.
工程施工中运输网络优化方案 总被引:5,自引:0,他引:5
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 . 相似文献
80.
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. 相似文献