45th Annual IEEE Symposium on Foundations of Computer Science最新文献

筛选
英文 中文
No sorting? Better searching! [optimal array organization] 没有排序?更好的搜索![最优阵列组织]
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2008-03-01 DOI: 10.1145/1328911.1328913
Gianni Franceschini, R. Grossi
{"title":"No sorting? Better searching! [optimal array organization]","authors":"Gianni Franceschini, R. Grossi","doi":"10.1145/1328911.1328913","DOIUrl":"https://doi.org/10.1145/1328911.1328913","url":null,"abstract":"Sorting is commonly meant as the task of arranging keys in increasing or decreasing order (or small variations of this order). Given n keys underlying a total order, the best organization in an array is maintaining them in sorted order. Searching requires /spl Theta/ (log n) comparisons in the worst case, which is optimal. We demonstrate that this basic fact in data structures does not hold for the general case of multidimensional keys, whose comparison cost is proportional to their length. In two papers by Andersson et al. (1994) and Andersson et al. (1995) and the full version in 2001, Andersson et al. study the complexity of searching a sorted array of n keys, each of length k, arranged in lexicographic (or alphabetic) order for an arbitrary, possibly unbounded, ordered alphabet. They give sophisticated arguments for proving a tight bound in the worst case for this basic data organization, up to a constant factor, obtaining /spl Theta/(((k log log n)/(log log (4 + ((k log log n)/log n)))) + k log n) character comparisons (or probes). Note that the bound is /spl Theta/ (log n) when k = 1, which is the case that is well known in algorithmics. We describe a permutation of the n keys that is different from the sorted order, and sorting is just the starting point for describing our preprocessing. When keys are stored according to this \"unsorted\" order in the array, the complexity of searching drops to /spl Theta/ (k + log n) character comparisons (or probes) in the worst case, which is optimal among all possible permutations of the n keys in the array, up to a constant factor. Again, the bound is /spl Theta/ (log n) when k = 1. Jointly with the aforementioned result of Anders son et al., our finding provably shows that keeping k-dimensional keys sorted in an array is not the best data organization for searching. This fact was not observable before by just considering k = O(1) as sorting is an optimal organization in this case. More implications of our result are commented in the introduction.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122713629","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
Dynamic optimality - almost [competitive online binary search tree] 动态最优性——几乎[竞争性在线二叉搜索树]
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2007-04-01 DOI: 10.1137/S0097539705447347
E. Demaine, Dion Harmon, J. Iacono, M. Patrascu
{"title":"Dynamic optimality - almost [competitive online binary search tree]","authors":"E. Demaine, Dion Harmon, J. Iacono, M. Patrascu","doi":"10.1137/S0097539705447347","DOIUrl":"https://doi.org/10.1137/S0097539705447347","url":null,"abstract":"We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator and Tarjan's dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115494698","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}
引用次数: 27
Strong spatial mixing for lattice graphs with fewer colours 具有较少颜色的点阵图的强空间混合
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1109/FOCS.2004.63
L. A. Goldberg, R. Martin, M. Paterson
{"title":"Strong spatial mixing for lattice graphs with fewer colours","authors":"L. A. Goldberg, R. Martin, M. Paterson","doi":"10.1109/FOCS.2004.63","DOIUrl":"https://doi.org/10.1109/FOCS.2004.63","url":null,"abstract":"Recursively-constructed couplings have been used in the past for mixing on trees. We show for the first time how to extend this technique to nontree-like graphs such as the integer lattice. Using this method, we obtain the following general result. Suppose that G is a triangle-free graph and that for some /spl Delta/ /spl ges/ 3, the maximum degree of G is at most /spl Delta/. We show that the spin system consisting of q-colourings of G has strong spatial mixing, provided q > /spl alpha//spl Delta/, where /spl alpha/ /spl ap/ 1.76322 is the solution to /spl alpha//sup /spl alpha// = e. Note that we have no additional lower bound on q or /spl Delta/. This is important for us because our main objective is to have results which are applicable to the lattices studied in statistical physics such as the integer lattice /spl Zopf//sup d/ and the triangular lattice. For these graphs (in fact, for any graph in which the distance-k neighbourhood of a vertex grows sub-exponentially in k), strong spatial mixing implies that there is a unique infinite-volume Gibbs measure. That is, there is one macroscopic equilibrium rather than many. We extend our general result, obtaining, for example, the first \"hand proof\" of strong spatial mixing for 7-colourings of triangle-free 4-regular graphs. (Computer-assisted proofs of this result were provided by Salas and Sokal (1997) for the rectangular lattice and by Bubley et al. (1999)). The extension also gives the first hand proof of strong spatial mixing for 5-colourings of triangle-free 3-regular graphs. (A computer-assisted proof for the special case of the hexagonal lattice was provided by Salas and Sokal). Towards the end of the paper we show how to improve our general technique by considering the geometry of the lattice. The idea is to construct the recursive coupling from a system of recurrences rather than from a single recurrence. We use the geometry of the lattice to derive the system of recurrences. This gives us an analysis with a horizon of more than one level of induction, which leads to improved results. We illustrate this idea by proving strong spatial mixing for q = 10 on the lattice /spl Zopf//sup 3/. Finally, we apply the idea to the triangular lattice, adding computational assistance. This gives us the first (machine-assisted) proof of strong spatial mixing for 10-colourings of the triangular lattice. (Such a proof for 11 colours was given by Salas and Sokal.).","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127735051","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}
引用次数: 34
On the power of discrete and of lexicographic Helly-type theorems 关于离散型定理和字典型定理的幂
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1109/FOCS.2004.47
Nir Halman
{"title":"On the power of discrete and of lexicographic Helly-type theorems","authors":"Nir Halman","doi":"10.1109/FOCS.2004.47","DOIUrl":"https://doi.org/10.1109/FOCS.2004.47","url":null,"abstract":"Helly's theorem says that if every d + 1 elements of a given finite set of convex objects in /spl Ropf//sup d/ have a common point, then there is a point common to all of the objects in the set. We define three types of Helly theorems: discrete Helly theorems - where the common point should belong to an a-priori given set, lexicographic Helly theorems - where the common point should not be lexicographically greater than a given point, and lexicographic-discrete Helly theorems. We show the relations between these Helly theorems and their corresponding (standard) Helly theorems. We obtain several discrete and lexicographic Helly numbers. Using these types of Helly theorems we get linear time solutions for various optimization problems. For this, we define a framework, DLP-type (discrete linear programming type), and provide algorithms that solve in randomized linear time fixed-dimensional DLP-type problems. We show that the complexity of the DLP-type class stands somewhere between linear programming (LP) and integer programming (IP). Finally, we use our results in order to solve in randomized linear time problems such as the discrete p-center on the real line, the discrete weighted 1-center problem in /spl Ropf//sup d/ with l/sub /spl infin// norm, the standard (continuous) problem of finding a line transversal for a totally separable set of planar convex objects, a discrete version of the problem of finding a line transversal for a set of axis-parallel planar rectangles, and the (planar) lexicographic rectilinear p-center problem for p = 1,2,3. These are the first known linear time algorithms for these problems.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127735127","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
The price of stability for network design with fair cost allocation 网络设计稳定的代价与公平的成本分配
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1109/FOCS.2004.68
Elliot Anshelevich, Anirban Dasgupta, J. Kleinberg, É. Tardos, T. Wexler, T. Roughgarden
{"title":"The price of stability for network design with fair cost allocation","authors":"Elliot Anshelevich, Anirban Dasgupta, J. Kleinberg, É. Tardos, T. Wexler, T. Roughgarden","doi":"10.1109/FOCS.2004.68","DOIUrl":"https://doi.org/10.1109/FOCS.2004.68","url":null,"abstract":"Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of self-interested agents who want to form a network connecting certain endpoints, the set of stable solutions - the Nash equilibria - may look quite different from the centrally enforced optimum. We study the quality of the best Nash equilibrium, and refer to the ratio of its cost to the optimum network cost as the price of stability. The best Nash equilibrium solution has a natural meaning of stability in this context - it is the optimal solution that can be proposed from which no user will \"defect\". We consider the price of stability for network design with respect to one of the most widely-studied protocols for network cost allocation, in which the cost of each edge is divided equally between users whose connections make use of it; this fair-division scheme can be derived from the Shapley value, and has a number of basic economic motivations. We show that the price of stability for network design with respect to this fair cost allocation is O(log k), where k is the number of users, and that a good Nash equilibrium can be achieved via best-response dynamics in which users iteratively defect from a starting solution. This establishes that the fair cost allocation protocol is in fact a useful mechanism for inducing strategic behavior to form near-optimal equilibria. We discuss connections to the class of potential games defined by Monderer and Shapley, and extend our results to cases in which users are seeking to balance network design costs with latencies in the constructed network, with stronger results when the network has only delays and no construction costs. We also present bounds on the convergence time of best-response dynamics, and discuss extensions to a weighted game.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115980517","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}
引用次数: 941
Algebras with polynomial identities and computing the determinant 多项式恒等式代数和计算行列式
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1137/S0097539705447359
Steve Chien, A. Sinclair
{"title":"Algebras with polynomial identities and computing the determinant","authors":"Steve Chien, A. Sinclair","doi":"10.1137/S0097539705447359","DOIUrl":"https://doi.org/10.1137/S0097539705447359","url":null,"abstract":"Nisan (1991) proved an exponential lower bound on the size of an algebraic branching program (ABP) that computes the determinant of a matrix in the non-commutative \"free algebra\" setting, in which there are no non-trivial relationships between the matrix entries. By contrast, when the matrix entries commute there are polynomial size ABPs for the determinant. This paper extends Nisan's result to a much wider class of non-commutative algebras, including all non-trivial matrix algebras over any field of characteristic 0, group algebras of all non-abelian finite groups over algebraically closed fields of characteristic 0, the quaternion algebra and the Clifford algebras. As a result, we obtain more compelling evidence for the essential role played by commutativity in the efficient computation of the determinant. The key to our approach is a characterization of non-commutative algebras by means of the polynomial identities that they satisfy. Extending Nisan's lower bound framework, we find that any reduction in complexity compared to the free algebra must arise from the ability of the identities to reduce the rank of certain naturally associated matrices. Using results from the theory of algebras with polynomial identities, we are able to show that none of the identities of the above classes of algebras is able to achieve such a rank reduction.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131297787","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}
引用次数: 28
Optimal power-down strategies 最优断电策略
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1137/05063787X
John E. Augustine, S. Irani, Chaitanya Swamy
{"title":"Optimal power-down strategies","authors":"John E. Augustine, S. Irani, Chaitanya Swamy","doi":"10.1137/05063787X","DOIUrl":"https://doi.org/10.1137/05063787X","url":null,"abstract":"We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active and a single sleep state is a continuous version of the ski-rental problem. We consider a generalized version in which there is more than one sleep state, each with its own power consumption rate and transition costs. We give an algorithm that, given a system, produces a deterministic strategy whose competitive ratio is arbitrarily close to optimal. We also give an algorithm to produce the optimal online strategy given a system and a probability distribution that generates the length of the idle period. We also give a simple algorithm that achieves a competitive ratio of 3 + 2/spl radic/2 /spl ap/ 5.828 for any system.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123828533","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}
引用次数: 137
Approximating edit distance efficiently 有效地逼近编辑距离
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1109/FOCS.2004.14
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
{"title":"Approximating edit distance efficiently","authors":"Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar","doi":"10.1109/FOCS.2004.14","DOIUrl":"https://doi.org/10.1109/FOCS.2004.14","url":null,"abstract":"Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to approximate it to within a modest factor. Furthermore, for various natural algorithmic problems such as low-distortion embeddings into normed spaces, approximate nearest-neighbor schemes, and sketching algorithms, known results for the edit distance are rather weak. We develop algorithms that solve gap versions of the edit distance problem: given two strings of length n with the promise that their edit distance is either at most k or greater than /spl lscr/, decide which of the two holds. We present two sketching algorithms for gap versions of edit distance. Our first algorithm solves the k vs. (kn)/sup 2/3/ gap problem, using a constant size sketch. A more involved algorithm solves the stronger k vs. /spl lscr/ gap problem, where /spl lscr/ can be as small as O(k/sup 2/) - still with a constant sketch - but works only for strings that are mildly \"nonrepetitive\". Finally, we develop an n/sup 3/7/-approximation quasilinear time algorithm for edit distance, improving the previous best factor of n/sup 3/4/ (Cole and Hariharan, 2002); if the input strings are assumed to be nonrepetitive, then the approximation factor can be strengthened to n/sup 1/3/.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125602267","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}
引用次数: 144
On the streaming model augmented with a sorting primitive 在流模型上增加了排序原语
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1109/FOCS.2004.48
Gagan Aggarwal, Mayur Datar, S. Rajagopalan, M. Ruhl
{"title":"On the streaming model augmented with a sorting primitive","authors":"Gagan Aggarwal, Mayur Datar, S. Rajagopalan, M. Ruhl","doi":"10.1109/FOCS.2004.48","DOIUrl":"https://doi.org/10.1109/FOCS.2004.48","url":null,"abstract":"The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quality of a realistic model is that it can be efficiently implemented across a wide range of platforms and operating systems. In this paper, we study the computational model that results if the streaming model is augmented with a sorting primitive. We argue that this model is highly practical, and that a wide range of important problems can be efficiently solved in this (relatively weak) model. Examples are undirected connectivity, minimum spanning trees, and red-blue line segment intersection, among others. This suggests that using more powerful, harder to implement models may not always be justified. Our main technical contribution is to show a hardness result for the \"streaming and sorting\" model, which demonstrates that the main limitation of this model is that it can only access one data stream at a time. Since our model is strong enough to solve \"pointer chasing\" problems, the communication complexity based techniques commonly used in showing lower bounds for the streaming model cannot be adapted to our model. We therefore have to employ techniques to obtain these results. Finally, we compare our model to a popular restriction of external memory algorithms that access their data mostly sequentially.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122470922","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}
引用次数: 96
Dynamic transitive closure via dynamic matrix inverse: extended abstract 基于动态矩阵逆的动态传递闭包:扩展抽象
45th Annual IEEE Symposium on Foundations of Computer Science Pub Date : 2004-10-17 DOI: 10.1109/FOCS.2004.25
P. Sankowski
{"title":"Dynamic transitive closure via dynamic matrix inverse: extended abstract","authors":"P. Sankowski","doi":"10.1109/FOCS.2004.25","DOIUrl":"https://doi.org/10.1109/FOCS.2004.25","url":null,"abstract":"We consider dynamic evaluation of algebraic functions such as computing determinant, matrix adjoint, matrix inverse and solving linear system of equations. We show that in the dynamic setup the above problems can be solved faster than evaluating everything from scratch. In the case when rows and columns of the matrix can change we show an algorithm that achieves O(n/sup 2/) arithmetic operations per update and O(1) arithmetic operations per query. Next, we describe two algorithms, with different tradeoffs, for updating the inverse and determinant when single entries of the matrix are changed. The fastest update for the first tradeoff is O(n/sup 1.575/) arithmetic operations per update and O(n/sup 0.575/) arithmetic operations per query. The second tradeoff gives O(n/sup 1.495/) arithmetic operations per update and O(n/sup 1.495/) arithmetic operations per query. We also consider the case when some number of columns or rows can change. We use dynamic determinant computations to solve the following problems in the dynamic setup: computing the number of spanning trees in a graph and testing if an edge in a graph is contained in some perfect matching. These are the first dynamic algorithms for these problems. Next, with the use of dynamic matrix inverse, we solve fully dynamic transitive closure in general directed graphs. The bounds on arithmetic operations for dynamic matrix inverse translate directly to time bounds for dynamic transitive closure. Thus we obtain the first known algorithm with O(n/sup 2/) worst-case update time and constant query time and two algorithms for transitive closure in general digraphs with subquadratic update and query times. Our algorithms for transitive closure are randomized with one-sided error. We also consider for the first time the case when the edges incident with a part of vertices of the graph can be changed.","PeriodicalId":443252,"journal":{"name":"45th Annual IEEE Symposium on Foundations of Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125075185","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}
引用次数: 86
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书