Polynomial complexity

This paper proposes an efficient method to determine entire reducts of incomplete decision tables according to the relational database approach. In the complex case, this algorithm has exponential computational complexity. However, this algorithm has polynomial computational complexity in the different cases of databases.

9p dianmotminh02 03-05-2024 3 1   Download

Part 2 book "Kinetics of chemical reactions - Decoding complexity" includes contents: Linear and nonlinear relaxation - stability; nonlinear mechanisms - steady state and dynamics; kinetic polynomials; temporal analysis of products - principles, applications and theory; joint kinetics; decoding the past; decoding the future.

348p muasambanhan09 16-03-2024 6 0   Download

Ebook "Introduction to complexity theory" includes content: The P vs NP question; NP-completeness and self reducibility; more on NP and some on DTIME; space complex; Non-Deterministic space; inside non-deterministic logarithmic space, randomized computations - non uniform polynomial time, the polynomial hierarchy; the counting class,... and other contents.

375p haojiubujain07 20-09-2023 6 2   Download

Ebook "The computational complexity of machine learning" includes content: Denitions and motivation for distribution free learning, recent research in computational learning theory, tools for distribution free learning, learning in the presence of errors, lower bounds on sample complexity, cryptographic limitations on polynomial time learning, distribution speci c learning in polynomial time, equivalence of weak learning and group learning, conclusions and open problems.

176p haojiubujain07 20-09-2023 9 2   Download

Part 1 of ebook "Higher mathematics for Physics and Engineering" provides readers with contents including: conditional statements; real analysis; real sequences and series; real functions; functional analysis; hilbert spaces; orthonormal polynomials; lebesgue integrals; complex analysis; complex functions; singularity and continuation; contour integrals; conformal mapping;...

359p lytamnguyet 04-08-2023 5 4   Download

In 1850, Puiseux solved the problem of finding roots of complex polynomials in two variables and proved that the field of these series is algebraically closed. His proof provided an algorithm constructing the roots.

13p viberkshire 09-08-2023 7 4   Download

Ebook College algebra (9th edition): Part 1 includes the following content: Chapter 1 equations and inequalities, chapter 2 graphs, chapter 3 functions and their graphs, chapter 4 linear and quadratic functions, chapter 5 polynomial and rational functions. Please refer to the documentation for more details.

432p haojiubujain01 06-06-2023 6 2   Download

The paper proposes a low latency BCH decoder with low complexity using parallel computation and simplifying locating errors by finding the roots of the affine polynomial over finite fields. The proposed design can be implemented on low-cost hardware platforms while applicable in very low latency information systems.

9p visirius 19-01-2023 6 4   Download

This book "Computational complexity: A modern approach" aims to describe such recent achievements of complexity theory in the context of more classical results. It is intended to both serve as a textbook and as a reference for self-study. Part 1 of book provide students with knowledge about: basic complexity classes; the computational model - and why it doesn’t matter; NP and NP completeness; the polynomial hierarchy and alternations;...

240p britaikridanik 05-07-2022 22 4   Download

Advanced Algorithms Analysis and Design - Lecture 43: Polynomials and fast fourier transform. In this lecture we will cover the following: the coefficient representation; point value presentation; discrete fourier transform; complex root of unity; FFT recursive algorithm;...

34p andromedashun 26-05-2022 12 3   Download

Theory of Computation: Lecture 22. The main topics covered in this lesson include: non-deterministic time; the class P; the class NP; time complexity classes; time deterministic single tape TM; polynomial time algorithm; adjacency matrix; adjacency list; non-deterministic analog;...

40p andromedashun 26-05-2022 6 1   Download

Theory of Computation: Lecture 34. The main topics covered in this lesson include: three versions of the TSP problem; an approximation algorithm for the TSP problem; space complexity; polynomial time algorithm; the euclidean TSP;...

33p andromedashun 26-05-2022 9 1   Download

Theory of Computation: Lecture 39. The main topics covered in this lesson include: space complexity; true fully quantified boolean formula (TQBF); prove that TQBF is PSPACE-complete; other PSPACE-complete problems; polynomial space;...

29p andromedashun 26-05-2022 9 1   Download

Theory of Computation: Lecture 41. The main topics covered in this lesson include: space complexity; generalized geography; polynomial time algorithm; algorithm requires polynomial space; the existentially quantified variables; the universally quantified variables;...

30p andromedashun 26-05-2022 43 1   Download

Theory of Computation: Lecture 42. The main topics covered in this lesson include: space complexity; new complexity classes; interesting space complexity classes; non-deterministic analogue; Savatich’s theorem; polynomial time reducibility;...

38p andromedashun 26-05-2022 54 1   Download

The following will be discussed in this chapter: Complexity Theory, Decision Problems, Complexity Classes, Polynomial Time Verification, The Class NP, Reductions, Polynomial Time Reduction, NP-Completeness, Boolean Satisfiability Problem: Cook’s Theorem.

35p youzhangjing_1909 28-04-2022 7 1   Download

In this paper, we present a novel global protein-protein interaction network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art algorithms. Furthermore, the complexity of ours is polynomial, thus being scalable to large biological networks in practice.

11p tamynhan4 06-09-2020 13 3   Download

This substantially reduces the computation effort and numerical complexity. Computational results reveal that Jaya algorithm is efficient in most cases and has considerable potential for permutation flow-shop scheduling problems.

14p toritori 11-05-2020 13 0   Download

We give an algorithm to compute the generalized division polynomials for elliptic curves with complex multiplication. These polynomials can be used to generate the ray class fields of imaginary quadratic fields over the Hilbert class field with no restriction on the conductor.

9p danhdanh27 07-01-2019 20 2   Download

In this paper, we intend to study idempotents of the Green algebra (complexified Green ring) of any finite dimensional pointed rank one Hopf algebra of nilpotent type over the complex number field. We first determine all one dimensional representations of the quotient algebra of the Green algebra modulo its Jacobson radical.

17p danhdanh27 07-01-2019 15 2   Download