Deciding consistency of systems of exponential-polynomial inequalities in subexponential time

1992 ◽  
Vol 59 (3) ◽  
pp. 789-814
Author(s):  
N. N. Vorob'ev
Keyword(s):  
Exponential Polynomial ◽  
Subexponential Time ◽  
Polynomial Inequalities

scholarly journals Exponential polynomial inequalities and monomial sum inequalities in p-Newton sequences

2016 ◽  
Vol 66 (3) ◽  
pp. 793-819
Author(s):  
Charles R. Johnson ◽  
Carlos Marijuán ◽  
Miriam Pisonero ◽  
Michael Yeh
Keyword(s):  
Exponential Polynomial ◽  
Polynomial Inequalities

scholarly journals Polynomial inequalities on the Hamming cube

2020 ◽  
Vol 178 (1-2) ◽  
pp. 235-287
Author(s):  
Alexandros Eskenazis ◽  
Paata Ivanisvili
Keyword(s):  
Polynomial Inequalities

scholarly journals On the induced matching problem in hamiltonian bipartite graphs

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Yinglei Song
Keyword(s):  
Bipartite Graph ◽  
Parameterized Complexity ◽  
Bipartite Graphs ◽  
Matching Problem ◽  
Induced Matching ◽  
Subexponential Time ◽  
Maximum Induced Matching

Abstract In this paper, we study the parameterized complexity of the induced matching problem in hamiltonian bipartite graphs and the inapproximability of the maximum induced matching problem in hamiltonian bipartite graphs. We show that, given a hamiltonian bipartite graph, the induced matching problem is W[1]-hard and cannot be solved in time n o ⁢ ( k ) {n^{o(\sqrt{k})}} , where n is the number of vertices in the graph, unless the 3SAT problem can be solved in subexponential time. In addition, we show that unless NP = P {\operatorname{NP}=\operatorname{P}} , a maximum induced matching in a hamiltonian bipartite graph cannot be approximated within a ratio of n 1 / 4 - ϵ {n^{1/4-\epsilon}} , where n is the number of vertices in the graph.

Sign in / Sign up

Export Citation Format

Share Document