全文获取类型
收费全文 | 1086篇 |
免费 | 7篇 |
国内免费 | 1篇 |
专业分类
化学 | 151篇 |
晶体学 | 11篇 |
力学 | 428篇 |
数学 | 300篇 |
物理学 | 204篇 |
出版年
2013年 | 174篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 27篇 |
2005年 | 16篇 |
2003年 | 7篇 |
2002年 | 69篇 |
2001年 | 5篇 |
2000年 | 117篇 |
1998年 | 7篇 |
1996年 | 6篇 |
1995年 | 21篇 |
1994年 | 16篇 |
1993年 | 10篇 |
1992年 | 17篇 |
1991年 | 21篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 14篇 |
1984年 | 10篇 |
1983年 | 11篇 |
1982年 | 14篇 |
1981年 | 16篇 |
1980年 | 21篇 |
1979年 | 9篇 |
1977年 | 10篇 |
1976年 | 6篇 |
1975年 | 33篇 |
1974年 | 48篇 |
1973年 | 20篇 |
1972年 | 20篇 |
1971年 | 32篇 |
1970年 | 25篇 |
1969年 | 54篇 |
1968年 | 35篇 |
1966年 | 6篇 |
1965年 | 8篇 |
1963年 | 12篇 |
1961年 | 7篇 |
1960年 | 9篇 |
1959年 | 11篇 |
1957年 | 4篇 |
1956年 | 4篇 |
1955年 | 7篇 |
1954年 | 5篇 |
排序方式: 共有1094条查询结果,搜索用时 15 毫秒
121.
Professor J. P. Jones 《International Journal of Game Theory》1982,11(2):63-70
Computing machines using algorithms play games and even learn to play games. However, the inherent finiteness properties of algorithms impose limitations on the game playing abilities of machines. M. Rabin illustrated this limitation in 1957 by constructing a two-person win-lose game with decidable rules but no computable winning strategies. Rabin's game was of the type where two players take turns choosing integers to satisfy some decidable but very complicated winning condition. In the present paper we obtain similar theorems of this type but the winning conditions are extremely simple relations (polynomial equations). Specific examples are given. 相似文献
122.
Professor Dr. E. Mettler 《Archive of Applied Mechanics (Ingenieur Archiv)》1955,23(5):354-364
Ohne Zusammenfassung 相似文献
123.
Professor Y. Tauman 《International Journal of Game Theory》1981,10(3-4):155-162
We prove the existence of a (unique) Aumann-Shapley value on the space on non-atomic gamesQ n generated byn-handed glove games. (These are the minima ofn non-atomic mutually singular probability measures.) It is also shown that this value can be extended to a value on the smallest space containingQ n andpNA. 相似文献
124.
125.
Professor R. Ahlswede 《Probability Theory and Related Fields》1968,11(1):61-73
Summary Coding theorem and weak converse of the coding theorem are proved for averaged semicontinuous stationary channels and for almost periodic discrete channels, whose phases are statistically known. Explicit formulas for the capacities are given. The strong converses of the coding theorems do not hold. 相似文献
126.
Professor J. Neveu 《Probability Theory and Related Fields》1969,13(2):132-134
Summary The spectral properties and strict ergodicity property of the Toeplitz sequences which have been introduced in [1] are also consequences of an isomorphism of the dynamical systems associated to these sequences with translations on certain abelian compact groups. 相似文献
127.
Professor Dr. Rudolf Haag 《Zeitschrift für Physik A Hadrons and Nuclei》1969,229(3-5):384-391
We discuss the idealizations which have to be made when one speaks about a physical system, its set of states and the measurement process. Some simple models of state spaces which are more general than those appearing in quantum physics are briefly described. 相似文献
128.
129.
A perfect equilibrium [Selten] can be viewed as a Nash equilibrium with certain properties of local stability. Simple examples show that a stronger notion of local stability is needed to eliminate unreasonable Nash equilibria. The persistent equilibrium is such a notion. Properties of this solution are studied. In particular, it is shown that in each strategic game there exists a pesistent equilibrium which is perfect and proper. 相似文献
130.