Pub Date : 2022-09-17DOI: 10.48550/arXiv.2209.08427
N. Bansal, John Kuszmaul, William Kuszmaul
In the $d$-dimensional cow-path problem, a cow living in $mathbb{R}^d$ must locate a $(d - 1)$-dimensional hyperplane $H$ whose location is unknown. The only way that the cow can find $H$ is to roam $mathbb{R}^d$ until it intersects $mathcal{H}$. If the cow travels a total distance $s$ to locate a hyperplane $H$ whose distance from the origin was $r ge 1$, then the cow is said to achieve competitive ratio $s / r$. It is a classic result that, in $mathbb{R}^2$, the optimal (deterministic) competitive ratio is $9$. In $mathbb{R}^3$, the optimal competitive ratio is known to be at most $approx 13.811$. But in higher dimensions, the asymptotic relationship between $d$ and the optimal competitive ratio remains an open question. The best upper and lower bounds, due to Antoniadis et al., are $O(d^{3/2})$ and $Omega(d)$, leaving a gap of roughly $sqrt{d}$. In this note, we achieve a stronger lower bound of $tilde{Omega}(d^{3/2})$.
在$d$维牛道问题中，居住在$mathbb{R}^d$的牛必须找到一个位置未知的$(d - 1)$维超平面$H$。母牛能找到$H$的唯一方法是在$mathbb{R}^d$上漫游，直到它与$mathcal{H}$相交。如果牛走了总距离$s$找到了一个超平面$H$，这个超平面到原点的距离为$r ge 1$，那么这头牛就达到了竞争比$s / r$。这是一个经典的结果，在$mathbb{R}^2$中，最优(确定性)竞争比是$9$。在$mathbb{R}^3$中，已知最优竞争比最多为$approx 13.811$。但在更高的维度，$d$与最优竞争比之间的渐近关系仍然是一个悬而未决的问题。Antoniadis等人给出的最佳上界和下界分别是$O(d^{3/2})$和$Omega(d)$，剩下的差距大致为$sqrt{d}$。在本文中，我们得到了$tilde{Omega}(d^{3/2})$的一个更强的下界。
{"title":"A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem","authors":"N. Bansal, John Kuszmaul, William Kuszmaul","doi":"10.48550/arXiv.2209.08427","DOIUrl":"https://doi.org/10.48550/arXiv.2209.08427","url":null,"abstract":"In the $d$-dimensional cow-path problem, a cow living in $mathbb{R}^d$ must locate a $(d - 1)$-dimensional hyperplane $H$ whose location is unknown. The only way that the cow can find $H$ is to roam $mathbb{R}^d$ until it intersects $mathcal{H}$. If the cow travels a total distance $s$ to locate a hyperplane $H$ whose distance from the origin was $r ge 1$, then the cow is said to achieve competitive ratio $s / r$. It is a classic result that, in $mathbb{R}^2$, the optimal (deterministic) competitive ratio is $9$. In $mathbb{R}^3$, the optimal competitive ratio is known to be at most $approx 13.811$. But in higher dimensions, the asymptotic relationship between $d$ and the optimal competitive ratio remains an open question. The best upper and lower bounds, due to Antoniadis et al., are $O(d^{3/2})$ and $Omega(d)$, leaving a gap of roughly $sqrt{d}$. In this note, we achieve a stronger lower bound of $tilde{Omega}(d^{3/2})$.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87141967","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}
Pub Date : 2022-08-18DOI: 10.48550/arXiv.2208.08864
A. Agrawal, H. Fernau, P. Kindermann, Kevin Mann, U. Souza
A graph $G$ is well-covered if every minimal vertex cover of $G$ is minimum, and a graph $G$ is well-dominated if every minimal dominating set of $G$ is minimum. Studies on well-covered graphs were initiated in [Plummer, JCT 1970], and well-dominated graphs were first introduced in [Finbow, Hartnell and Nowakow, AC 1988]. Well-dominated graphs are well-covered, and both classes have been widely studied in the literature. The recognition of well-covered graphs was proved coNP-complete by [Chv'atal and Slater, AODM 1993] and by [Sankaranarayana and Stewart, Networks 1992], but the complexity of recognizing well-dominated graphs has been left open since their introduction. We close this complexity gap by proving that recognizing well-dominated graphs is coNP-complete. This solves a well-known open question (c.f. [Levit and Tankus, DM 2017] and [G"{o}z"{u}pek, Hujdurovic and Milaniv{c}, DMTCS 2017]), which was first asked in [Caro, SebH{o} and Tarsi, JAlg 1996]. Surprisingly, our proof is quite simple, although it was a long-standing open problem. Finally, we show that recognizing well-totally-dominated graphs is coNP-complete, answering a question of [Bahadir, Ekim, and G"oz"upek, AMC 2021].
如果图$G$的每一个极小顶点覆盖都是最小的，则图$G$是良支配的，如果图$G$的每一个极小支配集都是最小的，则图$G$是良支配的。对完备覆盖图的研究始于[Plummer, JCT 1970]，完备支配图的研究始于[Finbow, Hartnell and Nowakow, AC 1988]。良好支配图被很好地覆盖，这两类都在文献中得到了广泛的研究。[Chv'atal and Slater, AODM 1993]和[Sankaranarayana and Stewart, Networks 1992]证明了对完全覆盖图的识别，但识别良好支配图的复杂性自引入以来一直是开放的。我们通过证明识别良好支配图是conp完全来缩小这种复杂性差距。这解决了一个众所周知的开放问题(c.f. [Levit and Tankus, DM 2017]和[G“{o}z”{u}pek, Hujdurovic and Milaniv{c}， DMTCS 2017])，该问题首次在[Caro, SebH{o} and Tarsi, JAlg 1996]中提出。令人惊讶的是，我们的证明非常简单，尽管这是一个长期存在的开放性问题。最后，我们证明了识别完全支配的图是conp完全的，回答了[Bahadir, Ekim, and G“oz”upek, AMC 2021]的问题。
{"title":"Recognizing well-dominated graphs is coNP-complete","authors":"A. Agrawal, H. Fernau, P. Kindermann, Kevin Mann, U. Souza","doi":"10.48550/arXiv.2208.08864","DOIUrl":"https://doi.org/10.48550/arXiv.2208.08864","url":null,"abstract":"A graph $G$ is well-covered if every minimal vertex cover of $G$ is minimum, and a graph $G$ is well-dominated if every minimal dominating set of $G$ is minimum. Studies on well-covered graphs were initiated in [Plummer, JCT 1970], and well-dominated graphs were first introduced in [Finbow, Hartnell and Nowakow, AC 1988]. Well-dominated graphs are well-covered, and both classes have been widely studied in the literature. The recognition of well-covered graphs was proved coNP-complete by [Chv'atal and Slater, AODM 1993] and by [Sankaranarayana and Stewart, Networks 1992], but the complexity of recognizing well-dominated graphs has been left open since their introduction. We close this complexity gap by proving that recognizing well-dominated graphs is coNP-complete. This solves a well-known open question (c.f. [Levit and Tankus, DM 2017] and [G\"{o}z\"{u}pek, Hujdurovic and Milaniv{c}, DMTCS 2017]), which was first asked in [Caro, SebH{o} and Tarsi, JAlg 1996]. Surprisingly, our proof is quite simple, although it was a long-standing open problem. Finally, we show that recognizing well-totally-dominated graphs is coNP-complete, answering a question of [Bahadir, Ekim, and G\"oz\"upek, AMC 2021].","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90617708","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}
Pub Date : 2022-08-17DOI: 10.48550/arXiv.2208.08522
Nidia Obscura Acosta, Alexandru I. Tomescu
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph $G$ has a unique Eulerian circuit can be done in polynomial time via the BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte, 1941-1951 (involving counting arborescences), or via a tailored characterization by Pevzner, 1989 (involving computing the intersection graph of simple cycles of $G$), both of which thus rely on overly complex notions for the simpler uniqueness problem. In this paper we give a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. This is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of $G$. As a by-product, we can also compute in linear-time all maximal $textit{safe}$ walks appearing in all Eulerian circuits, for which Nagarajan and Pop proposed in 2009 a polynomial-time algorithm based on Pevzner characterization.
有向图中的欧拉电路是图论中最基本的概念之一。检测图$G$是否具有唯一的欧拉电路可以通过de Bruijn, van Aardenne-Ehrenfest, Smith和Tutte(1941-1951)的BEST定理在多项式时间内完成(涉及计算树形)，或者通过Pevzner(1989)的定制表征(涉及计算$G$的简单循环的相交图)，两者都依赖于过于复杂的概念来解决更简单的唯一性问题。本文给出了具有唯一欧拉电路的有向图的一个新的线性时间可检性表征。这是基于一个简单的条件，即当两条边必须在所有欧拉电路中连续出现时，就底层无向图$G$的切割节点而言。作为副产品，我们还可以在线性时间内计算所有欧拉电路中出现的所有极大$textit{safe}$行走，为此Nagarajan和Pop在2009年提出了基于Pevzner表征的多项式时间算法。
{"title":"Simplicity in Eulerian Circuits: Uniqueness and Safety","authors":"Nidia Obscura Acosta, Alexandru I. Tomescu","doi":"10.48550/arXiv.2208.08522","DOIUrl":"https://doi.org/10.48550/arXiv.2208.08522","url":null,"abstract":"An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph $G$ has a unique Eulerian circuit can be done in polynomial time via the BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte, 1941-1951 (involving counting arborescences), or via a tailored characterization by Pevzner, 1989 (involving computing the intersection graph of simple cycles of $G$), both of which thus rely on overly complex notions for the simpler uniqueness problem. In this paper we give a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. This is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of $G$. As a by-product, we can also compute in linear-time all maximal $textit{safe}$ walks appearing in all Eulerian circuits, for which Nagarajan and Pop proposed in 2009 a polynomial-time algorithm based on Pevzner characterization.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75630682","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}
It's well known that every planar graph is $4$-colorable. A toroidal graph is a graph that can be embedded on a torus. It's proved that every toroidal graph is $7$-colorable. A proper coloring of a graph is called emph{odd} if every non-isolated vertex has at least one color that appears an odd number of times in its neighborhood. The smallest number of colors that admits an odd coloring of a graph $ G $ is denoted by $chi_{o}(G)$. In this paper, we prove that if $G$ is tortoidal, then $chi_{o}left({G}right)le9$; Note that $K_7$ is a toroidal graph, the upper bound is no less than $7$.
众所周知，每个平面图都是$4$ -可着色的。环面图是一种可以嵌入在环面上的图。证明了每个环面图都是$7$ -可着色的。如果每个非孤立顶点在其邻域中至少有一种颜色出现奇数次，则图的适当着色称为emph{奇数}。图中允许奇数颜色的最小颜色数$ G $用$chi_{o}(G)$表示。本文证明了如果$G$是龟形的，则$chi_{o}left({G}right)le9$;注意$K_7$是一个环面图，其上界不小于$7$。
{"title":"The odd chromatic number of a toroidal graph is at most 9","authors":"Fang Tian, Yuxue Yin","doi":"10.2139/ssrn.4162553","DOIUrl":"https://doi.org/10.2139/ssrn.4162553","url":null,"abstract":"It's well known that every planar graph is $4$-colorable. A toroidal graph is a graph that can be embedded on a torus. It's proved that every toroidal graph is $7$-colorable. A proper coloring of a graph is called emph{odd} if every non-isolated vertex has at least one color that appears an odd number of times in its neighborhood. The smallest number of colors that admits an odd coloring of a graph $ G $ is denoted by $chi_{o}(G)$. In this paper, we prove that if $G$ is tortoidal, then $chi_{o}left({G}right)le9$; Note that $K_7$ is a toroidal graph, the upper bound is no less than $7$.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79535200","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}
Pub Date : 2022-03-21DOI: 10.48550/arXiv.2203.11114
Remi Raman, S. ShahinJohnJ, R. Subashini, Subhasree Methirumangalath
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P ) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum number of exposed points. A point p is said to be exposed when p is not contained in any of the ranges inR. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.
{"title":"On the Parameterized Complexity of the Maximum Exposure Problem","authors":"Remi Raman, S. ShahinJohnJ, R. Subashini, Subhasree Methirumangalath","doi":"10.48550/arXiv.2203.11114","DOIUrl":"https://doi.org/10.48550/arXiv.2203.11114","url":null,"abstract":"We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P ) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum number of exposed points. A point p is said to be exposed when p is not contained in any of the ranges inR. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75073162","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}
The problem of enumerating all connected induced subgraphs of a given order $k$ from a given graph arises in many practical applications: bioinformatics, information retrieval, processor design,to name a few. The upper bound on the number of connected induced subgraphs of order $k$ is $ncdotfrac{(eDelta)^{k}}{(Delta-1)k}$, where $Delta$ is the maximum degree in the input graph $G$ and $n$ is the number of vertices in $G$. In this short communication, we first introduce a new neighborhood operator that is the key to design reverse search algorithms for enumerating all connected induced subgraphs of order $k$. Based on the proposed neighborhood operator, three algorithms with delay of $O(kcdot min{(n-k),kDelta}cdot(klog{Delta}+log{n}))$, $O(kcdot min{(n-k),kDelta}cdot n)$ and $O(k^2cdot min{(n-k),kDelta}cdot min{k,Delta})$ respectively are proposed. The first two algorithms require exponential space to improve upon the current best delay bound $O(k^2Delta)$cite{4} for this problem in the case $k>frac{nlog{Delta}-log{n}-Delta+sqrt{nlog{n}log{Delta}}}{log{Delta}}$ and $k>frac{n^2}{n+Delta}$ respectively.
{"title":"Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality","authors":"Shanshan Wang, Chenglong Xiao, E. Casseau","doi":"10.2139/ssrn.4150167","DOIUrl":"https://doi.org/10.2139/ssrn.4150167","url":null,"abstract":"The problem of enumerating all connected induced subgraphs of a given order $k$ from a given graph arises in many practical applications: bioinformatics, information retrieval, processor design,to name a few. The upper bound on the number of connected induced subgraphs of order $k$ is $ncdotfrac{(eDelta)^{k}}{(Delta-1)k}$, where $Delta$ is the maximum degree in the input graph $G$ and $n$ is the number of vertices in $G$. In this short communication, we first introduce a new neighborhood operator that is the key to design reverse search algorithms for enumerating all connected induced subgraphs of order $k$. Based on the proposed neighborhood operator, three algorithms with delay of $O(kcdot min{(n-k),kDelta}cdot(klog{Delta}+log{n}))$, $O(kcdot min{(n-k),kDelta}cdot n)$ and $O(k^2cdot min{(n-k),kDelta}cdot min{k,Delta})$ respectively are proposed. The first two algorithms require exponential space to improve upon the current best delay bound $O(k^2Delta)$cite{4} for this problem in the case $k>frac{nlog{Delta}-log{n}-Delta+sqrt{nlog{n}log{Delta}}}{log{Delta}}$ and $k>frac{n^2}{n+Delta}$ respectively.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89440375","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}
In this work, we study the socially fair $k$-median/$k$-means problem. We are given a set of points $P$ in a metric space $mathcal{X}$ with a distance function $d(.,.)$. There are $ell$ groups: $P_1,dotsc,P_{ell} subseteq P$. We are also given a set $F$ of feasible centers in $mathcal{X}$. The goal in the socially fair $k$-median problem is to find a set $C subseteq F$ of $k$ centers that minimizes the maximum average cost over all the groups. That is, find $C$ that minimizes the objective function $Phi(C,P) equiv max_{j} Big{ sum_{x in P_j} d(C,x)/|P_j| Big}$, where $d(C,x)$ is the distance of $x$ to the closest center in $C$. The socially fair $k$-means problem is defined similarly by using squared distances, i.e., $d^{2}(.,.)$ instead of $d(.,.)$. The current best approximation guarantee for both the problems is $Oleft( frac{log ell}{log log ell} right)$ due to Makarychev and Vakilian [COLT 2021]. In this work, we study the fixed parameter tractability of the problems with respect to parameter $k$. We design $(3+varepsilon)$ and $(9 + varepsilon)$ approximation algorithms for the socially fair $k$-median and $k$-means problems, respectively, in FPT (fixed parameter tractable) time $f(k,varepsilon) cdot n^{O(1)}$, where $f(k,varepsilon) = (k/varepsilon)^{{O}(k)}$ and $n = |P cup F|$. Furthermore, we show that if Gap-ETH holds, then better approximation guarantees are not possible in FPT time.
{"title":"Tight FPT Approximation for Socially Fair Clustering","authors":"Dishant Goyal, Ragesh Jaiswal","doi":"10.2139/ssrn.4226483","DOIUrl":"https://doi.org/10.2139/ssrn.4226483","url":null,"abstract":"In this work, we study the socially fair $k$-median/$k$-means problem. We are given a set of points $P$ in a metric space $mathcal{X}$ with a distance function $d(.,.)$. There are $ell$ groups: $P_1,dotsc,P_{ell} subseteq P$. We are also given a set $F$ of feasible centers in $mathcal{X}$. The goal in the socially fair $k$-median problem is to find a set $C subseteq F$ of $k$ centers that minimizes the maximum average cost over all the groups. That is, find $C$ that minimizes the objective function $Phi(C,P) equiv max_{j} Big{ sum_{x in P_j} d(C,x)/|P_j| Big}$, where $d(C,x)$ is the distance of $x$ to the closest center in $C$. The socially fair $k$-means problem is defined similarly by using squared distances, i.e., $d^{2}(.,.)$ instead of $d(.,.)$. The current best approximation guarantee for both the problems is $Oleft( frac{log ell}{log log ell} right)$ due to Makarychev and Vakilian [COLT 2021]. In this work, we study the fixed parameter tractability of the problems with respect to parameter $k$. We design $(3+varepsilon)$ and $(9 + varepsilon)$ approximation algorithms for the socially fair $k$-median and $k$-means problems, respectively, in FPT (fixed parameter tractable) time $f(k,varepsilon) cdot n^{O(1)}$, where $f(k,varepsilon) = (k/varepsilon)^{{O}(k)}$ and $n = |P cup F|$. Furthermore, we show that if Gap-ETH holds, then better approximation guarantees are not possible in FPT time.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75138993","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}
Pub Date : 2021-04-01DOI: 10.1016/j.ipl.2020.106065
Divesh Aggarwal, E. Chung
{"title":"A note on the concrete hardness of the shortest independent vector in lattices","authors":"Divesh Aggarwal, E. Chung","doi":"10.1016/j.ipl.2020.106065","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106065","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81460169","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}
Pub Date : 2021-04-01DOI: 10.1016/j.ipl.2020.106079
Matthias Englert, Piotr Hofman, S. Lasota, R. Lazic, Jérôme Leroux, Juliusz Straszynski
{"title":"A lower bound for the coverability problem in acyclic pushdown VAS","authors":"Matthias Englert, Piotr Hofman, S. Lasota, R. Lazic, Jérôme Leroux, Juliusz Straszynski","doi":"10.1016/j.ipl.2020.106079","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106079","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84810556","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：