首页 > 最新文献
paperpass

Information Technology Convergence and Services最新文献

英文 中文
Communication Complexity of Inner Product in Symmetric Normed Spaces 对称赋范空间内积的通信复杂度
Pub Date : 2022-11-24 DOI: 10.48550/arXiv.2211.13473
Alexandr Andoni, Jarosław Błasiok, Arnold Filtser
We introduce and study the communication complexity of computing the inner product of two vectors, where the input is restricted w.r.t. a norm $N$ on the space $mathbb{R}^n$. Here, Alice and Bob hold two vectors $v,u$ such that $|v|_Nle 1$ and $|u|_{N^*}le 1$, where $N^*$ is the dual norm. They want to compute their inner product $langle v,u rangle$ up to an $varepsilon$ additive term. The problem is denoted by $mathrm{IP}_N$. We systematically study $mathrm{IP}_N$, showing the following results: - For any symmetric norm $N$, given $|v|_Nle 1$ and $|u|_{N^*}le 1$ there is a randomized protocol for $mathrm{IP}_N$ using $tilde{mathcal{O}}(varepsilon^{-6} log n)$ bits -- we will denote this by $mathcal{R}_{varepsilon,1/3}(mathrm{IP}_{N}) leq tilde{mathcal{O}}(varepsilon^{-6} log n)$. - One way communication complexity $overrightarrow{mathcal{R}}(mathrm{IP}_{ell_p})leqmathcal{O}(varepsilon^{-max(2,p)}cdot logfrac nvarepsilon)$, and a nearly matching lower bound $overrightarrow{mathcal{R}}(mathrm{IP}_{ell_p}) geq Omega(varepsilon^{-max(2,p)})$ for $varepsilon^{-max(2,p)} ll n$. - One way communication complexity $overrightarrow{mathcal{R}}(N)$ for a symmetric norm $N$ is governed by embeddings $ell_infty^k$ into $N$. Specifically, while a small distortion embedding easily implies a lower bound $Omega(k)$, we show that, conversely, non-existence of such an embedding implies protocol with communication $k^{mathcal{O}(log log k)} log^2 n$. - For arbitrary origin symmetric convex polytope $P$, we show $mathcal{R}(mathrm{IP}_{N}) lemathcal{O}(varepsilon^{-2} log mathrm{xc}(P))$, where $N$ is the unique norm for which $P$ is a unit ball, and $mathrm{xc}(P)$ is the extension complexity of $P$.
我们引入并研究了计算两个向量内积的通信复杂度,其中输入是受限的w.r.t.一个范数$N$在空间$mathbb{R}^n$上。这里,Alice和Bob持有两个向量$v,u$,使得$|v|_Nle 1$和$|u|_{N^*}le 1$,其中$N^*$是对偶范数。题目想计算内积$langle v,u rangle$直到$varepsilon$加性项。问题用$mathrm{IP}_N$表示。我们系统地研究$mathrm{IP}_N$,显示以下结果:—对于任何对称规范$N$,给定$|v|_Nle 1$和$|u|_{N^*}le 1$,使用$tilde{mathcal{O}}(varepsilon^{-6} log n)$位的$mathrm{IP}_N$有一个随机协议—我们将用$mathcal{R}_{varepsilon,1/3}(mathrm{IP}_{N}) leq tilde{mathcal{O}}(varepsilon^{-6} log n)$表示。-单向通信复杂度$overrightarrow{mathcal{R}}(mathrm{IP}_{ell_p})leqmathcal{O}(varepsilon^{-max(2,p)}cdot logfrac nvarepsilon)$,和一个接近匹配的下界$overrightarrow{mathcal{R}}(mathrm{IP}_{ell_p}) geq Omega(varepsilon^{-max(2,p)})$对于$varepsilon^{-max(2,p)} ll n$。-单向通信复杂性$overrightarrow{mathcal{R}}(N)$为对称规范$N$是由嵌入$ell_infty^k$到$N$。具体来说,虽然小失真嵌入很容易意味着一个下界$Omega(k)$,但我们表明,相反,不存在这样的嵌入意味着具有通信的协议$k^{mathcal{O}(log log k)} log^2 n$。-对于任意原点对称凸多面体$P$,我们给出$mathcal{R}(mathrm{IP}_{N}) lemathcal{O}(varepsilon^{-2} log mathrm{xc}(P))$,其中$N$是唯一范数,$P$是单位球,$mathrm{xc}(P)$是$P$的扩展复杂度。
{"title":"Communication Complexity of Inner Product in Symmetric Normed Spaces","authors":"Alexandr Andoni, Jarosław Błasiok, Arnold Filtser","doi":"10.48550/arXiv.2211.13473","DOIUrl":"https://doi.org/10.48550/arXiv.2211.13473","url":null,"abstract":"We introduce and study the communication complexity of computing the inner product of two vectors, where the input is restricted w.r.t. a norm $N$ on the space $mathbb{R}^n$. Here, Alice and Bob hold two vectors $v,u$ such that $|v|_Nle 1$ and $|u|_{N^*}le 1$, where $N^*$ is the dual norm. They want to compute their inner product $langle v,u rangle$ up to an $varepsilon$ additive term. The problem is denoted by $mathrm{IP}_N$. We systematically study $mathrm{IP}_N$, showing the following results: - For any symmetric norm $N$, given $|v|_Nle 1$ and $|u|_{N^*}le 1$ there is a randomized protocol for $mathrm{IP}_N$ using $tilde{mathcal{O}}(varepsilon^{-6} log n)$ bits -- we will denote this by $mathcal{R}_{varepsilon,1/3}(mathrm{IP}_{N}) leq tilde{mathcal{O}}(varepsilon^{-6} log n)$. - One way communication complexity $overrightarrow{mathcal{R}}(mathrm{IP}_{ell_p})leqmathcal{O}(varepsilon^{-max(2,p)}cdot logfrac nvarepsilon)$, and a nearly matching lower bound $overrightarrow{mathcal{R}}(mathrm{IP}_{ell_p}) geq Omega(varepsilon^{-max(2,p)})$ for $varepsilon^{-max(2,p)} ll n$. - One way communication complexity $overrightarrow{mathcal{R}}(N)$ for a symmetric norm $N$ is governed by embeddings $ell_infty^k$ into $N$. Specifically, while a small distortion embedding easily implies a lower bound $Omega(k)$, we show that, conversely, non-existence of such an embedding implies protocol with communication $k^{mathcal{O}(log log k)} log^2 n$. - For arbitrary origin symmetric convex polytope $P$, we show $mathcal{R}(mathrm{IP}_{N}) lemathcal{O}(varepsilon^{-2} log mathrm{xc}(P))$, where $N$ is the unique norm for which $P$ is a unit ball, and $mathrm{xc}(P)$ is the extension complexity of $P$.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117159392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Worst-Case to Expander-Case Reductions 从最坏的情况到扩展的情况
Pub Date : 2022-11-23 DOI: 10.48550/arXiv.2211.12833
Amir Abboud, Nathan Wallheimer
In recent years, the expander decomposition method was used to develop many graph algorithms, resulting in major improvements to longstanding complexity barriers. This powerful hammer has led the community to (1) believe that most problems are as easy on worst-case graphs as they are on expanders, and (2) suspect that expander decompositions are the key to breaking the remaining longstanding barriers in fine-grained complexity. We set out to investigate the extent to which these two things are true (and for which problems). Towards this end, we put forth the concept of worst-case to expander-case self-reductions. We design a collection of such reductions for fundamental graph problems, verifying belief (1) for them. The list includes $k$-Clique, $4$-Cycle, Maximum Cardinality Matching, Vertex-Cover, and Minimum Dominating Set. Interestingly, for most (but not all) of these problems the proof is via a simple gadget reduction, not via expander decompositions, showing that this hammer is effectively useless against the problem and contradicting (2).
近年来,扩展器分解方法被用于开发许多图算法,从而大大改善了长期存在的复杂性障碍。这个强大的锤使社区相信(1)大多数问题在最坏情况图上和在扩展器上一样容易,(2)怀疑扩展器分解是打破细粒度复杂性中长期存在的障碍的关键。我们着手调查这两件事在多大程度上是正确的(以及针对哪些问题)。为此,我们提出了最坏情况到扩展情况自约简的概念。我们为基本图问题设计了一个这样的约简集合,验证了它们的信念(1)。该列表包括$k$-Clique, $4$-Cycle,最大基数匹配,顶点覆盖和最小支配集。有趣的是,对于大多数(但不是全部)这些问题的证明是通过一个简单的小工具简化,而不是通过膨胀器分解,表明这个锤子对问题是有效无用的,并且与(2)相矛盾。
{"title":"Worst-Case to Expander-Case Reductions","authors":"Amir Abboud, Nathan Wallheimer","doi":"10.48550/arXiv.2211.12833","DOIUrl":"https://doi.org/10.48550/arXiv.2211.12833","url":null,"abstract":"In recent years, the expander decomposition method was used to develop many graph algorithms, resulting in major improvements to longstanding complexity barriers. This powerful hammer has led the community to (1) believe that most problems are as easy on worst-case graphs as they are on expanders, and (2) suspect that expander decompositions are the key to breaking the remaining longstanding barriers in fine-grained complexity. We set out to investigate the extent to which these two things are true (and for which problems). Towards this end, we put forth the concept of worst-case to expander-case self-reductions. We design a collection of such reductions for fundamental graph problems, verifying belief (1) for them. The list includes $k$-Clique, $4$-Cycle, Maximum Cardinality Matching, Vertex-Cover, and Minimum Dominating Set. Interestingly, for most (but not all) of these problems the proof is via a simple gadget reduction, not via expander decompositions, showing that this hammer is effectively useless against the problem and contradicting (2).","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129172937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Algorithmic Bridge Between Hamming and Levenshtein Distances Hamming距离和Levenshtein距离之间的一种算法桥梁
Pub Date : 2022-11-22 DOI: 10.48550/arXiv.2211.12496
Elazar Goldenberg, T. Kociumaka, Robert Krauthgamer, B. Saha
The edit distance between strings classically assigns unit cost to every character insertion, deletion, and substitution, whereas the Hamming distance only allows substitutions. In many real-life scenarios, insertions and deletions (abbreviated indels) appear frequently but significantly less so than substitutions. To model this, we consider substitutions being cheaper than indels, with cost $1/a$ for a parameter $age 1$. This basic variant, denoted $ED_a$, bridges classical edit distance ($a=1$) with Hamming distance ($atoinfty$), leading to interesting algorithmic challenges: Does the time complexity of computing $ED_a$ interpolate between that of Hamming distance (linear time) and edit distance (quadratic time)? What about approximating $ED_a$? We first present a simple deterministic exact algorithm for $ED_a$ and further prove that it is near-optimal assuming the Orthogonal Vectors Conjecture. Our main result is a randomized algorithm computing a $(1+epsilon)$-approximation of $ED_a(X,Y)$, given strings $X,Y$ of total length $n$ and a bound $kge ED_a(X,Y)$. For simplicity, let us focus on $kge 1$ and a constant $epsilon>0$; then, our algorithm takes $tilde{O}(n/a + ak^3)$ time. Unless $a=tilde{O}(1)$ and for small enough $k$, this running time is sublinear in $n$. We also consider a very natural version that asks to find a $(k_I, k_S)$-alignment -- an alignment with at most $k_I$ indels and $k_S$ substitutions. In this setting, we give an exact algorithm and, more importantly, an $tilde{O}(nk_I/k_S + k_Scdot k_I^3)$-time $(1,1+epsilon)$-bicriteria approximation algorithm. The latter solution is based on the techniques we develop for $ED_a$ for $a=Theta(k_S / k_I)$. These bounds are in stark contrast to unit-cost edit distance, where state-of-the-art algorithms are far from achieving $(1+epsilon)$-approximation in sublinear time, even for a favorable choice of $k$.
字符串之间的编辑距离通常为每个字符的插入、删除和替换分配单位成本,而汉明距离只允许替换。在许多实际场景中,插入和删除(简称索引)经常出现,但明显少于替换。为了对此建模,我们认为替换比索引便宜,参数$age 1$的成本为$1/a$。这个基本的变量,表示为$ED_a$,将经典的编辑距离($a=1$)与汉明距离($atoinfty$)连接起来,导致了有趣的算法挑战:计算$ED_a$的时间复杂度是否在汉明距离(线性时间)和编辑距离(二次时间)之间插值?近似$ED_a$怎么样?我们首先给出了一个简单的确定性精确算法$ED_a$,并进一步证明了它是近最优的假设正交向量猜想。我们的主要结果是一个随机算法,计算$ED_a(X,Y)$的$(1+epsilon)$ -近似值,给定总长度为$n$的字符串$X,Y$和一个边界$kge ED_a(X,Y)$。为简单起见,我们只关注$kge 1$和一个常量$epsilon>0$;那么,我们的算法需要$tilde{O}(n/a + ak^3)$时间。除非$a=tilde{O}(1)$和足够小的$k$,否则这个运行时间在$n$中是次线性的。我们还考虑了一个非常自然的版本,它要求查找$(k_I, k_S)$ -alignment——最多包含$k_I$个索引和$k_S$个替换的对齐。在这种情况下,我们给出了一个精确的算法,更重要的是,给出了一个$tilde{O}(nk_I/k_S + k_Scdot k_I^3)$ -time $(1,1+epsilon)$ -双准则近似算法。后一种解决方案基于我们为$a=Theta(k_S / k_I)$开发的$ED_a$技术。这些界限与单位成本编辑距离形成鲜明对比,在单位成本编辑距离中,最先进的算法远远不能在亚线性时间内实现$(1+epsilon)$ -近似,即使是$k$的有利选择。
{"title":"An Algorithmic Bridge Between Hamming and Levenshtein Distances","authors":"Elazar Goldenberg, T. Kociumaka, Robert Krauthgamer, B. Saha","doi":"10.48550/arXiv.2211.12496","DOIUrl":"https://doi.org/10.48550/arXiv.2211.12496","url":null,"abstract":"The edit distance between strings classically assigns unit cost to every character insertion, deletion, and substitution, whereas the Hamming distance only allows substitutions. In many real-life scenarios, insertions and deletions (abbreviated indels) appear frequently but significantly less so than substitutions. To model this, we consider substitutions being cheaper than indels, with cost $1/a$ for a parameter $age 1$. This basic variant, denoted $ED_a$, bridges classical edit distance ($a=1$) with Hamming distance ($atoinfty$), leading to interesting algorithmic challenges: Does the time complexity of computing $ED_a$ interpolate between that of Hamming distance (linear time) and edit distance (quadratic time)? What about approximating $ED_a$? We first present a simple deterministic exact algorithm for $ED_a$ and further prove that it is near-optimal assuming the Orthogonal Vectors Conjecture. Our main result is a randomized algorithm computing a $(1+epsilon)$-approximation of $ED_a(X,Y)$, given strings $X,Y$ of total length $n$ and a bound $kge ED_a(X,Y)$. For simplicity, let us focus on $kge 1$ and a constant $epsilon>0$; then, our algorithm takes $tilde{O}(n/a + ak^3)$ time. Unless $a=tilde{O}(1)$ and for small enough $k$, this running time is sublinear in $n$. We also consider a very natural version that asks to find a $(k_I, k_S)$-alignment -- an alignment with at most $k_I$ indels and $k_S$ substitutions. In this setting, we give an exact algorithm and, more importantly, an $tilde{O}(nk_I/k_S + k_Scdot k_I^3)$-time $(1,1+epsilon)$-bicriteria approximation algorithm. The latter solution is based on the techniques we develop for $ED_a$ for $a=Theta(k_S / k_I)$. These bounds are in stark contrast to unit-cost edit distance, where state-of-the-art algorithms are far from achieving $(1+epsilon)$-approximation in sublinear time, even for a favorable choice of $k$.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128123427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Is this correct? Let's check! 这是正确的吗?让我们检查!
Pub Date : 2022-11-22 DOI: 10.48550/arXiv.2211.12301
Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, M. Sudan
Societal accumulation of knowledge is a complex process. The correctness of new units of knowledge depends not only on the correctness of new reasoning, but also on the correctness of old units that the new one builds on. The errors in such accumulation processes are often remedied by error correction and detection heuristics. Motivating examples include the scientific process based on scientific publications, and software development based on libraries of code. Natural processes that aim to keep errors under control, such as peer review in scientific publications, and testing and debugging in software development, would typically check existing pieces of knowledge -- both for the reasoning that generated them and the previous facts they rely on. In this work, we present a simple process that models such accumulation of knowledge and study the persistence (or lack thereof) of errors. We consider a simple probabilistic model for the generation of new units of knowledge based on the preferential attachment growth model, which additionally allows for errors. Furthermore, the process includes checks aimed at catching these errors. We investigate when effects of errors persist forever in the system (with positive probability) and when they get rooted out completely by the checking process. The two basic parameters associated with the checking process are the {em probability} of conducting a check and the depth of the check. We show that errors are rooted out if checks are sufficiently frequent and sufficiently deep. In contrast, shallow or infrequent checks are insufficient to root out errors.
知识的社会积累是一个复杂的过程。新知识单元的正确性不仅取决于新推理的正确性,还取决于新推理所基于的旧推理单元的正确性。这种积累过程中的错误通常通过纠错和启发式检测来纠正。激励的例子包括基于科学出版物的科学过程,以及基于代码库的软件开发。旨在控制错误的自然过程,例如科学出版物中的同行评审,以及软件开发中的测试和调试,通常会检查现有的知识片段——包括生成它们的推理和它们所依赖的先前事实。在这项工作中,我们提出了一个简单的过程来模拟这种知识的积累,并研究错误的持久性(或缺乏)。我们考虑了一个基于优先依恋增长模型的简单概率模型,用于生成新的知识单元,该模型另外允许错误。此外,该过程还包括旨在捕获这些错误的检查。我们研究错误的影响何时在系统中永远存在(以正概率),以及它们何时被检查过程完全根除。与检查过程相关的两个基本参数是进行检查的概率和检查的深度。我们表明,如果检查足够频繁和足够深入,错误就会被根除。相比之下,肤浅或不频繁的检查不足以根除错误。
{"title":"Is this correct? Let's check!","authors":"Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, M. Sudan","doi":"10.48550/arXiv.2211.12301","DOIUrl":"https://doi.org/10.48550/arXiv.2211.12301","url":null,"abstract":"Societal accumulation of knowledge is a complex process. The correctness of new units of knowledge depends not only on the correctness of new reasoning, but also on the correctness of old units that the new one builds on. The errors in such accumulation processes are often remedied by error correction and detection heuristics. Motivating examples include the scientific process based on scientific publications, and software development based on libraries of code. Natural processes that aim to keep errors under control, such as peer review in scientific publications, and testing and debugging in software development, would typically check existing pieces of knowledge -- both for the reasoning that generated them and the previous facts they rely on. In this work, we present a simple process that models such accumulation of knowledge and study the persistence (or lack thereof) of errors. We consider a simple probabilistic model for the generation of new units of knowledge based on the preferential attachment growth model, which additionally allows for errors. Furthermore, the process includes checks aimed at catching these errors. We investigate when effects of errors persist forever in the system (with positive probability) and when they get rooted out completely by the checking process. The two basic parameters associated with the checking process are the {em probability} of conducting a check and the depth of the check. We show that errors are rooted out if checks are sufficiently frequent and sufficiently deep. In contrast, shallow or infrequent checks are insufficient to root out errors.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125520201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Exponential separations using guarded extension variables 使用受保护扩展变量的指数分离
Pub Date : 2022-11-22 DOI: 10.48550/arXiv.2211.12456
Emre Yolcu, Marijn J. H. Heule
We study the complexity of proof systems augmenting resolution with inference rules that allow, given a formula $Gamma$ in conjunctive normal form, deriving clauses that are not necessarily logically implied by $Gamma$ but whose addition to $Gamma$ preserves satisfiability. When the derived clauses are allowed to introduce variables not occurring in $Gamma$, the systems we consider become equivalent to extended resolution. We are concerned with the versions of these systems without new variables. They are called BC${}^-$, RAT${}^-$, SBC${}^-$, and GER${}^-$, denoting respectively blocked clauses, resolution asymmetric tautologies, set-blocked clauses, and generalized extended resolution. Each of these systems formalizes some restricted version of the ability to make assumptions that hold"without loss of generality,"which is commonly used informally to simplify or shorten proofs. Except for SBC${}^-$, these systems are known to be exponentially weaker than extended resolution. They are, however, all equivalent to it under a relaxed notion of simulation that allows the translation of the formula along with the proof when moving between proof systems. By taking advantage of this fact, we construct formulas that separate RAT${}^-$ from GER${}^-$ and vice versa. With the same strategy, we also separate SBC${}^-$ from RAT${}^-$. Additionally, we give polynomial-size SBC${}^-$ proofs of the pigeonhole principle, which separates SBC${}^-$ from GER${}^-$ by a previously known lower bound. These results also separate the three systems from BC${}^-$ since they all simulate it. We thus give an almost complete picture of their relative strengths.
我们研究了证明系统扩充分辨率的复杂性,该证明系统的推理规则允许,给定一个合取范式的公式$Gamma$,推导出不一定由$Gamma$逻辑隐含的子句,但其加到$Gamma$上保持可满足性。当允许派生子句引入不在$Gamma$中出现的变量时,我们考虑的系统就等同于扩展分辨率。我们关心的是没有新变量的这些系统的版本。它们被称为BC${}^-$、RAT${}^-$、SBC${}^-$和GER${}^-$,分别表示阻塞子句、解析非对称重言式、集合阻塞子句和广义扩展解析。这些系统中的每一个都形式化了做出“不失一般性”的假设的能力的一些限制版本,这通常非正式地用于简化或缩短证明。除了SBC${}^-$外,已知这些系统的指数级弱于扩展分辨率。然而,在一个宽松的模拟概念下,它们都是等价的,允许在证明系统之间移动时将公式与证明一起转换。通过利用这一事实,我们构建了将RAT${}^-$与GER${}^-$分开的公式,反之亦然。使用相同的策略,我们还将SBC${}^-$与RAT${}^-$分开。此外,我们给出了多项式大小的SBC${}^-$的鸽子洞原理的证明,它将SBC${}^-$与GER${}^-$分开了一个已知的下界。这些结果还将三个系统从BC${}^-$中分离出来,因为它们都模拟了它。因此,我们几乎完整地描绘了它们的相对优势。
{"title":"Exponential separations using guarded extension variables","authors":"Emre Yolcu, Marijn J. H. Heule","doi":"10.48550/arXiv.2211.12456","DOIUrl":"https://doi.org/10.48550/arXiv.2211.12456","url":null,"abstract":"We study the complexity of proof systems augmenting resolution with inference rules that allow, given a formula $Gamma$ in conjunctive normal form, deriving clauses that are not necessarily logically implied by $Gamma$ but whose addition to $Gamma$ preserves satisfiability. When the derived clauses are allowed to introduce variables not occurring in $Gamma$, the systems we consider become equivalent to extended resolution. We are concerned with the versions of these systems without new variables. They are called BC${}^-$, RAT${}^-$, SBC${}^-$, and GER${}^-$, denoting respectively blocked clauses, resolution asymmetric tautologies, set-blocked clauses, and generalized extended resolution. Each of these systems formalizes some restricted version of the ability to make assumptions that hold\"without loss of generality,\"which is commonly used informally to simplify or shorten proofs. Except for SBC${}^-$, these systems are known to be exponentially weaker than extended resolution. They are, however, all equivalent to it under a relaxed notion of simulation that allows the translation of the formula along with the proof when moving between proof systems. By taking advantage of this fact, we construct formulas that separate RAT${}^-$ from GER${}^-$ and vice versa. With the same strategy, we also separate SBC${}^-$ from RAT${}^-$. Additionally, we give polynomial-size SBC${}^-$ proofs of the pigeonhole principle, which separates SBC${}^-$ from GER${}^-$ by a previously known lower bound. These results also separate the three systems from BC${}^-$ since they all simulate it. We thus give an almost complete picture of their relative strengths.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130992913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantum algorithms and the power of forgetting 量子算法和遗忘的力量
Pub Date : 2022-11-22 DOI: 10.4230/LIPIcs.ITCS.2023.37
Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani
The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the name of a special ENTRANCE vertex, a quantum walk can find another distinguished EXIT vertex using polynomially many queries, though without finding any particular path from ENTRANCE to EXIT. It has been an open problem for twenty years whether there is an efficient quantum algorithm for finding such a path, or if the path-finding problem is hard even for quantum computers. We show that a natural class of efficient quantum algorithms provably cannot find a path from ENTRANCE to EXIT. Specifically, we consider algorithms that, within each branch of their superposition, always store a set of vertex labels that form a connected subgraph including the ENTRANCE, and that only provide these vertex labels as inputs to the oracle. While this does not rule out the possibility of a quantum algorithm that efficiently finds a path, it is unclear how an algorithm could benefit by deviating from this behavior. Our no-go result suggests that, for some problems, quantum algorithms must necessarily forget the path they take to reach a solution in order to outperform classical computation.
所谓的焊接树问题提供了一个黑箱问题的例子,量子行走比任何经典算法都能以指数级快的速度解决。给定一个特殊入口顶点的名称,量子行走可以使用多项式多次查询找到另一个不同的出口顶点,尽管没有找到从入口到出口的任何特定路径。二十年来,是否存在一种有效的量子算法来寻找这样的路径,或者即使对量子计算机来说,寻路问题也很难解决,这一直是一个悬而未决的问题。我们证明了一类自然的高效量子算法可证明不能找到从入口到出口的路径。具体来说,我们考虑这样的算法:在它们叠加的每个分支中,总是存储一组顶点标签,这些顶点标签形成一个包括入口在内的连接子图,并且只将这些顶点标签作为输入提供给oracle。虽然这并不排除量子算法有效地找到路径的可能性,但目前尚不清楚算法如何通过偏离这种行为而受益。我们的“不去”结果表明,对于某些问题,量子算法必须忘记它们达到解决方案的路径,以便优于经典计算。
{"title":"Quantum algorithms and the power of forgetting","authors":"Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani","doi":"10.4230/LIPIcs.ITCS.2023.37","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2023.37","url":null,"abstract":"The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the name of a special ENTRANCE vertex, a quantum walk can find another distinguished EXIT vertex using polynomially many queries, though without finding any particular path from ENTRANCE to EXIT. It has been an open problem for twenty years whether there is an efficient quantum algorithm for finding such a path, or if the path-finding problem is hard even for quantum computers. We show that a natural class of efficient quantum algorithms provably cannot find a path from ENTRANCE to EXIT. Specifically, we consider algorithms that, within each branch of their superposition, always store a set of vertex labels that form a connected subgraph including the ENTRANCE, and that only provide these vertex labels as inputs to the oracle. While this does not rule out the possibility of a quantum algorithm that efficiently finds a path, it is unclear how an algorithm could benefit by deviating from this behavior. Our no-go result suggests that, for some problems, quantum algorithms must necessarily forget the path they take to reach a solution in order to outperform classical computation.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128386483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Quantum Majority Vote 量子多数投票
Pub Date : 2022-11-21 DOI: 10.4230/LIPIcs.ITCS.2023.29
H. Buhrman, N. Linden, L. Mančinska, A. Montanaro, M. Ozols
Majority vote is a basic method for amplifying correct outcomes that is widely used in computer science and beyond. While it can amplify the correctness of a quantum device with classical output, the analogous procedure for quantum output is not known. We introduce quantum majority vote as the following task: given a product state $|psi_1rangle otimes dots otimes |psi_nrangle$ where each qubit is in one of two orthogonal states $|psirangle$ or $|psi^perprangle$, output the majority state. We show that an optimal algorithm for this problem achieves worst-case fidelity of $1/2 + Theta(1/sqrt{n})$. Under the promise that at least $2/3$ of the input qubits are in the majority state, the fidelity increases to $1 - Theta(1/n)$ and approaches $1$ as $n$ increases. We also consider the more general problem of computing any symmetric and equivariant Boolean function $f: {0,1}^n to {0,1}$ in an unknown quantum basis, and show that a generalization of our quantum majority vote algorithm is optimal for this task. The optimal parameters for the generalized algorithm and its worst-case fidelity can be determined by a simple linear program of size $O(n)$. The time complexity of the algorithm is $O(n^4 log n)$ where $n$ is the number of input qubits.
多数投票是放大正确结果的基本方法,广泛应用于计算机科学及其他领域。虽然它可以放大具有经典输出的量子器件的正确性,但量子输出的类似过程尚不清楚。我们将量子多数投票作为以下任务引入:给定一个产品状态$|psi_1rangle otimes dots otimes |psi_nrangle$,其中每个量子比特处于两个正交状态$|psirangle$或$|psi^perprangle$中的一个,输出多数状态。我们证明了该问题的最优算法可以达到$1/2 + Theta(1/sqrt{n})$的最坏情况保真度。在保证至少$2/3$的输入量子位处于多数状态的情况下,保真度增加到$1 - Theta(1/n)$,并随着$n$的增加而接近$1$。我们还考虑了在未知量子基中计算任何对称和等变布尔函数$f: {0,1}^n to {0,1}$的更一般问题,并表明我们的量子多数投票算法的泛化对于该任务是最优的。广义算法的最优参数及其最坏情况保真度可以通过大小为$O(n)$的简单线性程序确定。该算法的时间复杂度为$O(n^4 log n)$,其中$n$为输入量子位的数量。
{"title":"Quantum Majority Vote","authors":"H. Buhrman, N. Linden, L. Mančinska, A. Montanaro, M. Ozols","doi":"10.4230/LIPIcs.ITCS.2023.29","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2023.29","url":null,"abstract":"Majority vote is a basic method for amplifying correct outcomes that is widely used in computer science and beyond. While it can amplify the correctness of a quantum device with classical output, the analogous procedure for quantum output is not known. We introduce quantum majority vote as the following task: given a product state $|psi_1rangle otimes dots otimes |psi_nrangle$ where each qubit is in one of two orthogonal states $|psirangle$ or $|psi^perprangle$, output the majority state. We show that an optimal algorithm for this problem achieves worst-case fidelity of $1/2 + Theta(1/sqrt{n})$. Under the promise that at least $2/3$ of the input qubits are in the majority state, the fidelity increases to $1 - Theta(1/n)$ and approaches $1$ as $n$ increases. We also consider the more general problem of computing any symmetric and equivariant Boolean function $f: {0,1}^n to {0,1}$ in an unknown quantum basis, and show that a generalization of our quantum majority vote algorithm is optimal for this task. The optimal parameters for the generalized algorithm and its worst-case fidelity can be determined by a simple linear program of size $O(n)$. The time complexity of the algorithm is $O(n^4 log n)$ where $n$ is the number of input qubits.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130940176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Private Counting of Distinct and k-Occurring Items in Time Windows 对时间窗口中不同的和k个出现的项目进行私有计数
Pub Date : 2022-11-21 DOI: 10.48550/arXiv.2211.11718
Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson
In this work, we study the task of estimating the numbers of distinct and $k$-occurring items in a time window under the constraint of differential privacy (DP). We consider several variants depending on whether the queries are on general time windows (between times $t_1$ and $t_2$), or are restricted to being cumulative (between times $1$ and $t_2$), and depending on whether the DP neighboring relation is event-level or the more stringent item-level. We obtain nearly tight upper and lower bounds on the errors of DP algorithms for these problems. En route, we obtain an event-level DP algorithm for estimating, at each time step, the number of distinct items seen over the last $W$ updates with error polylogarithmic in $W$; this answers an open question of Bolot et al. (ICDT 2013).
在这项工作中,我们研究了在差分隐私(DP)约束下估计时间窗口中不同的和$k$出现的项目的数量的任务。我们考虑了几种变体,这取决于查询是在一般时间窗口上(在时间$t_1$和时间$t_2$之间),还是被限制为累积的(在时间$1$和时间$t_2$之间),以及DP相邻关系是事件级还是更严格的项目级。对于这些问题,我们得到了DP算法误差的近似紧上界和下界。在此过程中,我们获得了一个事件级DP算法,用于估计在每个时间步骤中,在最近$W$更新中看到的不同项目的数量,误差在$W$中为多对数;这回答了Bolot等人(ICDT 2013)的一个开放性问题。
{"title":"Private Counting of Distinct and k-Occurring Items in Time Windows","authors":"Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson","doi":"10.48550/arXiv.2211.11718","DOIUrl":"https://doi.org/10.48550/arXiv.2211.11718","url":null,"abstract":"In this work, we study the task of estimating the numbers of distinct and $k$-occurring items in a time window under the constraint of differential privacy (DP). We consider several variants depending on whether the queries are on general time windows (between times $t_1$ and $t_2$), or are restricted to being cumulative (between times $1$ and $t_2$), and depending on whether the DP neighboring relation is event-level or the more stringent item-level. We obtain nearly tight upper and lower bounds on the errors of DP algorithms for these problems. En route, we obtain an event-level DP algorithm for estimating, at each time step, the number of distinct items seen over the last $W$ updates with error polylogarithmic in $W$; this answers an open question of Bolot et al. (ICDT 2013).","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133413047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Beyond Worst-Case Budget-Feasible Mechanism Design 超越最坏情况的预算-可行机制设计
Pub Date : 2022-11-16 DOI: 10.48550/arXiv.2211.08711
A. Rubinstein, Junyao Zhao
Motivated by large-market applications such as crowdsourcing, we revisit the problem of budget-feasible mechanism design under a"small-bidder assumption". Anari, Goel, and Nikzad (2018) gave a mechanism that has optimal competitive ratio $1-1/e$ on worst-case instances. However, we observe that on many realistic instances, their mechanism is significantly outperformed by a simpler open clock auction by Ensthaler and Giebe (2014), although the open clock auction only achieves competitive ratio $1/2$ in the worst case. Is there a mechanism that gets the best of both worlds, i.e., a mechanism that is worst-case optimal and performs favorably on realistic instances? Our first main result is the design and the analysis of a natural mechanism that gives an affirmative answer to our question above: (i) We prove that on every instance, our mechanism performs at least as good as all uniform mechanisms, including Anari, Goel, and Nikzad's and Ensthaler and Giebe's mechanisms. (ii) Moreover, we empirically evaluate our mechanism on various realistic instances and observe that it beats the worst-case $1-1/e$ competitive ratio by a large margin and compares favorably to both mechanisms mentioned above. Our second main result is more interesting in theory: We show that in the semi-adversarial model of budget-smoothed analysis, where the adversary designs a single worst-case market for a distribution of budgets, our mechanism is optimal among all (including non-uniform) mechanisms; furthermore our mechanism guarantees a strictly better-than-$(1-1/e)$ expected competitive ratio for any non-trivial budget distribution regardless of the market. We complement the positive result with a characterization of the worst-case markets for any given budget distribution and prove a fairly robust hardness result that holds against any budget distribution and any mechanism.
在众包等大市场应用的激励下,我们重新审视了“小投标人假设”下的预算可行机制设计问题。Anari, Goel, and Nikzad(2018)给出了在最坏情况下的最优竞争比为1-1/e的机制。然而,我们观察到,在许多现实情况下,他们的机制明显优于由Ensthaler和Giebe(2014)提出的更简单的开放式时钟拍卖,尽管开放式时钟拍卖在最坏的情况下只能达到1/2美元的竞争比率。是否存在一种机制可以两全其美,即一种机制是最坏情况下最优的,并且在现实情况下表现良好?我们的第一个主要结果是对自然机制的设计和分析,它对我们上面的问题给出了肯定的答案:(i)我们证明在每个实例中,我们的机制至少与所有统一机制一样好,包括Anari, Goel, Nikzad, Ensthaler和Giebe的机制。(ii)此外,我们在各种现实情况下对我们的机制进行了经验评估,并观察到它大大优于最坏情况下的1-1美元/e美元竞争比率,并且比上述两种机制都有利。我们的第二个主要结果在理论上更有趣:我们表明,在预算平滑分析的半对抗模型中,对手为预算分布设计了一个最坏情况市场,我们的机制在所有(包括非均匀)机制中是最优的;此外,无论市场如何,我们的机制保证了任何非平凡预算分配的预期竞争比都严格优于-$(1-1/e)$。我们用对任何给定预算分布的最坏情况市场的描述来补充正结果,并证明了一个相当稳健的硬度结果,适用于任何预算分布和任何机制。
{"title":"Beyond Worst-Case Budget-Feasible Mechanism Design","authors":"A. Rubinstein, Junyao Zhao","doi":"10.48550/arXiv.2211.08711","DOIUrl":"https://doi.org/10.48550/arXiv.2211.08711","url":null,"abstract":"Motivated by large-market applications such as crowdsourcing, we revisit the problem of budget-feasible mechanism design under a\"small-bidder assumption\". Anari, Goel, and Nikzad (2018) gave a mechanism that has optimal competitive ratio $1-1/e$ on worst-case instances. However, we observe that on many realistic instances, their mechanism is significantly outperformed by a simpler open clock auction by Ensthaler and Giebe (2014), although the open clock auction only achieves competitive ratio $1/2$ in the worst case. Is there a mechanism that gets the best of both worlds, i.e., a mechanism that is worst-case optimal and performs favorably on realistic instances? Our first main result is the design and the analysis of a natural mechanism that gives an affirmative answer to our question above: (i) We prove that on every instance, our mechanism performs at least as good as all uniform mechanisms, including Anari, Goel, and Nikzad's and Ensthaler and Giebe's mechanisms. (ii) Moreover, we empirically evaluate our mechanism on various realistic instances and observe that it beats the worst-case $1-1/e$ competitive ratio by a large margin and compares favorably to both mechanisms mentioned above. Our second main result is more interesting in theory: We show that in the semi-adversarial model of budget-smoothed analysis, where the adversary designs a single worst-case market for a distribution of budgets, our mechanism is optimal among all (including non-uniform) mechanisms; furthermore our mechanism guarantees a strictly better-than-$(1-1/e)$ expected competitive ratio for any non-trivial budget distribution regardless of the market. We complement the positive result with a characterization of the worst-case markets for any given budget distribution and prove a fairly robust hardness result that holds against any budget distribution and any mechanism.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"98 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121014195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Improved Monotonicity Testers via Hypercube Embeddings 通过超立方体嵌入改进单调性测试仪
Pub Date : 2022-11-16 DOI: 10.48550/arXiv.2211.09229
M. Braverman, Subhash Khot, Guy Kindler, Dor Minzer
We show improved monotonicity testers for the Boolean hypercube under the $p$-biased measure, as well as over the hypergrid $[m]^n$. Our results are: 1. For any $pin (0,1)$, for the $p$-biased hypercube we show a non-adaptive tester that makes $tilde{O}(sqrt{n}/varepsilon^2)$ queries, accepts monotone functions with probability $1$ and rejects functions that are $varepsilon$-far from monotone with probability at least $2/3$. 2. For all $minmathbb{N}$, we show an $tilde{O}(sqrt{n}m^3/varepsilon^2)$ query monotonicity tester over $[m]^n$. We also establish corresponding directed isoperimetric inequalities in these domains. Previously, the best known tester due to Black, Chakrabarty and Seshadhri had $Omega(n^{5/6})$ query complexity. Our results are optimal up to poly-logarithmic factors and the dependency on $m$. Our proof uses a notion of monotone embeddings of measures into the Boolean hypercube that can be used to reduce the problem of monotonicity testing over an arbitrary product domains to the Boolean cube. The embedding maps a function over a product domain of dimension $n$ into a function over a Boolean cube of a larger dimension $n'$, while preserving its distance from being monotone; an embedding is considered efficient if $n'$ is not much larger than $n$, and we show how to construct efficient embeddings in the above mentioned settings.
我们展示了改进的布尔超立方体在$p$ -偏度量下的单调性测试仪,以及在超网格$[m]^n$上的单调性测试仪。我们的结果是:1。对于任何$pin (0,1)$,对于$p$偏置的超立方体,我们展示了一个非自适应测试器,它进行$tilde{O}(sqrt{n}/varepsilon^2)$查询,接受概率为$1$的单调函数,并拒绝概率至少为$2/3$的$varepsilon$ -远离单调的函数。2. 对于所有$minmathbb{N}$,我们展示了$[m]^n$上的$tilde{O}(sqrt{n}m^3/varepsilon^2)$查询单调性测试器。我们还在这些域中建立了相应的有向等周不等式。以前,由Black、Chakrabarty和Seshadhri开发的最著名的测试器具有$Omega(n^{5/6})$查询复杂性。我们的结果是最优的多对数因素和对$m$的依赖。我们的证明使用了测度单调嵌入布尔超立方的概念,这可以用来减少布尔超立方在任意积域上的单调性测试问题。嵌入将维数为$n$的积域上的函数映射到维数为$n'$的布尔立方体上的函数,同时保持其距离不为单调;如果$n'$不比$n$大多少,则认为嵌入是有效的,我们将在上述设置中展示如何构建有效的嵌入。
{"title":"Improved Monotonicity Testers via Hypercube Embeddings","authors":"M. Braverman, Subhash Khot, Guy Kindler, Dor Minzer","doi":"10.48550/arXiv.2211.09229","DOIUrl":"https://doi.org/10.48550/arXiv.2211.09229","url":null,"abstract":"We show improved monotonicity testers for the Boolean hypercube under the $p$-biased measure, as well as over the hypergrid $[m]^n$. Our results are: 1. For any $pin (0,1)$, for the $p$-biased hypercube we show a non-adaptive tester that makes $tilde{O}(sqrt{n}/varepsilon^2)$ queries, accepts monotone functions with probability $1$ and rejects functions that are $varepsilon$-far from monotone with probability at least $2/3$. 2. For all $minmathbb{N}$, we show an $tilde{O}(sqrt{n}m^3/varepsilon^2)$ query monotonicity tester over $[m]^n$. We also establish corresponding directed isoperimetric inequalities in these domains. Previously, the best known tester due to Black, Chakrabarty and Seshadhri had $Omega(n^{5/6})$ query complexity. Our results are optimal up to poly-logarithmic factors and the dependency on $m$. Our proof uses a notion of monotone embeddings of measures into the Boolean hypercube that can be used to reduce the problem of monotonicity testing over an arbitrary product domains to the Boolean cube. The embedding maps a function over a product domain of dimension $n$ into a function over a Boolean cube of a larger dimension $n'$, while preserving its distance from being monotone; an embedding is considered efficient if $n'$ is not much larger than $n$, and we show how to construct efficient embeddings in the above mentioned settings.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129989907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
期刊
Information Technology Convergence and Services
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1