全文获取类型
收费全文 | 142篇 |
免费 | 0篇 |
国内免费 | 7篇 |
专业分类
化学 | 23篇 |
数学 | 114篇 |
物理学 | 4篇 |
无线电 | 8篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 3篇 |
2017年 | 2篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 10篇 |
2012年 | 6篇 |
2011年 | 6篇 |
2010年 | 6篇 |
2009年 | 18篇 |
2008年 | 13篇 |
2007年 | 9篇 |
2006年 | 8篇 |
2005年 | 5篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 1篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有149条查询结果,搜索用时 15 毫秒
1.
John A. Ryan 《Discrete Applied Mathematics》2006,154(2):399-412
We consider irreducible Goppa codes over Fq of length qn defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes. 相似文献
2.
Sherif El-Basil Gani Jashari Jan V. Knop Nenad Trinajstić 《Monatshefte für Chemie / Chemical Monthly》1984,115(11):1299-1312
The reduced graph model, when used in conjunction with the search trees method, provides a novel combinatorial procedure for the enumeration and generation ofKekulé structures. The procedure is suited for large benzenoid hydrocarbons consisting of cata- and thin peri-condensed parts.
Zur Anwendung des Reduced Graph Model im Zusammenhang mit Search Trees zur Ermittlung der Anzahl möglicherKekulé-Strukturen
Zusammenfassung Das Modell erlaubt mit der im Titel genannten Kombination eine neuartige Methode zur Ermittlung und Generierung vonKekulé-Strukturen. Das Verfahren ist für große benzoide Kohlenwasserstoffe geeignet, die aus cata- und (dünnen) peri-kondensierten Teilstrukturen bestehen.相似文献
3.
采用图论方法对单一种取代基取代的金刚烷和烷基取代的金刚烷构型、手性构型和非手性构型数进行了计算,结果分别以母函数形式和表格形式给出。 相似文献
4.
Peter J. Cameron 《Designs, Codes and Cryptography》1996,8(3):109-133
The main theme of this article is that counting orbits of an infinite permutation group on finite subsets or tuples is very closely related to combinatorial enumeration; this point of view ties together various disparate stories. Among these are reconstruction problems, the relation between connected and arbitrary graphs, the enumeration of N-free posets, and some of the combinatorics of Stirling numbers.Dedicated to Hanfried Lenz on the occasion of his 80th birthday. 相似文献
5.
7.
He Xinhua Gong Yunzhan Fu Qingling 《电子科学学刊(英文版)》1997,14(2):165-168
This paper presents the techniques of implicit traversing and state verification for sequential finite state machines(FSMs) based of on the state collapsing of state transition graph(STG). The problems of state designing are described. In order to achieve high state enumeration coverage, heuristic knowledge is proposed. 相似文献
8.
Zbigniew R. Bogdanowicz 《Discrete Mathematics》2009,309(10):3074-3082
We show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph Ln,m having n vertices and m edges that consists of an (n−k)-clique and k−1 vertices of degree 1 has the fewest spanning trees among all connected graphs on n vertices and m edges. This proves Boesch’s conjecture [F.T. Boesch, A. Satyanarayana, C.L. Suffel, Least reliable networks and reliability domination, IEEE Trans. Commun. 38 (1990) 2004-2009]. 相似文献
9.
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1,…,n}, then with probability tending to 1 as n→∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components. 相似文献
10.
Kate Copestake 《Mathematical Logic Quarterly》1997,43(3):287-310
Enumeration reducibility is a notion of relative computability between sets of natural numbers where only positive information about the sets is used or produced. Extending e-reducibility to partial functions characterises relative computability between partial functions. We define a polynomial time enumeration reducibility that retains the character of enumeration reducibility and show that it is equivalent to conjunctive non-deterministic polynomial time reducibility. We define the polynomial time e-degrees as the equivalence classes under this reducibility and investigate their structure on the recursive sets, showing in particular that the pe-degrees of the computable sets are dense and do not form a lattice, but that minimal pairs exist. We define a jump operator and use it to produce a characterisation of the polynomial hierarchy. 相似文献