Sentence examples for the equivalence problem from inspiring English sources

Using a functional analytic approach, we give several surprising equivalent formulations for the equivalence problem, which reveal a deep connection to several fundamental problems in the integral geometry of the Grassmann manifold.

This could reduce the equivalence problem.

The explanation of the equivalence problem is given as follows.

However, due to the equivalence problem, the result obtained with these methods may be not unique.

As another application, we establish that the equivalence problem for extended single-string automata, known to express the equality of time granularities, is PSPACE-complete by designing a reduction from QBF and by using our results for PLTLmod.

Firstly, the derivation and the performance of the three POD methods: Karhunen Loève decomposition (KLD), principal component analysis (PCA), and singular value decomposition (SVD) are summarized, then the equivalence problem is discussed via a theoretical comparison among the three methods.

Our results suggest a natural analogue of the Shift Equivalence Problem in the context of C⁎-correspondences.

Finally, CBGA is applied to successfully solve the stiffness equivalence problem of the small-aspect-ratio aircraft wing to tapered beam.

(d) We say that a machine (M') polynomially reduces (resp. is polynomially equivalent) to a machine M if the configuration equivalence problem of (M') polynomially reduces (resp. is polynomiall equivalent) to the configuration equivalence problem for M.  .

We say that a machine (M') polynomially reduces (resp. is polynomially equivalent) to a machine M if the configuration equivalence problem of (M') polynomially reduces (resp. is polynomiall equivalent) to the configuration equivalence problem for M. A deterministic machine M is called universally halting if it does not have infinitely long computations (see [8]).

Thus we just need to modify the Minsky machine ( MM _4) so that the new machine ( MM _m), (m>4), has the same complexity of the configuration equivalence problem but time function larger than (g(n^4)).