首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1098篇
  免费   62篇
  国内免费   49篇
化学   33篇
力学   27篇
综合类   8篇
数学   1009篇
物理学   132篇
  2024年   1篇
  2023年   14篇
  2022年   25篇
  2021年   30篇
  2020年   40篇
  2019年   33篇
  2018年   35篇
  2017年   27篇
  2016年   31篇
  2015年   25篇
  2014年   54篇
  2013年   163篇
  2012年   41篇
  2011年   59篇
  2010年   54篇
  2009年   93篇
  2008年   76篇
  2007年   65篇
  2006年   54篇
  2005年   29篇
  2004年   31篇
  2003年   29篇
  2002年   19篇
  2001年   20篇
  2000年   14篇
  1999年   17篇
  1998年   23篇
  1997年   25篇
  1996年   18篇
  1995年   18篇
  1994年   9篇
  1993年   9篇
  1992年   2篇
  1991年   2篇
  1990年   5篇
  1989年   1篇
  1987年   2篇
  1985年   4篇
  1984年   4篇
  1983年   2篇
  1982年   2篇
  1981年   2篇
  1980年   1篇
  1979年   1篇
排序方式: 共有1209条查询结果,搜索用时 15 毫秒
1.
2.
3.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。  相似文献   
4.
We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in terms of a recurrence formula for the vectors which determine the structure of polynomial input with this property. From this recurrence, we obtain an algorithm to determine polynomial input of maximal degree. The algorithm can be used in the design of masks to achieve a high order of polynomial reproduction.  相似文献   
5.
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.  相似文献   
6.
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.  相似文献   
7.
On Polynomial Functions over Finite Commutative Rings   总被引:1,自引:0,他引:1  
Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.  相似文献   
8.
Ascidia malaca gametes before fertilization incubated in 10?5 or 10?7 M solutions of tributyltin(IV) chloride, TBTCl, for 3 h appear highly damaged under transmission electron microscopy observation. Also, the fertilization process is affected by the compound: the damaged spermatozoa are present in the vitelline coat and the egg does not cleave. An increase of microbodies, structurally similar to peroxisomes, have been detected in the egg peripheral cytoplasm, probably in relation to their role in alleviating damage to some cellular components. The results have shown that the reproduction of ascidians under unfavourable environmental conditions is prevented. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   
9.
Let E\subset \Bbb R s be compact and let d n E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ n ={ \bf x k,n } k=1 dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R 2 . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.  相似文献   
10.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.

  相似文献   

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

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