首页 > 最新文献

Discrete Mathematics and Applications最新文献

英文 中文
Medial strongly dependent n-ary operations 中间强依赖的n元运算
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-08-01 DOI: 10.1515/dma-2021-0022
A. V. Cheremushkin
Abstract We prove an analogue of Toyoda–Belousov theorem on the structure of medial n-quasigroups for the case of strongly dependent n-ary operations.
摘要在强相关n元操作的情况下,证明了关于中间n-拟群结构的一个类似的Toyoda-Belousov定理。
{"title":"Medial strongly dependent n-ary operations","authors":"A. V. Cheremushkin","doi":"10.1515/dma-2021-0022","DOIUrl":"https://doi.org/10.1515/dma-2021-0022","url":null,"abstract":"Abstract We prove an analogue of Toyoda–Belousov theorem on the structure of medial n-quasigroups for the case of strongly dependent n-ary operations.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"251 - 258"},"PeriodicalIF":0.5,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42079310","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
Implementation complexity of Boolean functions with a small number of ones 具有少量1的布尔函数的实现复杂性
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-08-01 DOI: 10.1515/dma-2021-0024
N. P. Redkin
Abstract We consider the class Fn, k consisting of n-ary Boolean functions that take the value one on exactly k input tuples. For small values of k the class Fn, k is splitted into subclasses, and for every subclass we find the asymptotics of the Shannon function of circuit implementation in the basis {x&y,x‾} $ {x&y,overline x} $ (or in the basis {x∨y,x‾}) $ {xvee y,overline x}) $ ; the weights of the basic gates are arbitrary strictly positive numbers.
摘要我们考虑由n元布尔函数组成的类Fn,k,该函数在恰好k个输入元组上取值1。对于k的小值,类Fn,k被划分为子类,并且对于每个子类,我们在基{x&y,x‾}${x&y,overline x}$(或在基{x⁄y,x{8254})${xvee y,overline x})$中找到电路实现的Shannon函数的渐近性;基本门的权重是任意的严格正数。
{"title":"Implementation complexity of Boolean functions with a small number of ones","authors":"N. P. Redkin","doi":"10.1515/dma-2021-0024","DOIUrl":"https://doi.org/10.1515/dma-2021-0024","url":null,"abstract":"Abstract We consider the class Fn, k consisting of n-ary Boolean functions that take the value one on exactly k input tuples. For small values of k the class Fn, k is splitted into subclasses, and for every subclass we find the asymptotics of the Shannon function of circuit implementation in the basis {x&y,x‾} $ {x&y,overline x} $ (or in the basis {x∨y,x‾}) $ {xvee y,overline x}) $ ; the weights of the basic gates are arbitrary strictly positive numbers.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"271 - 279"},"PeriodicalIF":0.5,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42341160","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
Learning of monotone functions with single error correction 单误差校正单调函数的学习
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-0017
S. Selezneva, Yongqing Liu
Abstract Learning of monotone functions is a well-known problem. Results obtained by V. K. Korobkov and G. Hansel imply that the complexity φM(n) of learning of monotone Boolean functions equals Cn⌊n/2⌋ $begin{array}{} displaystyle C_n^{lfloor n/2rfloor} end{array}$ + Cn⌊n/2⌋+1 $begin{array}{} displaystyle C_n^{lfloor n/2rfloor+1} end{array}$ (φM(n) denotes the least number of queries on the value of an unknown monotone function on a given input sufficient to identify an arbitrary n-ary monotone function). In our paper we consider learning of monotone functions in the case when the teacher is allowed to return an incorrect response to at most one query on the value of an unknown function so that it is still possible to correctly identify the function. We show that learning complexity in case of the possibility of a single error is equal to the complexity in the situation when all responses are correct.
单调函数的抽象学习是一个众所周知的问题。V.K.Korobkov和G。Hansel暗示单调布尔函数学习的复杂度φM(n)等于Cn⌊n/2⌋$bear{array}{}displaystyle C_n^{lfloor n/2rfloor}end{array}$+Cn 8970;n/2𕯯+1$bearn{array}{}displaystyle C_n^} lfloor n/2rfoor+1}end{array}$(φM(n)表示在给定输入上对未知单调函数值的查询次数最少,足以识别任意n元单调函数)。在我们的论文中,我们考虑了单调函数的学习,当教师被允许对未知函数的值的最多一个查询返回错误的响应时,这样仍然可以正确地识别函数。我们证明,在可能出现单个错误的情况下,学习的复杂性等于在所有回答都正确的情况下的复杂性。
{"title":"Learning of monotone functions with single error correction","authors":"S. Selezneva, Yongqing Liu","doi":"10.1515/dma-2021-0017","DOIUrl":"https://doi.org/10.1515/dma-2021-0017","url":null,"abstract":"Abstract Learning of monotone functions is a well-known problem. Results obtained by V. K. Korobkov and G. Hansel imply that the complexity φM(n) of learning of monotone Boolean functions equals Cn⌊n/2⌋ $begin{array}{} displaystyle C_n^{lfloor n/2rfloor} end{array}$ + Cn⌊n/2⌋+1 $begin{array}{} displaystyle C_n^{lfloor n/2rfloor+1} end{array}$ (φM(n) denotes the least number of queries on the value of an unknown monotone function on a given input sufficient to identify an arbitrary n-ary monotone function). In our paper we consider learning of monotone functions in the case when the teacher is allowed to return an incorrect response to at most one query on the value of an unknown function so that it is still possible to correctly identify the function. We show that learning complexity in case of the possibility of a single error is equal to the complexity in the situation when all responses are correct.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"193 - 205"},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49212931","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
Bounds on Shannon functions of lengths of contact closure tests for contact circuits 接触电路接触闭合试验长度Shannon函数的界
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-0015
K. A. Popkov
Abstract We consider the problem of synthesis of irredundant two-pole contact circuits which implement n-place Boolean functions and allow short single fault detection or diagnostic tests of closures of at most k contacts. We prove that the Shannon function of the length of a fault detection test is equal to n for any n and k, and that the Shannon function of the length of a diagnostic test is majorized by n + k(n − 2) for n ⩾ 2.
摘要我们考虑了无冗余双极接触电路的合成问题,该电路实现n位布尔函数,并允许对最多k个接触的闭合进行短的单故障检测或诊断测试。我们证明了对于任何n和k,故障检测测试长度的Shannon函数等于n,并且对于n⩾2,诊断测试长度的香农函数由n+k(n−2)决定。
{"title":"Bounds on Shannon functions of lengths of contact closure tests for contact circuits","authors":"K. A. Popkov","doi":"10.1515/dma-2021-0015","DOIUrl":"https://doi.org/10.1515/dma-2021-0015","url":null,"abstract":"Abstract We consider the problem of synthesis of irredundant two-pole contact circuits which implement n-place Boolean functions and allow short single fault detection or diagnostic tests of closures of at most k contacts. We prove that the Shannon function of the length of a fault detection test is equal to n for any n and k, and that the Shannon function of the length of a diagnostic test is majorized by n + k(n − 2) for n ⩾ 2.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"165 - 178"},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49638077","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
Convex algebras of probability distributions induced by finite associative rings 有限结合环诱导概率分布的凸代数
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-0019
A. Yashunsky
Abstract We consider the transformations of random variables over a finite associative ring by the addition and multiplication operations. For arbitrary finite rings, we construct families of distribution algebras, which are sets of distributions closed over sums and products of independent random variables.
摘要我们通过加法和乘法运算来考虑有限结合环上随机变量的变换。对于任意有限环,我们构造了分布代数族,它们是在独立随机变量的和和积上闭合的分布集。
{"title":"Convex algebras of probability distributions induced by finite associative rings","authors":"A. Yashunsky","doi":"10.1515/dma-2021-0019","DOIUrl":"https://doi.org/10.1515/dma-2021-0019","url":null,"abstract":"Abstract We consider the transformations of random variables over a finite associative ring by the addition and multiplication operations. For arbitrary finite rings, we construct families of distribution algebras, which are sets of distributions closed over sums and products of independent random variables.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"223 - 230"},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/dma-2021-0019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43618396","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
On the action of the implicative closure operator on the set of partial functions of the multivalued logic 关于蕴涵闭包算子在多值逻辑部分函数集上的作用
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-0014
S. Marchenkov
Abstract On the set Pk∗ $begin{array}{} displaystyle P_k^* end{array}$ of partial functions of the k-valued logic, we consider the implicative closure operator, which is the extension of the parametric closure operator via the logical implication. It is proved that, for any k ⩾ 2, the number of implicative closed classes in Pk∗ $begin{array}{} displaystyle P_k^* end{array}$ is finite. For any k ⩾ 2, in Pk∗ $begin{array}{} displaystyle P_k^* end{array}$ two series of implicative closed classes are defined. We show that these two series exhaust all implicative precomplete classes. We also identify all 8 atoms of the lattice of implicative closed classes in P3∗ $begin{array}{} displaystyle P_3^* end{array}$.
在k值逻辑的偏函数集合Pk * $begin{array}{} displaystyle P_k^* end{array}$上,我们考虑隐含闭包算子,它是参数闭包算子经逻辑蕴涵的扩展。证明了,对于任何k大于或等于2,Pk∗$begin{array}{} displaystyle P_k^* end{array}$中的隐含封闭类的数量是有限的。对于任何k小于2,在Pk∗$begin{array}{} displaystyle P_k^* end{array}$中定义了两个系列的隐含封闭类。我们证明了这两个系列用尽了所有隐含的预完成类。我们还鉴定了P3 * $begin{array}{} displaystyle P_3^* end{array}$中隐含闭类晶格的全部8个原子。
{"title":"On the action of the implicative closure operator on the set of partial functions of the multivalued logic","authors":"S. Marchenkov","doi":"10.1515/dma-2021-0014","DOIUrl":"https://doi.org/10.1515/dma-2021-0014","url":null,"abstract":"Abstract On the set Pk∗ $begin{array}{} displaystyle P_k^* end{array}$ of partial functions of the k-valued logic, we consider the implicative closure operator, which is the extension of the parametric closure operator via the logical implication. It is proved that, for any k ⩾ 2, the number of implicative closed classes in Pk∗ $begin{array}{} displaystyle P_k^* end{array}$ is finite. For any k ⩾ 2, in Pk∗ $begin{array}{} displaystyle P_k^* end{array}$ two series of implicative closed classes are defined. We show that these two series exhaust all implicative precomplete classes. We also identify all 8 atoms of the lattice of implicative closed classes in P3∗ $begin{array}{} displaystyle P_3^* end{array}$.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"155 - 164"},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/dma-2021-0014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41993872","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
Frontmatter Frontmatter
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-frontmatter3
{"title":"Frontmatter","authors":"","doi":"10.1515/dma-2021-frontmatter3","DOIUrl":"https://doi.org/10.1515/dma-2021-frontmatter3","url":null,"abstract":"","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"1 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/dma-2021-frontmatter3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42895513","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
Conditions of A-completeness for linear automata over dyadic rationals 并矢有理上线性自动机的a -完备性条件
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-0016
Dmitriy V. Ronzhin
Abstract We consider the problem of A-completeness in the class of linear automata such that the sets of inputs, outputs and states are Cartesian products of dyadic rationals; systems checked for completeness are comprised of a variable finite set and a fixed additional set. We obtain conditions of A-completeness in terms of maximal subclasses in the cases when the additional set is the set of all unary automata and when the additional set consists of the adder.
摘要我们考虑了一类线性自动机的A-完备性问题,使得输入、输出和状态的集合是二元理性的笛卡尔乘积;完整性检验系统由一个可变有限集和一个固定附加集组成。当附加集是所有一元自动机的集合时,以及当附加集由加法器组成时,我们得到了关于最大子类的A-完备条件。
{"title":"Conditions of A-completeness for linear automata over dyadic rationals","authors":"Dmitriy V. Ronzhin","doi":"10.1515/dma-2021-0016","DOIUrl":"https://doi.org/10.1515/dma-2021-0016","url":null,"abstract":"Abstract We consider the problem of A-completeness in the class of linear automata such that the sets of inputs, outputs and states are Cartesian products of dyadic rationals; systems checked for completeness are comprised of a variable finite set and a fixed additional set. We obtain conditions of A-completeness in terms of maximal subclasses in the cases when the additional set is the set of all unary automata and when the additional set consists of the adder.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"179 - 192"},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41366856","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
Multitype weakly subcritical branching processes in random environment 随机环境下的多型弱亚临界分支过程
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-06-01 DOI: 10.1515/dma-2021-0018
V. Vatutin, E. Dyakonova
Abstract A multi-type branching process evolving in a random environment generated by a sequence of independent identically distributed random variables is considered. The asymptotics of the survival probability of the process for a long time is found under the assumption that the matrices of the mean values of direct descendants have a common left eigenvector and the increment X of the associated random walk generated by the logarithms of the Perron roots of these matrices satisfies conditions EX < 0 and EXeX > 0.
摘要研究了在由独立同分布随机变量序列产生的随机环境中演化的多类型分支过程。在直系后代均值的矩阵有一个共同的左特征向量,并且由这些矩阵的Perron根的对数产生的相关随机游走的增量X满足条件EX < 0和EXeX > 0的假设下,发现了长时间过程的生存概率的渐近性。
{"title":"Multitype weakly subcritical branching processes in random environment","authors":"V. Vatutin, E. Dyakonova","doi":"10.1515/dma-2021-0018","DOIUrl":"https://doi.org/10.1515/dma-2021-0018","url":null,"abstract":"Abstract A multi-type branching process evolving in a random environment generated by a sequence of independent identically distributed random variables is considered. The asymptotics of the survival probability of the process for a long time is found under the assumption that the matrices of the mean values of direct descendants have a common left eigenvector and the increment X of the associated random walk generated by the logarithms of the Perron roots of these matrices satisfies conditions EX < 0 and EXeX > 0.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"207 - 222"},"PeriodicalIF":0.5,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48069323","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
Trees with a given number of leaves and the maximal number of maximum independent sets 具有给定叶数和最大独立集数的树
IF 0.5 Q4 MATHEMATICS, APPLIED Pub Date : 2021-04-01 DOI: 10.1515/dma-2021-0012
D. S. Taletskii, D. Malyshev
Abstract A complete description of trees with maximal possible number of maximum independent sets among all n-vertex trees with exactly l leaves is obtained. For all values of the parameters n and l the extremal tree is unique and is the result of merging the endpoints of l simple paths.
摘要:给出了在所有恰好有l个叶子的n顶点树中具有最大独立集的最大可能数的树的完整描述。对于参数n和l的所有值,极值树是唯一的,并且是合并l个简单路径的端点的结果。
{"title":"Trees with a given number of leaves and the maximal number of maximum independent sets","authors":"D. S. Taletskii, D. Malyshev","doi":"10.1515/dma-2021-0012","DOIUrl":"https://doi.org/10.1515/dma-2021-0012","url":null,"abstract":"Abstract A complete description of trees with maximal possible number of maximum independent sets among all n-vertex trees with exactly l leaves is obtained. For all values of the parameters n and l the extremal tree is unique and is the result of merging the endpoints of l simple paths.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"31 1","pages":"135 - 144"},"PeriodicalIF":0.5,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44756109","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
期刊
Discrete Mathematics and Applications
全部 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1