全文获取类型
收费全文 | 432篇 |
免费 | 1篇 |
国内免费 | 4篇 |
专业分类
化学 | 12篇 |
力学 | 4篇 |
数学 | 382篇 |
物理学 | 39篇 |
出版年
2023年 | 12篇 |
2022年 | 6篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 5篇 |
2014年 | 18篇 |
2013年 | 31篇 |
2012年 | 22篇 |
2011年 | 24篇 |
2010年 | 22篇 |
2009年 | 39篇 |
2008年 | 34篇 |
2007年 | 41篇 |
2006年 | 22篇 |
2005年 | 17篇 |
2004年 | 9篇 |
2003年 | 12篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 1篇 |
1988年 | 1篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
排序方式: 共有437条查询结果,搜索用时 46 毫秒
41.
We consider singular perturbation problems depending on a parameter ε?0 such that for ε>0 the solution uε belongs to a Sobolev space on a domain , but the limit u0 is not a distribution on . A very simple model problem, solvable by Fourier transform allows us to study the complexification process of uε as . The limit holds in the topology of a space of analytical functionals. To cite this article: C.A. De Souza, É. Sanchez-Palencia, C. R. Mecanique 332 (2004). 相似文献
42.
Benjamin A. Burton 《Journal of Combinatorial Theory, Series A》2011,118(4):1410-1435
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but non-linear and non-convex constraint. The main results of this paper are significant improvements upon the best known asymptotic bounds on the number of admissible vertices, using polytopes in both the standard normal surface coordinate system and the streamlined quadrilateral coordinate system.To achieve these results we examine the layout of admissible points within these polytopes. We show that these points correspond to well-behaved substructures of the face lattice, and we study properties of the corresponding “admissible faces”. Key lemmata include upper bounds on the number of maximal admissible faces of each dimension, and a bijection between the maximal admissible faces in the two coordinate systems mentioned above. 相似文献
43.
Felix Distel 《Discrete Applied Mathematics》2011,159(6):450-466
We investigate whether the pseudo-intents of a given formal context can efficiently be enumerated. We show that they cannot be enumerated in a specified lexicographic order with polynomial delay unless P=NP. Furthermore we show that if the restriction on the order of enumeration is removed, then the problem becomes at least as hard as enumerating minimal transversals of a given hypergraph. We introduce the notion of minimal pseudo-intents and show that recognizing minimal pseudo-intents is polynomial. Despite their less complicated nature, surprisingly it turns out that minimal pseudo-intents cannot be enumerated in output-polynomial time unless P=NP. 相似文献
44.
Arnaud Durand 《Discrete Applied Mathematics》2011,159(7):574-580
Graph sandwich problems were introduced by Golumbic et al. (1994) in [12] for DNA physical mapping problems and can be described as follows. Given a property Π of graphs and two disjoint sets of edges E1, E2 with E1⊆E2 on a vertex set V, the problem is to find a graph G on V with edge set Es having property Π and such that E1⊆Es⊆E2.In this paper, we exhibit a quasi-linear reduction between the problem of finding an independent set of size k≥2 in a graph and the problem of finding a sandwich homogeneous set of the same size k. Using this reduction, we prove that a number of natural (decision and counting) problems related to sandwich homogeneous sets are hard in general. We then exploit a little further the reduction and show that finding efficient algorithms to compute small sandwich homogeneous sets would imply substantial improvement for computing triangles in graphs. 相似文献
45.
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less than or equal to a given constant is NP-complete (although this was conjectured to be polynomial). Consequently, the corresponding problem to determine the hamiltonian index of a given graph is NP-hard. Finally, we show that some known upper and lower bounds on the hamiltonian index can be computed in polynomial time. 相似文献
46.
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling 总被引:1,自引:0,他引:1
We extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i’s cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is NP-hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations. 相似文献
47.
We study domain theoretic properties of complexity spaces. Although the so-called complexity space is not a domain for the usual pointwise order, we show that, however, each pointed complexity space is an ω-continuous domain for which the complexity quasi-metric induces the Scott topology, and the supremum metric induces the Lawson topology. Hence, each pointed complexity space is both a quantifiable domain in the sense of M. Schellekens and a quantitative domain in the sense of P. Waszkiewicz, via the partial metric induced by the complexity quasi-metric. 相似文献
48.
49.
Tommaso Moraschini 《Annals of Pure and Applied Logic》2019,170(7):805-824
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and protoalgebraic logics. Finally, the same problem for the class of truth-equational logic is shown to be hard for EXPTIME. 相似文献
50.
The efficient evaluation of multivariate polynomials at many points is an important operation for polynomial system solving. Kedlaya and Umans have recently devised a theoretically efficient algorithm for this task when the coefficients are integers or when they lie in a finite field. In this paper, we assume that the set of points where we need to evaluate is fixed and “sufficiently generic”. Under these restrictions, we present a quasi-optimal algorithm for multi-point evaluation over general fields. We also present a quasi-optimal algorithm for the opposite interpolation task. 相似文献