首页 > 最新文献
paperpass

Information Technology Convergence and Services最新文献

英文 中文
Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data reed - solomon编码数据线性函数的低带宽恢复
Pub Date : 2021-07-25 DOI: 10.4230/LIPIcs.ITCS.2022.117
N. Shutty, Mary Wootters
We study the problem of efficiently computing on encoded data. More specifically, we study the question of low-bandwidth computation of functions $F:mathbb{F}^k to mathbb{F}$ of some data $x in mathbb{F}^k$, given access to an encoding $c in mathbb{F}^n$ of $x$ under an error correcting code. In our model -- relevant in distributed storage, distributed computation and secret sharing -- each symbol of $c$ is held by a different party, and we aim to minimize the total amount of information downloaded from each party in order to compute $F(x)$. Special cases of this problem have arisen in several domains, and we believe that it is fruitful to study this problem in generality. Our main result is a low-bandwidth scheme to compute linear functions for Reed-Solomon codes, even in the presence of erasures. More precisely, let $epsilon>0$ and let $mathcal{C}: mathbb{F}^k to mathbb{F}^n$ be a full-length Reed-Solomon code of rate $1 - epsilon$ over a field $mathbb{F}$ with constant characteristic. For any $gamma in [0, epsilon)$, our scheme can compute any linear function $F(x)$ given access to any $(1 - gamma)$-fraction of the symbols of $mathcal{C}(x)$, with download bandwidth $O(n/(epsilon - gamma))$ bits. In contrast, the naive scheme that involves reconstructing the data $x$ and then computing $F(x)$ uses $Theta(n log n)$ bits. Our scheme has applications in distributed storage, coded computation, and homomorphic secret sharing.
我们研究了编码数据的高效计算问题。更具体地说,我们研究了一些数据$x in mathbb{F}^k$的函数$F:mathbb{F}^k to mathbb{F}$的低带宽计算问题,给定了在纠错码下访问编码$c in mathbb{F}^n$的$x$。在我们的模型中——与分布式存储、分布式计算和秘密共享相关——$c$的每个符号由不同的一方持有,我们的目标是最小化从每一方下载的信息总量,以便计算$F(x)$。这一问题的特殊情况在一些领域已经出现,我们认为从总体上研究这一问题是富有成效的。我们的主要成果是一个低带宽方案来计算里德-所罗门码的线性函数,即使在存在擦除的情况下。更准确地说,设$epsilon>0$和$mathcal{C}: mathbb{F}^k to mathbb{F}^n$是一个完整的里德-所罗门码,在一个具有恒定特征的字段$mathbb{F}$上,其速率为$1 - epsilon$。对于任何$gamma in [0, epsilon)$,我们的方案可以计算任何线性函数$F(x)$,给定访问$mathcal{C}(x)$符号的任何$(1 - gamma)$ -部分,下载带宽为$O(n/(epsilon - gamma))$位。相比之下,涉及重建数据$x$然后计算$F(x)$的朴素方案使用$Theta(n log n)$位。该方案可应用于分布式存储、编码计算和同态秘密共享等领域。
{"title":"Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data","authors":"N. Shutty, Mary Wootters","doi":"10.4230/LIPIcs.ITCS.2022.117","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.117","url":null,"abstract":"We study the problem of efficiently computing on encoded data. More specifically, we study the question of low-bandwidth computation of functions $F:mathbb{F}^k to mathbb{F}$ of some data $x in mathbb{F}^k$, given access to an encoding $c in mathbb{F}^n$ of $x$ under an error correcting code. In our model -- relevant in distributed storage, distributed computation and secret sharing -- each symbol of $c$ is held by a different party, and we aim to minimize the total amount of information downloaded from each party in order to compute $F(x)$. Special cases of this problem have arisen in several domains, and we believe that it is fruitful to study this problem in generality. Our main result is a low-bandwidth scheme to compute linear functions for Reed-Solomon codes, even in the presence of erasures. More precisely, let $epsilon>0$ and let $mathcal{C}: mathbb{F}^k to mathbb{F}^n$ be a full-length Reed-Solomon code of rate $1 - epsilon$ over a field $mathbb{F}$ with constant characteristic. For any $gamma in [0, epsilon)$, our scheme can compute any linear function $F(x)$ given access to any $(1 - gamma)$-fraction of the symbols of $mathcal{C}(x)$, with download bandwidth $O(n/(epsilon - gamma))$ bits. In contrast, the naive scheme that involves reconstructing the data $x$ and then computing $F(x)$ uses $Theta(n log n)$ bits. Our scheme has applications in distributed storage, coded computation, and homomorphic secret sharing.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126380109","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
Lower Bounds for Symmetric Circuits for the Determinant 行列式对称回路的下界
Pub Date : 2021-07-23 DOI: 10.4230/LIPIcs.ITCS.2022.52
A. Dawar, G. Wilsenach
Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithmetic circuits and show an exponential separation between the sizes of symmetric circuits for computing the determinant and the permanent. The symmetry restriction is that the circuits which take a matrix input are unchanged by a permutation applied simultaneously to the rows and columns of the matrix. Under such restrictions we have polynomial-size circuits for computing the determinant but no subexponential size circuits for the permanent. Here, we consider a more stringent symmetry requirement, namely that the circuits are unchanged by arbitrary even permutations applied separately to rows and columns, and prove an exponential lower bound even for circuits computing the determinant. The result requires substantial new machinery. We develop a general framework for proving lower bounds for symmetric circuits with restricted symmetries, based on a new support theorem and new two-player restricted bijection games. These are applied to the determinant problem with a novel construction of matrices that are bi-adjacency matrices of graphs based on the CFI construction. Our general framework opens the way to exploring a variety of symmetry restrictions and studying trade-offs between symmetry and other resources used by arithmetic circuits.
Dawar和Wilsenach (ICALP 2020)引入了对称算术电路模型,并展示了用于计算行列式和永久式的对称电路大小之间的指数分离。对称限制是采用矩阵输入的电路不受同时应用于矩阵的行和列的排列的影响。在这样的限制下,我们有多项式大小的电路来计算行列式,但没有亚指数大小的电路来计算恒量。在这里,我们考虑了一个更严格的对称性要求,即电路被单独应用于行和列的任意偶数排列而不变,并证明了计算行列式的电路的指数下界。结果需要大量的新机器。基于一个新的支持定理和新的二人受限双射对策,我们开发了一个证明具有限制对称的对称电路下界的一般框架。这些应用于一个新的矩阵结构的行列式问题,该矩阵是基于CFI结构的图的双邻接矩阵。我们的一般框架为探索各种对称限制和研究对称性与算术电路使用的其他资源之间的权衡开辟了道路。
{"title":"Lower Bounds for Symmetric Circuits for the Determinant","authors":"A. Dawar, G. Wilsenach","doi":"10.4230/LIPIcs.ITCS.2022.52","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.52","url":null,"abstract":"Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithmetic circuits and show an exponential separation between the sizes of symmetric circuits for computing the determinant and the permanent. The symmetry restriction is that the circuits which take a matrix input are unchanged by a permutation applied simultaneously to the rows and columns of the matrix. Under such restrictions we have polynomial-size circuits for computing the determinant but no subexponential size circuits for the permanent. Here, we consider a more stringent symmetry requirement, namely that the circuits are unchanged by arbitrary even permutations applied separately to rows and columns, and prove an exponential lower bound even for circuits computing the determinant. The result requires substantial new machinery. We develop a general framework for proving lower bounds for symmetric circuits with restricted symmetries, based on a new support theorem and new two-player restricted bijection games. These are applied to the determinant problem with a novel construction of matrices that are bi-adjacency matrices of graphs based on the CFI construction. Our general framework opens the way to exploring a variety of symmetry restrictions and studying trade-offs between symmetry and other resources used by arithmetic circuits.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117161594","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
Correlation Detection in Trees for Planted Graph Alignment 树的相关性检测用于种植图对齐
Pub Date : 2021-07-15 DOI: 10.4230/LIPIcs.ITCS.2022.74
Luca Ganassali, L. Massoulié, M. Lelarge
Motivated by alignment of correlated sparse random graphs, we introduce a hypothesis testing problem of deciding whether or not two random trees are correlated. We obtain sufficient conditions under which this testing is impossible or feasible. We propose MPAlign, a message-passing algorithm for graph alignment inspired by the tree correlation detection problem. We prove MPAlign to succeed in polynomial time at partial alignment whenever tree detection is feasible. As a result our analysis of tree detection reveals new ranges of parameters for which partial alignment of sparse random graphs is feasible in polynomial time. We then conjecture that graph alignment is not feasible in polynomial time when the associated tree detection problem is impossible. If true, this conjecture together with our sufficient conditions on tree detection impossibility would imply the existence of a hard phase for graph alignment, i.e. a parameter range where alignment cannot be done in polynomial time even though it is known to be feasible in non-polynomial time.
在相关稀疏随机图对齐的激励下,我们引入了一个假设检验问题来决定两个随机树是否相关。我们得到了充分的条件,在这些条件下,这种检验是不可能的或可行的。我们提出了MPAlign,这是一种受树相关检测问题启发的图对齐消息传递算法。我们证明了在树检测可行的情况下MPAlign在多项式时间内部分对齐是成功的。因此,我们对树检测的分析揭示了新的参数范围,其中稀疏随机图的部分对齐在多项式时间内是可行的。然后我们推测,当相关的树检测问题不可能存在时,图对齐在多项式时间内是不可行的。如果这一猜想成立,那么结合我们关于树检测不可能的充分条件,就意味着存在图对齐的硬相位,即存在一个参数范围,在该参数范围内,即使已知在非多项式时间内可行,也不能在多项式时间内完成对齐。
{"title":"Correlation Detection in Trees for Planted Graph Alignment","authors":"Luca Ganassali, L. Massoulié, M. Lelarge","doi":"10.4230/LIPIcs.ITCS.2022.74","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.74","url":null,"abstract":"Motivated by alignment of correlated sparse random graphs, we introduce a hypothesis testing problem of deciding whether or not two random trees are correlated. We obtain sufficient conditions under which this testing is impossible or feasible. We propose MPAlign, a message-passing algorithm for graph alignment inspired by the tree correlation detection problem. We prove MPAlign to succeed in polynomial time at partial alignment whenever tree detection is feasible. As a result our analysis of tree detection reveals new ranges of parameters for which partial alignment of sparse random graphs is feasible in polynomial time. We then conjecture that graph alignment is not feasible in polynomial time when the associated tree detection problem is impossible. If true, this conjecture together with our sufficient conditions on tree detection impossibility would imply the existence of a hard phase for graph alignment, i.e. a parameter range where alignment cannot be done in polynomial time even though it is known to be feasible in non-polynomial time.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115211409","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
An Efficient Semi-Streaming PTAS for Tournament Feedback ArcSet with Few Passes 一个有效的半流PTAS的比赛反馈ArcSet与很少的传球
Pub Date : 2021-07-15 DOI: 10.4230/LIPIcs.ITCS.2022.16
Anubhav Baweja, Justin Jia, David P. Woodruff
We present the first semi-streaming PTAS for the minimum feedback arc set problem on directed tournaments in a small number of passes. Namely, we obtain a $(1 + varepsilon)$-approximation in polynomial time $O left( text{poly}(n) 2^{text{poly}(1/varepsilon)} right)$, with $p$ passes in $n^{1+1/p} cdot text{poly}left(frac{log n}{varepsilon}right)$ space. The only previous algorithm with this pass/space trade-off gave a $3$-approximation (SODA, 2020), and other polynomial-time algorithms which achieved a $(1+varepsilon)$-approximation did so with quadratic memory or with a linear number of passes. We also present a new time/space trade-off for $1$-pass algorithms that solve the tournament feedback arc set problem. This problem has several applications in machine learning such as creating linear classifiers and doing Bayesian inference. We also provide several additional algorithms and lower bounds for related streaming problems on directed graphs, which is a mostly unexplored territory.
我们提出了第一个半流PTAS的最小反馈弧集问题上的定向比赛在少量的通过。也就是说,我们在多项式时间$O left( text{poly}(n) 2^{text{poly}(1/varepsilon)} right)$中获得$(1 + varepsilon)$ -近似,其中$p$在$n^{1+1/p} cdot text{poly}left(frac{log n}{varepsilon}right)$空间中通过。之前唯一具有这种传递/空间权衡的算法给出了$3$ -近似值(SODA, 2020),而其他实现$(1+varepsilon)$ -近似值的多项式时间算法使用二次内存或线性传递数来实现。我们还提出了一种新的时间/空间权衡$1$ -pass算法,用于解决锦标赛反馈弧集问题。这个问题在机器学习中有几个应用,比如创建线性分类器和做贝叶斯推理。我们还为有向图上的相关流问题提供了一些额外的算法和下界,这是一个尚未探索的领域。
{"title":"An Efficient Semi-Streaming PTAS for Tournament Feedback ArcSet with Few Passes","authors":"Anubhav Baweja, Justin Jia, David P. Woodruff","doi":"10.4230/LIPIcs.ITCS.2022.16","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.16","url":null,"abstract":"We present the first semi-streaming PTAS for the minimum feedback arc set problem on directed tournaments in a small number of passes. Namely, we obtain a $(1 + varepsilon)$-approximation in polynomial time $O left( text{poly}(n) 2^{text{poly}(1/varepsilon)} right)$, with $p$ passes in $n^{1+1/p} cdot text{poly}left(frac{log n}{varepsilon}right)$ space. The only previous algorithm with this pass/space trade-off gave a $3$-approximation (SODA, 2020), and other polynomial-time algorithms which achieved a $(1+varepsilon)$-approximation did so with quadratic memory or with a linear number of passes. We also present a new time/space trade-off for $1$-pass algorithms that solve the tournament feedback arc set problem. This problem has several applications in machine learning such as creating linear classifiers and doing Bayesian inference. We also provide several additional algorithms and lower bounds for related streaming problems on directed graphs, which is a mostly unexplored territory.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123753319","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
Making Auctions Robust to Aftermarkets 使拍卖对售后市场保持强劲
Pub Date : 2021-07-13 DOI: 10.4230/LIPIcs.ITCS.2023.9
Moshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier
A prevalent assumption in auction theory is that the auctioneer has full control over the market and that the allocation she dictates is final. In practice, however, agents might be able to resell acquired items in an aftermarket. A prominent example is the market for carbon emission allowances. These allowances are commonly allocated by the government using uniform-price auctions, and firms can typically trade these allowances among themselves in an aftermarket that may not be fully under the auctioneer's control. While the uniform-price auction is approximately efficient in isolation, we show that speculation and resale in aftermarkets might result in a significant welfare loss. Motivated by this issue, we consider three approaches, each ensuring high equilibrium welfare in the combined market. The first approach is to adopt smooth auctions such as discriminatory auctions. This approach is robust to correlated valuations and to participants acquiring information about others' types. However, discriminatory auctions have several downsides, notably that of charging bidders different prices for identical items, resulting in fairness concerns that make the format unpopular. Two other approaches we suggest are either using posted-pricing mechanisms, or using uniform-price auctions with anonymous reserves. We show that when using balanced prices, both these approaches ensure high equilibrium welfare in the combined market. The latter also inherits many of the benefits from uniform-price auctions such as price discovery, and can be introduced with a minor modification to auctions currently in use to sell carbon emission allowances.
拍卖理论中一个普遍的假设是,拍卖师对市场有完全的控制权,她所决定的分配是最终的。然而,在实践中,代理商可能会在售后市场转售获得的物品。一个突出的例子是碳排放配额市场。这些配额通常由政府通过统一价格拍卖进行分配,企业通常可以在可能不完全受拍卖商控制的售后市场中进行交易。虽然统一价格拍卖在孤立的情况下大约是有效的,但我们表明,在售后市场上的投机和转售可能会导致重大的福利损失。在这个问题的激励下,我们考虑了三种方法,每一种方法都保证了合并市场的高均衡福利。一是采取歧视性拍卖等平稳拍卖方式。这种方法对于相关估值和参与者获取他人类型的信息是稳健的。然而,歧视性拍卖有几个缺点,特别是对相同的物品收取不同的价格,导致对公平的担忧,使这种形式不受欢迎。我们建议的另外两种方法要么是使用发布定价机制,要么是使用匿名储备的统一价格拍卖。我们表明,当使用均衡价格时,这两种方法都保证了组合市场的高均衡福利。后者还继承了统一价格拍卖(如价格发现)的许多好处,并且可以对目前用于出售碳排放配额的拍卖进行轻微修改后引入。
{"title":"Making Auctions Robust to Aftermarkets","authors":"Moshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier","doi":"10.4230/LIPIcs.ITCS.2023.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2023.9","url":null,"abstract":"A prevalent assumption in auction theory is that the auctioneer has full control over the market and that the allocation she dictates is final. In practice, however, agents might be able to resell acquired items in an aftermarket. A prominent example is the market for carbon emission allowances. These allowances are commonly allocated by the government using uniform-price auctions, and firms can typically trade these allowances among themselves in an aftermarket that may not be fully under the auctioneer's control. While the uniform-price auction is approximately efficient in isolation, we show that speculation and resale in aftermarkets might result in a significant welfare loss. Motivated by this issue, we consider three approaches, each ensuring high equilibrium welfare in the combined market. The first approach is to adopt smooth auctions such as discriminatory auctions. This approach is robust to correlated valuations and to participants acquiring information about others' types. However, discriminatory auctions have several downsides, notably that of charging bidders different prices for identical items, resulting in fairness concerns that make the format unpopular. Two other approaches we suggest are either using posted-pricing mechanisms, or using uniform-price auctions with anonymous reserves. We show that when using balanced prices, both these approaches ensure high equilibrium welfare in the combined market. The latter also inherits many of the benefits from uniform-price auctions such as price discovery, and can be introduced with a minor modification to auctions currently in use to sell carbon emission allowances.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133629606","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
Smaller ACC0 Circuits for Symmetric Functions 对称函数的更小的ACC0电路
Pub Date : 2021-07-09 DOI: 10.4230/LIPIcs.ITCS.2022.38
Brynmor Chapman, Ryan Williams
What is the power of constant-depth circuits with $MOD_m$ gates, that can count modulo $m$? Can they efficiently compute MAJORITY and other symmetric functions? When $m$ is a constant prime power, the answer is well understood: Razborov and Smolensky proved in the 1980s that MAJORITY and $MOD_m$ require super-polynomial-size $MOD_q$ circuits, where $q$ is any prime power not dividing $m$. However, relatively little is known about the power of $MOD_m$ circuits for non-prime-power $m$. For example, it is still open whether every problem in $EXP$ can be computed by depth-$3$ circuits of polynomial size and only $MOD_6$ gates. We shed some light on the difficulty of proving lower bounds for $MOD_m$ circuits, by giving new upper bounds. We construct $MOD_m$ circuits computing symmetric functions with non-prime power $m$, with size-depth tradeoffs that beat the longstanding lower bounds for $AC^0[m]$ circuits for prime power $m$. Our size-depth tradeoff circuits have essentially optimal dependence on $m$ and $d$ in the exponent, under a natural circuit complexity hypothesis. For example, we show for every $varepsilon>0$ that every symmetric function can be computed with depth-3 $MOD_m$ circuits of $exp(O(n^{varepsilon}))$ size, for a constant $m$ depending only on $varepsilon>0$. That is, depth-$3$ $CC^0$ circuits can compute any symmetric function in emph{subexponential} size. This demonstrates a significant difference in the power of depth-$3$ $CC^0$ circuits, compared to other models: for certain symmetric functions, depth-$3$ $AC^0$ circuits require $2^{Omega(sqrt{n})}$ size [H{aa}stad 1986], and depth-$3$ $AC^0[p^k]$ circuits (for fixed prime power $p^k$) require $2^{Omega(n^{1/6})}$ size [Smolensky 1987]. Even for depth-two $MOD_p circ MOD_m$ circuits, $2^{Omega(n)}$ lower bounds were known [Barrington Straubing Th'erien 1990].
恒深电路的功率是多少 $MOD_m$ 盖茨,它可以取模 $m$? 它们能有效地计算MAJORITY和其他对称函数吗?什么时候 $m$ 是一个恒定的主要力量,答案是很容易理解的:Razborov和Smolensky在20世纪80年代证明了MAJORITY和 $MOD_m$ 需要超多项式大小 $MOD_q$ 电路,其中 $q$ 是否有质数幂不被除 $m$. 然而,人们对……的力量所知相对较少 $MOD_m$ 非原功率电路 $m$. 例如,是否每一个问题都是开放的 $EXP$ 可以通过depth-$3$ 只有多项式大小的电路 $MOD_6$ 盖茨。我们阐明了证明下界的困难 $MOD_m$ 通过给出新的上界。我们构建 $MOD_m$ 计算非素数幂对称函数的电路 $m$,其尺寸深度权衡超过了长期存在的下限 $AC^0[m]$ 原功率电路 $m$. 我们的尺寸深度权衡电路本质上是最优依赖的 $m$ 和 $d$ 在指数中,在自然回路复杂度假设下。例如,我们显示每一个 $varepsilon>0$ 每个对称函数都可以用depth-3来计算 $MOD_m$ 电路 $exp(O(n^{varepsilon}))$ 大小,对于常数 $m$ 只依赖于 $varepsilon>0$. 也就是depth-$3$ $CC^0$ 电路可以计算任意对称函数 emph{次指数的} 尺寸。这表明深度-的力量有很大的不同$3$ $CC^0$ 电路,与其他模型相比:对于某些对称函数,深度-$3$ $AC^0$ 电路要求 $2^{Omega(sqrt{n})}$ 尺寸[H]{aa}Stad 1986],深度-$3$ $AC^0[p^k]$ 电路(用于固定初始功率) $p^k$)要求 $2^{Omega(n^{1/6})}$ 尺寸[Smolensky 1987]。即使是深度2 $MOD_p circ MOD_m$ 电路; $2^{Omega(n)}$ 下限是已知的[Barrington Straubing th阴郁,1990]。
{"title":"Smaller ACC0 Circuits for Symmetric Functions","authors":"Brynmor Chapman, Ryan Williams","doi":"10.4230/LIPIcs.ITCS.2022.38","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.38","url":null,"abstract":"What is the power of constant-depth circuits with $MOD_m$ gates, that can count modulo $m$? Can they efficiently compute MAJORITY and other symmetric functions? When $m$ is a constant prime power, the answer is well understood: Razborov and Smolensky proved in the 1980s that MAJORITY and $MOD_m$ require super-polynomial-size $MOD_q$ circuits, where $q$ is any prime power not dividing $m$. However, relatively little is known about the power of $MOD_m$ circuits for non-prime-power $m$. For example, it is still open whether every problem in $EXP$ can be computed by depth-$3$ circuits of polynomial size and only $MOD_6$ gates. We shed some light on the difficulty of proving lower bounds for $MOD_m$ circuits, by giving new upper bounds. We construct $MOD_m$ circuits computing symmetric functions with non-prime power $m$, with size-depth tradeoffs that beat the longstanding lower bounds for $AC^0[m]$ circuits for prime power $m$. Our size-depth tradeoff circuits have essentially optimal dependence on $m$ and $d$ in the exponent, under a natural circuit complexity hypothesis. For example, we show for every $varepsilon>0$ that every symmetric function can be computed with depth-3 $MOD_m$ circuits of $exp(O(n^{varepsilon}))$ size, for a constant $m$ depending only on $varepsilon>0$. That is, depth-$3$ $CC^0$ circuits can compute any symmetric function in emph{subexponential} size. This demonstrates a significant difference in the power of depth-$3$ $CC^0$ circuits, compared to other models: for certain symmetric functions, depth-$3$ $AC^0$ circuits require $2^{Omega(sqrt{n})}$ size [H{aa}stad 1986], and depth-$3$ $AC^0[p^k]$ circuits (for fixed prime power $p^k$) require $2^{Omega(n^{1/6})}$ size [Smolensky 1987]. Even for depth-two $MOD_p circ MOD_m$ circuits, $2^{Omega(n)}$ lower bounds were known [Barrington Straubing Th'erien 1990].","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123964278","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}
引用次数: 3
Balanced Allocations with Incomplete Information: The Power of Two Queries 不完全信息下的均衡分配:两个查询的力量
Pub Date : 2021-07-08 DOI: 10.4230/LIPIcs.ITCS.2022.103
Dimitrios Los, Thomas Sauerwald
We consider the allocation of m balls into n bins with incomplete information. In the classical Two-Choice process a ball first queries the load of two randomly chosen bins and is then placed in the least loaded bin. In our setting, each ball also samples two random bins but can only estimate a bin’s load by sending binary queries of the form “Is the load at least the median?” or “Is the load at least 100?”. For the lightly loaded case m = O(n), Feldheim and Gurel-Gurevich (2021) showed that with one query it is possible to achieve a maximum load of O( √ log n/ log log n), and they also pose the question whether a maximum load of m/n + O( √ log n/ log log n) is possible for any m = Ω(n). In this work, we resolve this open problem by proving a lower bound of m/n + Ω( √ log n) for a fixed m = Θ(n √ log n), and a lower bound of m/n + Ω(log n/ log log n) for some m depending on the used strategy. We complement this negative result by proving a positive result for multiple queries. In particular, we show that with only two binary queries per chosen bin, there is an oblivious strategy which ensures a maximum load of m/n + O( √ log n) for any m ≥ 1. Further, for any number of k = O(log log n) binary queries, the upper bound on the maximum load improves to m/n + O(k(log n)1/k) for any m ≥ 1. This result for k queries has several interesting consequences: (i) it implies new bounds for the (1 + β)-process introduced by Peres, Talwar and Wieder (2015), (ii) it leads to new bounds for the graphical balanced allocation process on dense expander graphs, and (iii) it recovers and generalizes the bound of m/n + O(log log n) on the maximum load achieved by the Two-Choice process, including the heavily loaded case m = Ω(n) which was derived in previous works by Berenbrink et al. (2006) as well as Talwar and Wieder (2014). One novel aspect of our proofs is the use of multiple super-exponential potential functions, which might be of use in future work. 2012 ACM Subject Classification Mathematics of computing → Probability and statistics; Mathematics of computing → Discrete mathematics; Theory of computation → Randomness, geometry and discrete structures; Theory of computation → Design and analysis of algorithms
我们考虑将m个球分配到n个信息不完全的箱子中。在经典的二选择过程中,一个球首先查询两个随机选择的箱子的负载,然后被放置在最小负载的箱子中。在我们的设置中,每个球也抽样两个随机的箱子,但只能通过发送二进制查询来估计一个箱子的负载:“负载至少是中位数吗?”或“负载是否至少为100?”对于轻负载情况m = O(n), Feldheim和Gurel-Gurevich(2021)表明,通过一次查询可以实现最大负载O(√log n/ log log n),并且他们还提出了一个问题,即对于任意m = Ω(n),是否可能实现m/n + O(√log n/ log log n)的最大负载。在这项工作中,我们通过证明m/n + Ω(√log n)的下界对于一个固定的m = Θ(n√log n),以及m/n + Ω(log n/ log log n)的下界来解决这个开放问题,这取决于所使用的策略。我们通过证明多个查询的正结果来补充这个负结果。特别是,我们表明,对于每个选择的bin只有两个二进制查询,存在一种遗忘策略,该策略确保对于任何m≥1的最大负载为m/n + O(√log n)。此外,对于任意数量的k = O(log log n)二进制查询,对于任意m≥1,最大负载的上界提高到m/n + O(k(log n)1/k)。k次查询的结果有几个有趣的结果:(i)这意味着新边界(1 +β)动线引入的佩雷斯,犯错误和Wieder(2015),(2)它会导致新的图形均衡分配过程的边界密度扩张器图,和(3)复苏,概括的m / n + O (log n)在最大负载通过两个网络的过程,包括严重的加载情况下m =Ω(n)派生于先前的作品Berenbrink et al .(2006)以及三Wieder(2014)。我们的证明的一个新颖的方面是使用多个超指数势函数,这可能在未来的工作中使用。2012 ACM学科分类计算数学→概率与统计;计算数学→离散数学;计算理论→随机、几何和离散结构;计算理论→算法设计与分析
{"title":"Balanced Allocations with Incomplete Information: The Power of Two Queries","authors":"Dimitrios Los, Thomas Sauerwald","doi":"10.4230/LIPIcs.ITCS.2022.103","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.103","url":null,"abstract":"We consider the allocation of m balls into n bins with incomplete information. In the classical Two-Choice process a ball first queries the load of two randomly chosen bins and is then placed in the least loaded bin. In our setting, each ball also samples two random bins but can only estimate a bin’s load by sending binary queries of the form “Is the load at least the median?” or “Is the load at least 100?”. For the lightly loaded case m = O(n), Feldheim and Gurel-Gurevich (2021) showed that with one query it is possible to achieve a maximum load of O( √ log n/ log log n), and they also pose the question whether a maximum load of m/n + O( √ log n/ log log n) is possible for any m = Ω(n). In this work, we resolve this open problem by proving a lower bound of m/n + Ω( √ log n) for a fixed m = Θ(n √ log n), and a lower bound of m/n + Ω(log n/ log log n) for some m depending on the used strategy. We complement this negative result by proving a positive result for multiple queries. In particular, we show that with only two binary queries per chosen bin, there is an oblivious strategy which ensures a maximum load of m/n + O( √ log n) for any m ≥ 1. Further, for any number of k = O(log log n) binary queries, the upper bound on the maximum load improves to m/n + O(k(log n)1/k) for any m ≥ 1. This result for k queries has several interesting consequences: (i) it implies new bounds for the (1 + β)-process introduced by Peres, Talwar and Wieder (2015), (ii) it leads to new bounds for the graphical balanced allocation process on dense expander graphs, and (iii) it recovers and generalizes the bound of m/n + O(log log n) on the maximum load achieved by the Two-Choice process, including the heavily loaded case m = Ω(n) which was derived in previous works by Berenbrink et al. (2006) as well as Talwar and Wieder (2014). One novel aspect of our proofs is the use of multiple super-exponential potential functions, which might be of use in future work. 2012 ACM Subject Classification Mathematics of computing → Probability and statistics; Mathematics of computing → Discrete mathematics; Theory of computation → Randomness, geometry and discrete structures; Theory of computation → Design and analysis of algorithms","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134115155","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}
引用次数: 13
Noisy Boolean Hidden Matching with Applications 噪声布尔隐藏匹配及其应用
Pub Date : 2021-07-06 DOI: 10.4230/LIPIcs.ITCS.2022.91
Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problems such as triangle and subgraph counting, maximum matching, MAX-CUT, Schatten $p$-norm approximation, maximum acyclic subgraph, testing bipartiteness, $k$-connectivity, and cycle-freeness. The one-way communication complexity of the Boolean Hidden Matching problem on a universe of size $n$ is $Theta(sqrt{n})$, resulting in $Omega(sqrt{n})$ lower bounds for constant factor approximations to several of the aforementioned graph problems. The related (and, in fact, more general) Boolean Hidden Hypermatching (BHH) problem introduced by Verbin and Yu [SODA'11] provides an approach to proving higher lower bounds of $Omega(n^{1-1/t})$ for integer $tgeq 2$. Reductions based on Boolean Hidden Hypermatching generate distributions on graphs with connected components of diameter about $t$, and basically show that long range exploration is hard in the streaming model of computation with adversarial arrivals. In this paper we introduce a natural variant of the BHM problem, called noisy BHM (and its natural noisy BHH variant), that we use to obtain higher than $Omega(sqrt{n})$ lower bounds for approximating several of the aforementioned problems in graph streams when the input graphs consist only of components of diameter bounded by a fixed constant. We also use the noisy BHM problem to show that the problem of classifying whether an underlying graph is isomorphic to a complete binary tree in insertion-only streams requires $Omega(n)$ space, which seems challenging to show using BHM or BHH alone.
在Gavinsky等人[STOC'07]的一篇开创性论文中引入的布尔隐藏匹配(BHM)问题,在图问题的流下界中发挥了重要作用,如三角形和子图计算、最大匹配、MAX-CUT、Schatten $p$ -范数逼近、最大无环子图、测试两部分、$k$ -连通性和无环性。布尔隐藏匹配问题在大小为$n$的宇宙上的单向通信复杂度为$Theta(sqrt{n})$,导致上述几个图问题的常数因子近似的下界为$Omega(sqrt{n})$。Verbin和Yu [SODA'11]提出的相关(实际上是更一般的)布尔隐式超匹配(BHH)问题提供了一种证明整数$tgeq 2$的更高下界$Omega(n^{1-1/t})$的方法。基于布尔隐式超匹配的约简生成了直径约为$t$的连通成分图上的分布,基本表明在具有对抗到达的计算流模型中长距离探索是困难的。在本文中,我们引入了BHM问题的一个自然变体,称为噪声BHM(及其自然噪声BHH变体),当输入图仅由由固定常数限定的直径分量组成时,我们使用它来获得高于$Omega(sqrt{n})$的下界,以近似图流中上述几个问题。我们还使用带噪声的BHM问题来表明,在仅插入流中对底层图是否同构于完全二叉树进行分类的问题需要$Omega(n)$空间,这似乎很难单独使用BHM或BHH来证明。
{"title":"Noisy Boolean Hidden Matching with Applications","authors":"Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou","doi":"10.4230/LIPIcs.ITCS.2022.91","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.91","url":null,"abstract":"The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problems such as triangle and subgraph counting, maximum matching, MAX-CUT, Schatten $p$-norm approximation, maximum acyclic subgraph, testing bipartiteness, $k$-connectivity, and cycle-freeness. The one-way communication complexity of the Boolean Hidden Matching problem on a universe of size $n$ is $Theta(sqrt{n})$, resulting in $Omega(sqrt{n})$ lower bounds for constant factor approximations to several of the aforementioned graph problems. The related (and, in fact, more general) Boolean Hidden Hypermatching (BHH) problem introduced by Verbin and Yu [SODA'11] provides an approach to proving higher lower bounds of $Omega(n^{1-1/t})$ for integer $tgeq 2$. Reductions based on Boolean Hidden Hypermatching generate distributions on graphs with connected components of diameter about $t$, and basically show that long range exploration is hard in the streaming model of computation with adversarial arrivals. In this paper we introduce a natural variant of the BHM problem, called noisy BHM (and its natural noisy BHH variant), that we use to obtain higher than $Omega(sqrt{n})$ lower bounds for approximating several of the aforementioned problems in graph streams when the input graphs consist only of components of diameter bounded by a fixed constant. We also use the noisy BHM problem to show that the problem of classifying whether an underlying graph is isomorphic to a complete binary tree in insertion-only streams requires $Omega(n)$ space, which seems challenging to show using BHM or BHH alone.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131283555","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
Faster Sparse Matrix Inversion and Rank Computation in Finite Fields 有限域稀疏矩阵快速反演与秩计算
Pub Date : 2021-06-17 DOI: 10.4230/LIPIcs.ITCS.2022.33
Sílvia Casacuberta, Rasmus Kyng
We improve the current best running time value to invert sparse matrices over finite fields, lowering it to an expected O (cid:0) n 2 . 2131 (cid:1) time for the current values of fast rectangular matrix multiplication. We achieve the same running time for the computation of the rank and nullspace of a sparse matrix over a finite field. This improvement relies on two key techniques. First, we adopt the decomposition of an arbitrary matrix into block Krylov and Hankel matrices from Eberly et al. (ISSAC 2007). Second, we show how to recover the explicit inverse of a block Hankel matrix using low displacement rank techniques for structured matrices and fast rectangular matrix multiplication algorithms. We generalize our inversion method to block structured matrices with other displacement operators and strengthen the best known upper bounds for explicit inversion of block Toeplitz-like and block Hankel-like matrices, as well as for explicit inversion of block Vandermonde-like matrices with structured blocks. As a further application, we improve the complexity of several algorithms in topological data analysis and in finite group theory.
我们改进了目前在有限域上反演稀疏矩阵的最佳运行时间值,将其降低到预期的O (cid:0) n 2。2131 (cid:1)时间用于快速矩形矩阵乘法的电流值。对于有限域上的稀疏矩阵的秩和零空间的计算,我们实现了相同的运行时间。这种改进依赖于两个关键技术。首先,我们采用Eberly等人(ISSAC 2007)将任意矩阵分解为块Krylov和Hankel矩阵。其次,我们展示了如何使用结构化矩阵的低位移秩技术和快速矩形矩阵乘法算法恢复块汉克尔矩阵的显式逆。我们将我们的反演方法推广到具有其他位移算子的块结构矩阵,并加强了最著名的块Toeplitz-like和块Hankel-like矩阵的显式反演上界,以及具有结构化块的块Vandermonde-like矩阵的显式反演上界。作为进一步的应用,我们提高了拓扑数据分析和有限群理论中几个算法的复杂度。
{"title":"Faster Sparse Matrix Inversion and Rank Computation in Finite Fields","authors":"Sílvia Casacuberta, Rasmus Kyng","doi":"10.4230/LIPIcs.ITCS.2022.33","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.33","url":null,"abstract":"We improve the current best running time value to invert sparse matrices over finite fields, lowering it to an expected O (cid:0) n 2 . 2131 (cid:1) time for the current values of fast rectangular matrix multiplication. We achieve the same running time for the computation of the rank and nullspace of a sparse matrix over a finite field. This improvement relies on two key techniques. First, we adopt the decomposition of an arbitrary matrix into block Krylov and Hankel matrices from Eberly et al. (ISSAC 2007). Second, we show how to recover the explicit inverse of a block Hankel matrix using low displacement rank techniques for structured matrices and fast rectangular matrix multiplication algorithms. We generalize our inversion method to block structured matrices with other displacement operators and strengthen the best known upper bounds for explicit inversion of block Toeplitz-like and block Hankel-like matrices, as well as for explicit inversion of block Vandermonde-like matrices with structured blocks. As a further application, we improve the complexity of several algorithms in topological data analysis and in finite group theory.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131160417","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}
引用次数: 9
Indistinguishability Obfuscation of Null Quantum Circuits and Applications 零量子电路的不可分辨混淆及其应用
Pub Date : 2021-06-11 DOI: 10.4230/LIPIcs.ITCS.2022.15
James Bartusek, Giulio Malavolta
We study the notion of indistinguishability obfuscation for null quantum circuits (quantum null-iO). We present a construction assuming: - The quantum hardness of learning with errors (LWE). - Post-quantum indistinguishability obfuscation for classical circuits. - A notion of ''dual-mode'' classical verification of quantum computation (CVQC). We give evidence that our notion of dual-mode CVQC exists by proposing a scheme that is secure assuming LWE in the quantum random oracle model (QROM). Then we show how quantum null-iO enables a series of new cryptographic primitives that, prior to our work, were unknown to exist even making heuristic assumptions. Among others, we obtain the first witness encryption scheme for QMA, the first publicly verifiable non-interactive zero-knowledge (NIZK) scheme for QMA, and the first attribute-based encryption (ABE) scheme for BQP.
我们研究了零量子电路(quantum zero - io)中不可区分混淆的概念。我们提出了一个假设:-带误差学习(LWE)的量子硬度。-经典电路的后量子不可区分混淆。-量子计算(CVQC)的“双模式”经典验证概念。我们通过提出一个在量子随机oracle模型(QROM)中假设LWE是安全的方案来证明我们的双模CVQC概念存在。然后,我们展示了量子null-iO如何启用一系列新的加密原语,在我们的工作之前,即使做出启发式假设,这些原语也是未知的。其中,我们获得了QMA的第一个证人加密方案、QMA的第一个可公开验证的非交互式零知识(NIZK)加密方案和BQP的第一个基于属性的加密(ABE)方案。
{"title":"Indistinguishability Obfuscation of Null Quantum Circuits and Applications","authors":"James Bartusek, Giulio Malavolta","doi":"10.4230/LIPIcs.ITCS.2022.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.15","url":null,"abstract":"We study the notion of indistinguishability obfuscation for null quantum circuits (quantum null-iO). We present a construction assuming: - The quantum hardness of learning with errors (LWE). - Post-quantum indistinguishability obfuscation for classical circuits. - A notion of ''dual-mode'' classical verification of quantum computation (CVQC). We give evidence that our notion of dual-mode CVQC exists by proposing a scheme that is secure assuming LWE in the quantum random oracle model (QROM). Then we show how quantum null-iO enables a series of new cryptographic primitives that, prior to our work, were unknown to exist even making heuristic assumptions. Among others, we obtain the first witness encryption scheme for QMA, the first publicly verifiable non-interactive zero-knowledge (NIZK) scheme for QMA, and the first attribute-based encryption (ABE) scheme for BQP.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131969251","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}
引用次数: 10
期刊
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