19th Ave New York, NY 95822, USA

# 数学代考|计算复杂性理论代写computational complexity theory代考|Polynomial-Time Isomorphism

my-assignmentexpert™计算复杂性理论computational complexity theory作业代写，免费提交作业要求， 满意后付款，成绩80\%以下全额退款，安全省心无顾虑。专业硕 博写手团队，所有订单可靠准时，保证 100% 原创。my-assignmentexpert™， 最高质量的计算复杂性理论computatiknal complexity theory作业代写，服务覆盖北美、欧洲、澳洲等 国家。 在代写价格方面，考虑到同学们的经济条件，在保障代写质量的前提下，我们为客户提供最合理的价格。 由于统计Statistics作业种类很多，同时其中的大部分作业在字数上都没有具体要求，因此计算复杂性理论computational complexity theory作业代写的价格不固定。通常在经济学专家查看完作业要求之后会给出报价。作业难度和截止日期对价格也有很大的影响。

my-assignmentexpert™ 为您的留学生涯保驾护航 在数学Mathematics作业代写方面已经树立了自己的口碑, 保证靠谱, 高质且原创的数学Mathematics代写服务。我们的专家在计算复杂性理论computational complexity theory代写方面经验极为丰富，各种计算复杂性理论computational complexity theory相关的作业也就用不着 说。

## 数学代考|计算复杂性理论代写computatiknal complexity theory代考|Polynomial-Time Isomorphism

Recall the decision problems IS and CLIQUE from Chapter 2:
INDEPENDENT SET (IS): Given a graph $G$ and an integer k>0, determine whether G has an independent set of size at least k.

CLIQUE: Given a graph G and an integer k>0, determine whether G has a clique of size at least k.
For any graph G=(V, E), let the complement graph G^{c} of G be the graph that has the same vertex set V but has the edge set $E^{\prime}={{u, v}: u, v \in G,{u, v} \notin E}$. It is clear that a subset $A$ of vertices is an independent set of a graph $G=(V, E)$ if and only if the complement graph $G^{c}$ of $G$ has a clique on subset $A$. Thus, a graph $G$ has an independent set of size k if and only if its complement $G^{c}$ has a clique of size k. That is, there is a bijection (i.e., a one-to-one and onto mapping) f between the inputs of these problems: f(G, k)=\left(G^{c}, k\right) such that IS $\leq_{m}^{P}$ CLIQUE via f and CLIQUE $\leq_{m}^{P}$ IS via $f^{-1}$. In other words, these two problems are not only reducible to each other by the polynomial-time many-one reductions but are also equivalent to each other through polynomial-time computable bijections. We say that they are polynomial-time isomorphic to each other.

We now give the formal definition of the notion of polynomial-time isomorphism.

We have seen, in the last section, an example of improving the $\leq_{m}^{P}$ reductions to $\leq_{i n v, l i}^{P}$-reductions, which allows us to get the $p$-isomorphism between two $N P$-complete problems. This technique is, however, still not simple enough because, to prove that $n N P$-complete problems are all $p$-isomorphic to each other, we need to construct $n(n-1) \leq_{i n v, l i}^{P}{ }^{-}$ reductions. In this section, we present a more general technique that further simplifies the task.

## 数学代考|计算复杂性理论代写computatiknal complexity theory代考|Density of NP-Complete Sets

We established, in the last section, a proof technique with which we were able to show that many natural N P-complete languages are $p$-isomorphic to SAT. This proof technique is, however, not strong enough to settle the Berman-Hartmanis conjecture, as we do not know whether every N P complete set is paddable. Indeed, we observe that if all N P-complete sets are p-isomorphic to each other, then P \neq N P. To see this, we observe that a finite set cannot be $p$-isomorphic to an infinite set. Thus, if the BermanHartmanis conjecture is true, then every nonempty finite set is in P but is not N P-complete and, hence, is a witness for P \neq N P. From this simple observation, we see that it is unlikely that we can prove the BermanHartmanis conjecture without a major breakthrough. Nevertheless, one might still gain some insight into the structure of the N P-complete problems through the study of this conjecture. In this section, we investigate the density of N P-complete problems and provide more support for the conjecture.

The density or the census function of a language A is a function $C_{A}: N \rightarrow N$ defined by $C_{A}(n)=|{x \in A:|x| \leq n}|$, that is, $C_{A}(n)=\left|A_{\leq n}\right|$. Recall that a language A is sparse if there exists a polynomial q such that for every $n \in N, C_{A}(n) \leq q(n)$.

## 数学代考|计算复杂性理论代写COMPUTATIKNAL COMPLEXITY THEORY代考|POLYNOMIAL-TIME ISOMORPHISM

CLIQUE：给定一个图 G 和一个整数 k>0，确定 G 是否有一个大小至少为 k 的 clique。

## Matlab代写

MATLAB 是一种用于技术计算的高性能语言。它将计算、可视化和编程集成在一个易于使用的环境中，其中问题和解决方案以熟悉的数学符号表示。典型用途包括：数学和计算算法开发建模、仿真和原型制作数据分析、探索和可视化科学和工程图形应用程序开发，包括图形用户界面构建MATLAB 是一个交互式系统，其基本数据元素是一个不需要维度的数组。这使您可以解决许多技术计算问题，尤其是那些具有矩阵和向量公式的问题，而只需用 C 或 Fortran 等标量非交互式语言编写程序所需的时间的一小部分。MATLAB 名称代表矩阵实验室。MATLAB 最初的编写目的是提供对由 LINPACK 和 EISPACK 项目开发的矩阵软件的轻松访问，这两个项目共同代表了矩阵计算软件的最新技术。MATLAB 经过多年的发展，得到了许多用户的投入。在大学环境中，它是数学、工程和科学入门和高级课程的标准教学工具。在工业领域，MATLAB 是高效研究、开发和分析的首选工具。MATLAB 具有一系列称为工具箱的特定于应用程序的解决方案。对于大多数 MATLAB 用户来说非常重要，工具箱允许您学习应用专业技术。工具箱是 MATLAB 函数（M 文件）的综合集合，可扩展 MATLAB 环境以解决特定类别的问题。可用工具箱的领域包括信号处理、控制系统、神经网络、模糊逻辑、小波、仿真等。