共查询到20条相似文献,搜索用时 31 毫秒
1.
The asymptotic behavior of the -entropy of ellipsoids in an n-dimensional Hamming space whose coefficients take only two different values is investigated as n . Explicit expressions for the main terms of the asymptotic expansion of -entropy of such ellipsoids are obtained under various relations between and parameters that define these ellipsoids. 相似文献
2.
Abstract Standard error estimates in the literature for finite element approximations of nonstationary convection-diffusion problems depend either reciprocally on the diffusion parameter or on higher order norms of the solution. Therefore, the estimates generally become worthless in the convection-dominated case with 0 < 1. In this work we develop a rigorous -uniform convergence theory for finite element discretizations of convection-dominated diffusion problems in Eulerian and Lagrangian coordinates. Here, the constants that arise in the error estimates depend on norms of the data and not of the solution and remain bounded in the hyperbolic limit 0. In particular in the Lagrangian case this requires modifications to standard finite element error analyses. In the Eulerian formulation -uniform convergence of order one half is proven whereas in the Lagrangian framework -uniform convergence of optimal order is established. The estimates are based on -uniform a priori estimates for the solution of the continuous problems which are derived first. 相似文献
3.
This paper is a study of the existence of polynomial time Boolean connective functions for languages. A languageL has an AND function if there is a polynomial timef such thatf(x,y) L x L andy L. L has an OR function if there is a polynomial timeg such thatg(x,y) xL oryL. While all NP complete sets have these functions, Graph Isomorphism, which is probably not complete, is also shown to have both AND and OR functions. The results in this paper characterize the complete sets for the classes Dp and pSAT[O(logn)] in terms of AND and OR and relate these functions to the structure of the Boolean hierarchy and the query hierarchies. Also, this paper shows that the complete sets for the levels of the Boolean hierarchy above the second level cannot have AND or OR unless the polynomial hierarchy collapses. Finally, most of the structural properties of the Boolean hierarchy and query hierarchies are shown to depend only on the existence of AND and OR functions for the NP complete sets.The first author was supported in part by NSF Research Grants DCR-8520597 and CCR-88-23053, and by an IBM Graduate Fellowship. 相似文献
4.
The basic problem of interval computations is: given a function f(x
1,..., x
n) and n intervals [x
i, x
i], find the (interval) range yof the given function on the given intervals. It is known that even for quadratic polynomials f(x
1,..., x
n), this problem is NP-hard. In this paper, following the advice of A. Neumaier, we analyze the complexity of asymptotic range estimation, when the bound on the width of the input intervals tends to 0. We show that for small c > 0, if we want to compute the range with an accuracy c 2, then the problem is still NP-hard; on the other hand, for every > 0, there exists a feasible algorithm which asymptotically, estimates the range with an accuracy c 2–. 相似文献
5.
Dimitris Fotakis Rasmus Pagh Peter Sanders Paul Spirakis 《Theory of Computing Systems》2005,38(2):229-248
We generalize Cuckoo Hashing to d-ary Cuckoo
Hashing and show how this yields a simple hash table data structure that
stores n elements in (1 + )n memory cells, for any constant >
0. Assuming uniform hashing, accessing or deleting table entries takes at
most d=O (ln (1/)) probes and the expected amortized insertion
time is constant. This is the first dictionary that has worst case
constant access time and expected constant update time, works with
(1 + )n space, and supports satellite information. Experiments
indicate that d = 4 probes suffice for 0.03.
We also describe variants of the data structure
that allow the use of hash functions that can be evaluated in constant time. 相似文献
6.
Ulrich Huckenbeck 《Theory of Computing Systems》1992,25(1):3-22
The termF-cardinality of (=F-card()) is introduced whereF:
n
n
is a partial function and is a set of partial functionsf:
n
n
. TheF-cardinality yields a lower bound for the worst-case complexity of computingF if only functionsf can be evaluated by the underlying abstract automaton without conditional jumps. This complexity bound isindependent from the oracles available for the abstract machine. Thus it is shown that any automaton which can only apply the four basic arithmetic operations needs (n logn) worst-case time to sortn numbers; this result is even true if conditional jumps witharbitrary conditions are possible. The main result of this paper is the following: Given a total functionF:
n
n
and a natural numberk, it is almost always possible to construct a set such that itsF-cardinality has the valuek; in addition, can be required to be closed under composition of functionsf,g . Moreover, ifF is continuous, then consists of continuous functions. 相似文献
7.
The problem is considered of efficient test design for combinational devices with large numbern of input variables, where each output depends on at mosts input variables. It is shown that the number of test patterns can be reduced drastically if we allow a small fraction of all possible outputs not to be tested exhaustively. The effect holds even if approaches zero with the increase ofn. Upper and lower bounds for the number of test patterns in such tests (called (, s)-exhaustive tests) are derived and constructions of the tests are suggested. 相似文献
8.
Summary Geffert has shown that earch recursively enumerable languageL over can be expressed in the formL{h(x)
–1
g(x)x in
+}
* where is an alphabet andg, h is a pair of morphisms. Our purpose is to give a simple proof for Geffert's result and then sharpen it into the form where both of the morphisms are nonerasing. In our method we modify constructions used in a representation of recursively enumerable languages in terms of equality sets and in a characterization of simple transducers in terms of morphisms. As direct consequences, we get the undecidability of the Post correspondence problem and various representations ofL. For instance,L =(L
0)
* whereL
0 is a minimal linear language and is the Dyck reductiona, A. 相似文献
9.
In this paper, we study the complexity of computing better solutions to optimization problems given other solutions. We use a model of computation suitable for this purpose, the counterexample computation model. We first prove that, if PH
P
3
, polynomial time transducers cannot compute optimal solutions for many problems, even givenn
1–
non-trivial solutions, for any >0. These results are then used to establish sharp lower bounds for several problems in the counterexample model. We extend the model by defining probabilistic counterexample computations and show that our results hold even in the presence of randomness. 相似文献
10.
W. Bucher 《Acta Informatica》1986,23(3):245-253
Summary A dual bordered OS system is a triple (, P, S) where is a finite alphabet, S a finite subset of *, the set of axioms, and P a finite set of rules of the form aa × a, where a and x
*. Using well-quasi-order theory, we show that the regularity problem for such systems is decidable. Whether such a system generates a regular language essentially only depends on the set of rules but not on the axioms. 相似文献
11.
A problem of estimating a functional parameter (x) and functionals () based on observation of a solution u
(t, x) of the stochastic partial differential equation
is considered. The asymptotic problem setting, as the noise intensity 0, is investigated. 相似文献
12.
Kolmogorov introduced the concept of -entropy to analyze information in classical continuous systems. The fractal dimension of a geometric set was introduced by Mandelbrot as a new criterion to analyze the geometric complexity of the set. The -entropy and the fractal dimension of a state in a general quantum system were introduced by one of the present authors (MO) in order to characterize chaotic properties of general states.In this paper, we show that -entropy of a state includes Kolmogorov's -entropy, and that the fractal dimension of a state describes fractal structure of Gaussian measures. 相似文献
13.
Ueli M. Maurer 《Computational Complexity》1995,5(3-4):237-247
The problem of factoring integers in polynomial time with the help of an infinitely powerful oracle who answers arbitrary questions with yes or no is considered. The goal is to minimize the number of oracle questions. LetN be a given compositen-bit integer to be factored, wheren = log2
N. The trivial method of asking for the bits of the smallest prime factor ofN requiresn/2 questions in the worst case. A non-trivial algorithm of Rivest and Shamir requires onlyn/3 questions for the special case whereN is the product of twon/2-bit primes. In this paper, a polynomial-time oracle factoring algorithm for general integers is presented which, for any >0, asks at most n oracle questions for sufficiently largeN, thus solving an open problem posed by Rivest and Shamir. Based on a plausible conjecture related to Lenstra's conjecture on the running time of the elliptic curve factoring algorithm, it is shown that the algorithm fails with probability at mostN
–/2 for all sufficiently largeN. 相似文献
14.
E. A. Nurminskii 《Cybernetics and Systems Analysis》2002,38(4):615-617
The paper presents one more global interrelation between the values of a convex function and its -subdifferential. A direct consequence of this interrelation is the proof of the fact that functions with identical -subdifferentials have an identical limit behavior. 相似文献
15.
We study path integration on a quantum computer that performs quantum summation. We assume that the measure of path integration is Gaussian, with the eigenvalues of its covariance operator of order j-k with k>1. For the Wiener measure occurring in many applications we have k=2. We want to compute an -approximation to path integrals whose integrands are at least Lipschitz. We prove: Path integration on a quantum computer is tractable. Path integration on a quantum computer can be solved roughly -1 times faster than on a classical computer using randomization, and exponentially faster than on a classical computer with a worst case assurance. The number of quantum queries needed to solve path integration is roughly the square root of the number of function values needed on a classical computer using randomization. More precisely, the number of quantum queries is at most 4.46 -1. Furthermore, a lower bound is obtained for the minimal number of quantum queries which shows that this bound cannot be significantly improved. The number of qubits is polynomial in -1. Furthermore, for the Wiener measure the degree is 2 for Lipschitz functions, and the degree is 1 for smoother integrands.
PACS: 03.67.Lx; 31.15Kb; 31.15.-p; 02.70.-c 相似文献
16.
V. V. Masol 《Cybernetics and Systems Analysis》2002,38(6):938-942
The paper considers an N × n matrix (N n) over a field GF(2) that consists of random values with a distribution depending on a small parameter . The expansion is found in terms of the power of the parameter of the probability that the matrix rank is equal to n. Exact values of the first three coefficients are indicated. 相似文献
17.
We develop a quasi-polynomial time approximation scheme for the Euclidean version of the
Degree-Restricted MST Problem by adapting techniques used previously by Arora for approximating TSP.
Given n points in the plane, d = 3 or 4, and > 0, the scheme finds an approximation with cost within 1 +
of the lowest cost spanning tree with the property that all nodes have degree at most d.
We also develop a polynomial time approximation scheme for the Euclidean version of the Red–Blue
Separation Problem, again extending Aroras techniques. Given > 0, the scheme finds an approximation
with cost within 1+ of the cost of the optimum separating polygon of the input nodes, in nearly linear time. 相似文献
18.
John P. Boyd 《Journal of scientific computing》1988,3(2):109-120
Domain truncation is the simple strategy of solving problems ony [-, ] by using a large but finite computational interval, [– L, L] Sinceu(y) is not a periodic function, spectral methods have usually employed a basis of Chebyshev polynomials,T
n(y/L). In this note, we show that becauseu(±L) must be very, very small if domain truncation is to succeed, it is always more efficient to apply a Fourier expansion instead. Roughly speaking, it requires about 100 Chebyshev polynomials to achieve the same accuracy as 64 Fourier terms. The Fourier expansion of a rapidly decaying but nonperiodic function on a large interval is also a dramatic illustration of the care that is necessary in applying asymptotic coefficient analysis. The behavior of the Fourier coefficients in the limitn for fixed intervalL isnever relevant or significant in this application. 相似文献
19.
Scheduling Malleable Parallel Tasks:
An Asymptotic Fully Polynomial Time Approximation Scheme 总被引:2,自引:0,他引:2
A malleable parallel task is one whose execution time is a
function of the number of (identical) processors allotted to it.
We study the problem of scheduling a set of n independent
malleable tasks on an arbitrary number m of parallel processors
and propose an asymptotic fully polynomial time approximation
scheme. For any fixed > 0, the algorithm computes a
non-preemptive schedule of length at most (1+) times the
optimum (plus an additive term) and has running time polynomial in
n,m and 1 /. 相似文献
20.
Optimal shape design problems for an elastic body made from physically nonlinear material are presented. Sensitivity analysis is done by differentiating the discrete equations of equilibrium. Numerical examples are included.Notation
U
ad
set of admissible continuous design parameters
-
U
h
ad
set of admissible discrete design parameters
-
function fromU
h
ad
defining shape of body
-
h
function fromU
h
ad
defining approximated shape of body
-
vector of nodal values of
h
- {
n}
sequence of functions tending to
-
()
domain defined by
-
K
bulk modulus
-
shear modulus
-
penalty parameter for contact condition
-
V()
space of virtual displacements in()
-
V
h(h)
finite element approximation ofV()
-
J
cost functional
-
J
h
discretized cost functional
-
J
algebraic form ofJ
h
-
(u)
stress tensor
-
e(u)
strain tensor
- K
stiffness matrix
- f
force vector
- b(q)
term arising from nonlinear boundary conditions
- q
vector of nodal degrees of freedom
- p
vector of adjoint state variables
- J
Jacobian of isoparametric mapping
- |J|
determinant ofJ
- N
vector of shape function values on parent element
- L
matrix of shape function derivatives on parent element
- G
matrix of Cartesian derivatives of shape functions
- X
matrix of nodal coordinates of element
- D
matrix of elastic coefficients
- B
strain-displacement matrix
-
P
part of boundary where tractions are prescribed
-
u
part of boundary where displacements are prescribed
-
variable part of boundary
-
strain invariant 相似文献