首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   209篇
  免费   7篇
  国内免费   32篇
化学   2篇
综合类   3篇
数学   237篇
物理学   6篇
  2022年   3篇
  2021年   2篇
  2020年   3篇
  2019年   3篇
  2018年   7篇
  2017年   7篇
  2016年   1篇
  2015年   1篇
  2014年   7篇
  2013年   30篇
  2012年   5篇
  2011年   8篇
  2010年   8篇
  2009年   9篇
  2008年   19篇
  2007年   15篇
  2006年   14篇
  2005年   11篇
  2004年   10篇
  2003年   7篇
  2002年   16篇
  2001年   11篇
  2000年   13篇
  1999年   8篇
  1998年   10篇
  1997年   9篇
  1996年   5篇
  1995年   3篇
  1994年   1篇
  1977年   2篇
排序方式: 共有248条查询结果,搜索用时 15 毫秒
1.
We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.  相似文献   
2.
Properties of the unions of sampling and interpolation sets for Bergman spaces are discussed in conjunction with the examples given by Seip (1993). Their relationship to the classical interpolation sequences is explored. In addition, the role played by canonical divisors in the study of these sets is examined and an example of a sampling set is constructed in the disk.

  相似文献   

3.
In this paper we consider a class of non-conservative dynamical system with small perturbation. By the KAM method we prove existence of Floquet invariant tori under the weakest non-resonant conditions.

  相似文献   

4.
We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006  相似文献   
5.
Lei X be an arbitrary smooth irreducible complex projective curve, E (?) X a rank two vector bundle generated by its sections. The author first represents E as a triple {D1,D2,f}, where D1 , D2 are two effective divisors with d = deg(D1) + deg(D2), and f ∈ H0(X, [D1] |D2) is a collection of polynomials. E is the extension of [D2] by [D1] which is determined by f. By using f and the Brill-Noether matrix of D1 + D2, the author constructs a 2g X d matrix WE whose zero space gives Im{H0(X,[D1]) (?) H0(X, [D1] |D1)}(?)Im{H0(X, E) (?) H0(X,[D2]) (?) H0(X,[D2] |D2)}. From this and H0(X,E) = H0(X, [D1]) (?) Im{H0(X, E) (?) H0(X, [D2])}, it is got in particular that dimH0(X, E) = deg(E) - rank(WE) + 2.  相似文献   
6.
一些新的数论函数及其均值公式   总被引:1,自引:0,他引:1  
对于给定的自然数m,我们利用最大公约数和最小公倍数定义数论函数(m,n)和[m,n]/m.本文主要目的是研究这两个新的函数的渐近性质,利用解析方法得到这两个函数的几个渐近公式.  相似文献   
7.
Let be a log surface with at worst log canonical singularities and reduced boundary such that is nef and big. We shall prove that either has finite fundamental group or is affine-ruled. Moreover, and the structure of are determined in some sense when .

  相似文献   

8.
Here we give a few n-dimensional extensions of a recent result of M. Abe concerning a Cousin I characterization of two-dimensional Stein manifolds.  相似文献   
9.
We prove that for any positive real number which is not an integer, the density of the integers which are coprime to , a result conjectured by Moser, Lambek and Erd Hs. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
10.

This paper is concerned with algorithms for computing in the divisor class group of a nonsingular plane curve of the form which has only one point at infinity. Divisors are represented as ideals, and an ideal reduction algorithm based on lattice reduction is given. We obtain a unique representative for each divisor class and the algorithms for addition and reduction of divisors run in polynomial time. An algorithm is also given for solving the discrete logarithm problem when the curve is defined over a finite field.

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号