发布求助
文献互助 智能选刊 最新文献

RAIRO Theor. Informatics Appl.最新文献

筛选
英文 中文
Cohesiveness in promise problems 承诺问题中的凝聚力
RAIRO Theor. Informatics Appl. Pub Date : 2013-10-01 DOI: 10.1051/ita/2013042
U. Brandt, H. Walter
{"title":"Cohesiveness in promise problems","authors":"U. Brandt, H. Walter","doi":"10.1051/ita/2013042","DOIUrl":"https://doi.org/10.1051/ita/2013042","url":null,"abstract":"Promise problems have been introduced in 1985 by S. Even e.a. as a generalization of decision problems. Using a very general approach we study solvability and unsolvability conditions for promise problems of set and language families. We show, that cores of unsolvability are completely determined by partitions of cohesive sets. We prove the existence of cores in unsolvable promise problems assuming certain closure properties for the given set family. Connections to immune sets and complexity cores are presented. Furthermore, results about cohesiveness with respect to the language families from the Chomsky hierarchy are given.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131954806","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
GLS: New class of generalized Legendre sequences with optimal arithmetic cross-correlation 一类具有最优算术互相关的广义Legendre序列
RAIRO Theor. Informatics Appl. Pub Date : 2013-10-01 DOI: 10.1051/ita/2013043
Huijuan Wang, Q. Wen, Jie Zhang
{"title":"GLS: New class of generalized Legendre sequences with optimal arithmetic cross-correlation","authors":"Huijuan Wang, Q. Wen, Jie Zhang","doi":"10.1051/ita/2013043","DOIUrl":"https://doi.org/10.1051/ita/2013043","url":null,"abstract":"The Legendre symbol has been used to construct sequences with ideal cross-correlation, but it was never used in the arithmetic cross-correlation. In this paper, a new class of generalized Legendre sequences are described and analyzed with respect to their period, distributional, arithmetic cross-correlation and distinctness properties. This analysis gives a new approach to study the connection between the Legendre symbol and the arithmetic cross-correlation. In the end of this paper, possible application of these sequences with optimal arithmetic cross-correlation is indicated.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582943","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}
引用次数: 4
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems 最大k集覆盖的参数化精确和近似算法及相关的可满足性问题
RAIRO Theor. Informatics Appl. Pub Date : 2013-09-18 DOI: 10.1051/ita/2016022
É. Bonnet, V. Paschos, Florian Sikora
{"title":"Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems","authors":"É. Bonnet, V. Paschos, Florian Sikora","doi":"10.1051/ita/2016022","DOIUrl":"https://doi.org/10.1051/ita/2016022","url":null,"abstract":"Given a family of subsets S over a set of elements X and two integers p and k, max k-set cover consists of finding a subfamily T ⊆ S of cardinality at most k, covering at least p elements of X. This problem is W[2]-hard when parameterized by k, and FPT when parameterized by p. We investigate the parameterized approximability of the problem with respect to parameters k and p. Then, we show that max sat-k, a satisfiability problem generalizing max k-set cover, is also FPT with respect to parameter p.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131493576","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}
引用次数: 25
New applications of the wreath product of forest algebras 森林代数环积的新应用
RAIRO Theor. Informatics Appl. Pub Date : 2013-07-01 DOI: 10.1051/ita/2013039
Howard Straubing
{"title":"New applications of the wreath product of forest algebras","authors":"Howard Straubing","doi":"10.1051/ita/2013039","DOIUrl":"https://doi.org/10.1051/ita/2013039","url":null,"abstract":"We give several new applications of the wreath product of forest algebras to the study of logics on trees. These include new simplified proofs of necessary conditions for definability in CTL and first-order logic with the ancestor relation; a sequence of identities satisfied by all forest languages definable in PDL ; and new examples of languages outside CTL, along with an application to the question of what properties are definable in both CTL and LTL .","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127506170","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
Minimal 2-dominating sets in trees 树中的最小2支配集
RAIRO Theor. Informatics Appl. Pub Date : 2013-07-01 DOI: 10.1051/ita/2013036
Marcin Krzywkowski
{"title":"Minimal 2-dominating sets in trees","authors":"Marcin Krzywkowski","doi":"10.1051/ita/2013036","DOIUrl":"https://doi.org/10.1051/ita/2013036","url":null,"abstract":"We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time 𝒪(1.3248n ). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496816","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
Abelian periods, partial words, and an extension of a theorem of Fine and Wilf 阿贝尔周期，部分词，以及Fine和Wilf定理的推广
RAIRO Theor. Informatics Appl. Pub Date : 2013-07-01 DOI: 10.1051/ita/2013034
F. Blanchet-Sadri, S. Simmons, Amelia Tebbe, A. Veprauskas
{"title":"Abelian periods, partial words, and an extension of a theorem of Fine and Wilf","authors":"F. Blanchet-Sadri, S. Simmons, Amelia Tebbe, A. Veprauskas","doi":"10.1051/ita/2013034","DOIUrl":"https://doi.org/10.1051/ita/2013034","url":null,"abstract":"Recently, Constantinescu and Ilie proved a variant of the wellknown periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods and conjectured a result for the case of two nonrelatively prime abelian periods. In this paper, we answer some open problems they suggested. We show that their conjecture is false but we give bounds, that depend on the two abelian periods, such that the conjecture is true for all words having length at least those bounds and show that some of them are optimal. We also extend their study to the context of partial words, giving optimal lengths and describing an algorithm for constructing optimal words.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127128650","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}
引用次数: 16
Analysis of a near-metric TSP approximation algorithm 一种近度量TSP逼近算法的分析
RAIRO Theor. Informatics Appl. Pub Date : 2013-07-01 DOI: 10.1051/ita/2013040
S. Krug
{"title":"Analysis of a near-metric TSP approximation algorithm","authors":"S. Krug","doi":"10.1051/ita/2013040","DOIUrl":"https://doi.org/10.1051/ita/2013040","url":null,"abstract":"The traveling salesman problem (TSP) is one of the most fundamental optimization problems. We consider the β -metric traveling salesman problem (Δ β -TSP), i.e. , the TSP restricted to graphs satisfying the β -triangle inequality c ({v,w }) ≤ β (c ({v,u }) + c ({u,w })), for some cost function c and any three vertices u,v,w . The well-known path matching Christofides algorithm (PMCA) guarantees an approximation ratio of 3β 2 /2 and is the best known algorithm for the Δ β -TSP, for 1 ≤ β  ≤ 2. We provide a complete analysis of the algorithm. First, we correct an error in the original implementation that may produce an invalid solution. Using a worst-case example, we then show that the algorithm cannot guarantee a better approximation ratio. The example can also be used for the PMCA variants for the Hamiltonian path problem with zero and one prespecified endpoints. For two prespecified endpoints, we cannot reuse the example, but we construct another worst-case example to show the optimality of the analysis also in this case.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130142237","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
Interval exchanges, admissibility and branching Rauzy induction 区间交换、容许性和分支Rauzy归纳
RAIRO Theor. Informatics Appl. Pub Date : 2013-05-01 DOI: 10.1051/ita/2017004
F. Dolce, D. Perrin
{"title":"Interval exchanges, admissibility and branching Rauzy induction","authors":"F. Dolce, D. Perrin","doi":"10.1051/ita/2017004","DOIUrl":"https://doi.org/10.1051/ita/2017004","url":null,"abstract":"We introduce a definition of admissibility for subintervals in interval exchange transformations. Using this notion, we prove a property of the natural codings of interval exchange transformations, namely that any derived set of a regular interval exchange set is a regular interval exchange set with the same number of intervals. Derivation is taken here with respect to return words. We characterize the admissible intervals using a branching version of the Rauzy induction. We also study the case of regular interval exchange transformations defined over a quadratic field and show that the set of factors of such a transformation is primitive morphic. The proof uses an extension of a result of Boshernitzan and Carroll.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132451295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On the hardness of game equivalence under local isomorphism 局部同构下对策等价的硬度
RAIRO Theor. Informatics Appl. Pub Date : 2013-04-01 DOI: 10.1051/ita/2012024
J. Gabarró, Alina García, M. Serna
{"title":"On the hardness of game equivalence under local isomorphism","authors":"J. Gabarró, Alina García, M. Serna","doi":"10.1051/ita/2012024","DOIUrl":"https://doi.org/10.1051/ita/2012024","url":null,"abstract":"We introduce a type of isomorphism among strategic games that we call local\u0000 isomorphism . Local isomorphisms is a weaker version of the notions of strong\u0000 and weak game isomorphism introduced in [J. Gabarro, A. Garcia and M. Serna,\u0000 Theor. Comput. Sci. 412 (2011) 6675–6695]. In a local\u0000 isomorphism it is required to preserve, for any player, the player’s preferences on the\u0000 sets of strategy profiles that differ only in the action selected by this player. We show\u0000 that the game isomorphism problem for local isomorphism is equivalent to the same problem\u0000 for strong or weak isomorphism for strategic games given in: general, extensive and\u0000 formula general form. As a consequence of the results in [J. Gabarro, A. Garcia and M.\u0000 Serna, Theor. Comput. Sci. 412 (2011) 6675–6695] this\u0000 implies that local isomorphism problem for strategic games is equivalent to (a) the\u0000 circuit isomorphism problem for games given in general form, (b) the boolean formula\u0000 isomorphism problem for formula games in general form, and (c) the graph isomorphism\u0000 problem for games given in explicit form.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122176444","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
A note on constructing infinite binary words with polynomial subword complexity 构造具有多项式子词复杂度的无限二进制词的注释
RAIRO Theor. Informatics Appl. Pub Date : 2013-04-01 DOI: 10.1051/ita/2013033
F. Blanchet-Sadri, Bob Chen, Sinziana Munteanu
{"title":"A note on constructing infinite binary words with polynomial subword complexity","authors":"F. Blanchet-Sadri, Bob Chen, Sinziana Munteanu","doi":"10.1051/ita/2013033","DOIUrl":"https://doi.org/10.1051/ita/2013033","url":null,"abstract":"Most of the constructions of infinite words having polynomial subword complexity are quite complicated, e.g. , sequences of Toeplitz, sequences defined by billiards in the cube, etc. In this paper, we describe a simple method for constructing infinite words w over a binary alphabet  { a,b  }  with polynomial subword complexity p w . Assuming w contains an infinite number of a ’s, our method is based on the gap function which gives the distances between consecutive b ’s. It is known that if the gap function is injective, we can obtain at most quadratic subword complexity, and if the gap function is blockwise injective, we can obtain at most cubic subword complexity. Here, we construct infinite binary words w such that p w (n ) = Θ (n β ) for any real number β  > 1.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121205719","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
首页 上一页 下一页 尾页
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学术官方微信