全文获取类型
收费全文 | 6630篇 |
免费 | 753篇 |
国内免费 | 438篇 |
专业分类
化学 | 402篇 |
晶体学 | 14篇 |
力学 | 100篇 |
综合类 | 141篇 |
数学 | 5294篇 |
物理学 | 677篇 |
无线电 | 1193篇 |
出版年
2024年 | 19篇 |
2023年 | 121篇 |
2022年 | 198篇 |
2021年 | 168篇 |
2020年 | 238篇 |
2019年 | 260篇 |
2018年 | 243篇 |
2017年 | 274篇 |
2016年 | 176篇 |
2015年 | 163篇 |
2014年 | 254篇 |
2013年 | 549篇 |
2012年 | 314篇 |
2011年 | 386篇 |
2010年 | 383篇 |
2009年 | 531篇 |
2008年 | 481篇 |
2007年 | 372篇 |
2006年 | 411篇 |
2005年 | 303篇 |
2004年 | 275篇 |
2003年 | 236篇 |
2002年 | 221篇 |
2001年 | 194篇 |
2000年 | 184篇 |
1999年 | 166篇 |
1998年 | 141篇 |
1997年 | 119篇 |
1996年 | 76篇 |
1995年 | 69篇 |
1994年 | 63篇 |
1993年 | 44篇 |
1992年 | 37篇 |
1991年 | 22篇 |
1990年 | 16篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有7821条查询结果,搜索用时 203 毫秒
91.
92.
Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C4 as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order. 相似文献
93.
Energy minimization and design for testability 总被引:6,自引:0,他引:6
Srimat T. Chakradhar Vishwani D. Agrawal Michael L. Bushnell 《Journal of Electronic Testing》1994,5(1):57-66
The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables. 相似文献
94.
95.
We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam. 相似文献
96.
The results of the analysis of the stability of stationary solutions of wave equations discribing a behavior of the nonlinear Fabry-Perot interferometer with a saturated paramagnetic filling are presented in this paper. The cases when paramagnetic medium is characterized by a homogeneously and nonhomogeneously broadened line of the magnetic resonance have been considered. Areas of unstable behavior of these characteristics of the resonance structure have been found. 相似文献
97.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
98.
本证明了当(a,b)不属于{(1,8),(2,4),(3,6),(4,4),(2s^2-s,2s^2 s))时,L^m(Ka,b)以谱为特征,其中a≤b,s≥2. 相似文献
99.
设G是一个图 .设g和f是两个定义在V(G)上的整值函数使得对V(G)所有顶点x有g(x) ≤f(x) .图G被称为 (g ,f,n) 临界图 ,如果删去G的任意n个顶点后的子图都含有G的 (g ,f) 因子 .本文给出了图是 (a ,b ,n) 临界图几个充分条件 ,即度和邻域条件 .进一步指出这些条件是最佳的 . 相似文献
100.
For each infinite cardinal κ, we give examples of 2κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003 相似文献