Polynomial time

Part 2 book "Control engineering" includes content: Design of conventional regulators; control systems with state feedback; general polynomial method for controller design; sampled data control systems; sampled data controller design for stable discrete time processes; design of conventional sampled data regulators;state feedback in sampled data systems; general polynomial method for the design of discrete time controllers; outlook.

250p muasambanhan06 01-02-2024 8 2   Download

This paper is concerned with two salient allocation problems in fair division of indivisible goods, aiming at maximizing egalitarian and Nash product social welfare. These problems are computationally NP-hard, meaning that achieving polynomial time algorithms is impossible, unless P = NP.

11p visystrom 22-11-2023 10 4   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

Continued part 1, part 2 of ebook "Control engineering: MATLAB exercises" has presents the following content: PID regulator design; state feedback control; general polynomial method for regulator design; analysis of sampled-data systems; discrete regulator design for stable processes; design of discrete pid regulators; state feedback in sampled systems; general polynomial method to design discrete regulators; case study;...

137p dieptieuung 20-07-2023 4 1   Download

Model Predictive Control (MPC) refers to a class of algorithms that optimize the future behavior of the plant subject to operational constraints. The merits of the class algorithms include its ability to handle imposed hard constraints on the system and perform on-line optimization. This thesis investigates design and implementation of continuous time model predictive control using Laguerre polynomials and extends the design approaches proposed in to include intermittent predictive control, as well as to include the case of the nonlinear predictive control.

162p runthenight07 01-03-2023 6 3   Download

We consider the motion of a viscous imcompressible fluid past a rotating rigid body in threedimensional, where the translational and angular velocities of the body are prescribed but time-dependent. In a reference frame attached to the body, we have the non-autonomous OseenNavier-Stokes equations in a fixed exterior domains.

8p viporsche 25-10-2022 7 2   Download

In this paper, we propose a method to build up solutions (state functions) of the control systems, which transfers the system from any initial conditions in to any final conditions and at the same time satisfies conditions given to the controllability function u(t) which makes it possible to find in the type of polynomials of degree ((p + 1)(k + 2)-1) with vector coefficients.

4p vilexus 05-10-2022 8 2   Download

The aim of this article is to prove that, solution x(t) (state function) of the linear stationary dynamic system x(t) = Bx(t) + Du(t), which transfers the system from any initial conditions in to any final conditions and at the same time satisfies conditions given for the controllability function u(t) is possible to find in the type of polynomials of degree r + (k + 2)(p + 1)-1 with vector coefficients.

4p vilexus 30-09-2022 8 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 44: NP completeness. In this lecture we will cover the following: NP completeness; polynomial time algorithms; decision and optimization problems; nondeterministic problems; nondeterministic algorithm; boolean combinational circuit; NP-completeness proof basis;...

35p andromedashun 26-05-2022 8 1   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 23. The main topics covered in this lesson include: the class NP; polynomial time verifiers; examples of problems in NP; non-deterministic TM; non-deterministic polynomial time algorithm; polynomial time non-deterministic turing machies;...

28p andromedashun 26-05-2022 6 1   Download

Theory of Computation: Lecture 24. The main topics covered in this lesson include: the class NP; verifiers and alternate characterization of NP like hampath, clique, subset sum problem; another characterization of the class NP; P vs. NP question; Cook-Levin theorem (statement only); polynomial time reducibility;...

30p andromedashun 26-05-2022 10 1   Download

Theory of Computation: Lecture 25. The main topics covered in this lesson include: verification algorithms; subsetsum problem; alternate characterization of NP; the P versus NP question; polynomial time reducibility; NP completeness; satisfiability; Cook-Levin theorem;...

29p andromedashun 26-05-2022 7 1   Download

Theory of Computation: Lecture 26. The main topics covered in this lesson include: NP-completness; satisfiability; Cook-Levin theorem; 3-colorable; translation algorithm; polynomial-time reducibility; non-deterministic turing machines;...

34p andromedashun 26-05-2022 7 1   Download

Theory of Computation: Lecture 27. The main topics covered in this lesson include: satisfiability; verification algorithm; Cook-Levin theorem; non-deterministic Turing machine; non-deterministic polynomial time; schematic diagram;...

30p andromedashun 26-05-2022 8 1   Download

Theory of Computation: Lecture 28. The main topics covered in this lesson include: the Cook-Levin theorem; polynomial time; propositional logic; algorithm computes a function in polynomial time; polynomial time reducibility;...

30p andromedashun 26-05-2022 3 1   Download

Theory of Computation: Lecture 29-30. The main topics covered in this lesson include: NP-completeness; Cook-Levin theorem; polynomial time reducible; conjunctive normal form (CNF); verification algorithm; independent sets;...

50p andromedashun 26-05-2022 5 1   Download

Theory of Computation: Lecture 30-31. The main topics covered in this lesson include: NP-completeness; propositional logic; independent sets; verification algorithm; Cook-Levin theorem; polynomial time; clique; graph theory;...

50p andromedashun 26-05-2022 9 1   Download