7. Consider the following decision problem on satisfying inequalities. Let A be an integer m x n matrix. Let b be a vector of length m where each coordinate is an integer. You need to decide whether there exists a vector x of length n such that each of its 0 -3] and b = -1 coordinates is 0 or 1 and Ax ≤ b. For example, let A = M -8 H inequalities is NP-Complete. (Hint: Provide a polynomial-time reduction from 3CNF- SAT problem.) Then x = satisfies Ax ≤ b. Show that the problem of satisfying (integer)

7. Consider the following decision problem on satisfying inequalities. Let A be an integer m x n matrix. Let b be a vector of length m where each coordinate is an integer. You need to decide whether there exists a vector x of length n such that each of its 0 -3] and b = -1 coordinates is 0 or 1 and Ax ≤ b. For example, let A = M -8 H inequalities is NP-Complete. (Hint: Provide a polynomial-time reduction from 3CNF- SAT problem.) Then x = satisfies Ax ≤ b. Show that the problem of satisfying (integer)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Let A = {z € Z]z > 5}, B = {z € Z\z ≤ 2}. (a) Find AUB. (b) Find An B (c) Find A - B (d) Find Be
MUST BE DONE IN PHYTON
In this problem, we consider the class of n-dimensional axis-aligned boxes. Each function c in this class is specified by aset of 2n values ℓ1, . . . , ℓn and u1, . . . , un in [0, 1], which defines an axis-aligned n-dimensional box. Given an n-dimensionalinput vector x, c(x) is defined to be 1 (or ‘+’) if for every i ∈ {1, . . . , n} the i’th coordinate of x lies in [ℓi, ui]. Otherwise,c(x) is defined to be 0 (or ‘-’) .An example of a 2-dimensional axis-aligned box is shown in the figure below. (a) Let C be the class of n-dimensional axis-aligned boxes, and c ∈ C be the unknown target function. State an efficientalgorithm that takes as input an arbitrary set of points x1, x2, . . . , xm each a point in n-dimensional space, and theircorresponding labels c(x1), c(x2), . . . , c(xm), and outputs a function h ∈ C that is consistent with this data. Youralgorithm should run in polynomial time in m, n and facilitate answering part (b) below. Let D be an arbitrary, unknown distribution, and…
37
Knapsack 0/1 problem: Given N items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at most W weight in it]. The task is to put the items into the bag such that the sum of profits associated with them is the maximum possible. Given the problem is solved using a dynamic programming approach and the matrix derived is given below, answer the below set of questions by analyzing the DP matrix. weights = [2, 3, 4, 5], profits = [1, 2, 5, 6], Capacity W = 8 Capacity 2 3 Profits weights|0 1 2 5 16 14 |-> 5 10 0 O 10 1 2 3 4 0 O 0 1 1 0 1 0 1 O 10 1 2 2 2 5 2 O 15 50 1 356 6 O 1 3 6 18 00378 7 10 10 1 3 7 7 1 18
Consider the following code:> x <- matrix(rnorm(n = 500), ncol = 5)> varx <- var(x)Starting with varx, use two applications of the sweep() function, one dividing each row of the matrix andthe other dividing each column, of a covariance matrix to obtain R, the correlation matrix.
3. Let A = 10-16 1 (¹0 1) 1 1 and b = 2 3 Here we will see the effect of using a tiny element as a pivot. = (a) By hand, solve the linear system Ax X1 b exactly. Write your answer in a form where it is clear what the approximate values of x₁ and x² are. (b) In MATLAB, enter the matrix A and type cond (A) to determine the 2-norm condition number of A. Would you say that this matrix is well conditioned or ill conditioned in the 2-norm? (c) Write a MATLAB code (or use one from the text) that does not do partial pivoting to solve the linear system Ax = b. Compare the answer returned by this code to the one that you determined by hand