全文获取类型
收费全文 | 5059篇 |
免费 | 359篇 |
国内免费 | 428篇 |
专业分类
化学 | 192篇 |
晶体学 | 3篇 |
力学 | 56篇 |
综合类 | 77篇 |
数学 | 3459篇 |
物理学 | 305篇 |
综合类 | 1754篇 |
出版年
2024年 | 14篇 |
2023年 | 62篇 |
2022年 | 97篇 |
2021年 | 77篇 |
2020年 | 127篇 |
2019年 | 134篇 |
2018年 | 128篇 |
2017年 | 143篇 |
2016年 | 108篇 |
2015年 | 101篇 |
2014年 | 199篇 |
2013年 | 349篇 |
2012年 | 217篇 |
2011年 | 284篇 |
2010年 | 254篇 |
2009年 | 393篇 |
2008年 | 334篇 |
2007年 | 380篇 |
2006年 | 315篇 |
2005年 | 260篇 |
2004年 | 229篇 |
2003年 | 208篇 |
2002年 | 188篇 |
2001年 | 167篇 |
2000年 | 132篇 |
1999年 | 147篇 |
1998年 | 127篇 |
1997年 | 123篇 |
1996年 | 88篇 |
1995年 | 55篇 |
1994年 | 56篇 |
1993年 | 59篇 |
1992年 | 37篇 |
1991年 | 39篇 |
1990年 | 43篇 |
1989年 | 42篇 |
1988年 | 31篇 |
1987年 | 19篇 |
1986年 | 10篇 |
1985年 | 19篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 7篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有5846条查询结果,搜索用时 31 毫秒
61.
62.
63.
研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1 无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2 无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3 无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 . 相似文献
64.
Chepoi showed that every breadth first search of a bridged graph produces a cop-win ordering of the graph. We note here that Chepoi's proof gives a simple proof of the theorem that G is bridged if and only if G is cop-win and has no induced cycle of length four or five, and that this characterization together with Chepoi's proof reduces the time complexity of bridged graph recognition. Specifically, we show that bridged graph recognition is equivalent to (C4,C5)-free graph recognition, and reduce the best known time complexity from O(n4) to O(n3.376). 相似文献
65.
A (p, q)-sigraph S is an ordered pair (G, s) where G = (V, E) is a (p, q)-graph and s is a function which assigns to each edge of G a positive or a negative sign. Let the sets E
+ and E
– consist of m positive and n negative edges of G, respectively, where m + n = q. Given positive integers k and d, S is said to be (k, d)-graceful if the vertices of G can be labeled with distinct integers from the set {0, 1, ..., k + (q – 1)d such that when each edge uv of G is assigned the product of its sign and the absolute difference of the integers assigned to u and v the edges in E
+ and E
– are labeled k, k + d, k + 2d, ..., k + (m – 1)d and –k, – (k + d), – (k + 2d), ..., – (k + (n – 1)d), respectively.In this paper, we report results of our preliminary investigation on the above new notion, which indeed generalises the well-known concept of (k, d)-graceful graphs due to B. D. Acharya and S. M. Hegde. 相似文献
66.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
67.
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 相似文献
68.
Jochen Alber Jií Fiala 《Journal of Algorithms in Cognition, Informatics and Logic》2004,52(2):134-151
We consider the parameterized problem, whether for a given set
of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time
that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time
. The results are based on problem kernelization and a new “geometric (
-separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.” 相似文献
69.
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
70.
张倩 《重庆三峡学院学报》2007,23(4):89-92
本研究用实证的方法对前人的研究进行了验证,并做了一定的扩展。结果发现与可识别身份条件相比,完全匿名与单向匿名均使得评价的批判性增强,评价者关注点在评价内容上,但评价的认知涣散也增强。匿名评价效应的关键因素在于评价者身份的隐匿。 相似文献