On the Complexity of Intersection Non-Emptiness Problems

vii

[1]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[2]  Ryan Williams,et al.  Finding orthogonal vectors in discrete structures , 2014, SODA.

[3]  Harry B. Hunt,et al.  On the time and tape complexity of languages I , 1973, STOC.

[4]  P. Madhusudan.  The Tree Width of Automata with Auxiliary Storage , 2010 .

[5]  Ge Xia,et al.  Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..

[6]  Peter Rossmanith,et al.  The Emptiness Problem for Intersections of Regular Languages , 1992, MFCS.

[7]  Pierre McKenzie,et al.  The complexity of intersecting finite automata having few final states , 2012, computational complexity.

[8]  Eitan M. Gurari,et al.  The Complexity of Decision Problems for Finite-Turn Multicounter Machines , 1981, J. Comput. Syst. Sci..

[9]  Richard J. Lipton,et al.  On The Intersection of Finite Automata , 2010 .

[10]  Jeffrey Shallit,et al.  Detecting patterns in finite regular and context-free languages , 2009, Inf. Process. Lett..

[11]  Henning Fernau,et al.  Problems on Finite Automata and the Exponential Time Hypothesis , 2016, CIAA.

[12]  Michael Wehar,et al.  Hardness Results for Intersection Non-Emptiness , 2014, ICALP.

[13]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[14]  Zvi Galil,et al.  Hierarchies of complete problems , 1976, Acta Informatica.

[15]  M. Veanes.  On Computational Complexity of Basic Decision Problems of Finite Tree Automata , 1997 .

[16]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[17]  Richard J. Lipton,et al.  On the complexity of intersecting finite state automata , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[18]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[19]  Benedikt Bollig,et al.  Emptiness of Multi-pushdown Automata Is 2ETIME-Complete , 2008, Developments in Language Theory.

[20]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

[21]  Jacques Chabin,et al.  Visibly Pushdown Languages and Term Rewriting , 2007, FroCoS.

[22]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[23]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[24]  Pierre McKenzie,et al.  Alternating and empty alternating auxiliary stack automata , 2003, Theor. Comput. Sci..

[25]  Andrew Drucker.  New Limits to Classical and Quantum Instance Compression , 2015, SIAM J. Comput..

[26]  Michael Elberfeld,et al.  On the Space Complexity of Parameterized Problems , 2012, IPEC.

[27]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[28]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[29]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[30]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[31]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[33]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[34]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..

[35]  Leslie G. Valiant,et al.  Decision procedures for families of deterministic pushdown automata , 1973 .

[36]  Michal Pilipczuk,et al.  Shortest paths in one-counter systems , 2019, Log. Methods Comput. Sci..

[37]  Ge Xia,et al.  Linear FPT reductions and computational lower bounds , 2004, STOC '04.

[38]  Ron Kohavi,et al.  Bottom-Up Induction of Oblivious Read-Once Decision Graphs: Strengths and Limitations , 1994, AAAI.

[39]  Marco Cesati,et al.  The Turing way to parameterized complexity , 2003, J. Comput. Syst. Sci..

[41]  Saket Saurabh,et al.  Lower bounds on kernelization , 2011, Discret. Optim..

[42]  Shinichi Tanaka,et al.  The emptiness problem for indexed language is exponential-time complete , 1986, Systems and Computers in Japan.

[43]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[44]  Bernard M. E. Moret,et al.  Decision Trees and Diagrams , 1982, CSUR.

[45]  Virginia Vassilevska.  Efficient algorithms for clique problems , 2009 .

[46]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[47]  Richard J. Lipton,et al.  Alternating Pushdown and Stack Automata , 1984, SIAM J. Comput..

[48]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[49]  Salvatore La Torre,et al.  A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[50]  Michel Blondin.  Complexité du problème d ’ intersection d ’ automates , 2009 .

[51]  Todd Wareham,et al.  The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata , 2000, CIAA.

[52]  Salvatore La Torre,et al.  An Infinite Automaton Characterization of Double Exponential Time , 2008, CSL.

[53]  Ge Xia,et al.  W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications , 2005, COCOON.

[54]  Richard J. Lipton,et al.  Alternation Bounded Auxiliary Pushdown Automata , 1984, Inf. Control..

[55]  Shigeki Iwata,et al.  Gradually intractable problems and nondeterministic log-space lower bounds , 2005, Mathematical systems theory.

[56]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[57]  Igor Walukiewicz,et al.  Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..

[58]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[59]  Swarat Chaudhuri,et al.  Branching Pushdown Tree Automata , 2006, FSTTCS.

[60]  Noga Alon,et al.  Meanders, Ramsey theory and lower bounds for branching programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[61]  Henning Fernau,et al.  A multi-parameter analysis of hard problems on deterministic finite automata , 2015, J. Comput. Syst. Sci..

[62]  Michael Wehar,et al.  On the Complexity of Intersecting Regular, Context-Free, and Tree Languages , 2015, ICALP.

[63]  Michael Blondin.  Complexité raffinée du problème d'intersection d'automates , 2012 .

[64]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[65]  Johannes Osterholzer.  Complexity of Uniform Membership of Context-Free Tree Grammars , 2015, CAI.