Bell, Paul C.; Hirvensalo, Mika; Potapov, Igor The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is NP-complete. (English) Zbl 07790926 Inf. Comput. 296, Article ID 105132, 27 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. C. Bell} et al., Inf. Comput. 296, Article ID 105132, 27 p. (2024; Zbl 07790926) Full Text: DOI
Fenner, Stephen; Padé, Daniel; Thierauf, Thomas The complexity of regex crosswords. (English) Zbl 1487.68126 Inf. Comput. 286, Article ID 104777, 18 p. (2022). MSC: 68Q25 68Q17 68Q45 PDFBibTeX XMLCite \textit{S. Fenner} et al., Inf. Comput. 286, Article ID 104777, 18 p. (2022; Zbl 1487.68126) Full Text: DOI
Goles, Eric; Montealegre, Pedro The complexity of the asynchronous prediction of the majority automata. (English) Zbl 1460.68068 Inf. Comput. 274, Article ID 104537, 15 p. (2020). MSC: 68Q80 68Q25 PDFBibTeX XMLCite \textit{E. Goles} and \textit{P. Montealegre}, Inf. Comput. 274, Article ID 104537, 15 p. (2020; Zbl 1460.68068) Full Text: DOI
Díaz, Josep; Mertzios, George B. Minimum bisection is NP-hard on unit disk graphs. (English) Zbl 1376.68053 Inf. Comput. 256, 83-92 (2017). MSC: 68Q17 05C10 05C62 PDFBibTeX XMLCite \textit{J. Díaz} and \textit{G. B. Mertzios}, Inf. Comput. 256, 83--92 (2017; Zbl 1376.68053) Full Text: DOI Link
Fernau, Henning; Schmid, Markus L. Pattern matching with variables: a multivariate complexity analysis. (English) Zbl 1370.68124 Inf. Comput. 242, 287-305 (2015). MSC: 68Q25 68Q17 68Q45 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{M. L. Schmid}, Inf. Comput. 242, 287--305 (2015; Zbl 1370.68124) Full Text: DOI
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France Mod/Resc parsimony inference: theory and application. (English) Zbl 1237.92041 Inf. Comput. 213, 23-32 (2012). MSC: 92C60 05C90 65Y20 PDFBibTeX XMLCite \textit{I. Nor} et al., Inf. Comput. 213, 23--32 (2012; Zbl 1237.92041) Full Text: DOI
Pribavkina, Elena V.; Rodaro, Emanuele Synchronizing automata with finitely many minimal synchronizing words. (English) Zbl 1221.68141 Inf. Comput. 209, No. 3, 568-579 (2011). MSC: 68Q45 68Q17 PDFBibTeX XMLCite \textit{E. V. Pribavkina} and \textit{E. Rodaro}, Inf. Comput. 209, No. 3, 568--579 (2011; Zbl 1221.68141) Full Text: DOI
Glaßer, Christian; Pavan, A.; Travers, Stephen The fault tolerance of NP-hard problems. (English) Zbl 1234.68136 Inf. Comput. 209, No. 3, 443-455 (2011). MSC: 68Q17 PDFBibTeX XMLCite \textit{C. Glaßer} et al., Inf. Comput. 209, No. 3, 443--455 (2011; Zbl 1234.68136) Full Text: DOI
Ailon, Nir; Alon, Noga Hardness of fully dense problems. (English) Zbl 1121.68054 Inf. Comput. 205, No. 8, 1117-1129 (2007). MSC: 68Q17 68W25 68R10 PDFBibTeX XMLCite \textit{N. Ailon} and \textit{N. Alon}, Inf. Comput. 205, No. 8, 1117--1129 (2007; Zbl 1121.68054) Full Text: DOI
Steffen, Peter; Giegerich, Robert Table design in dynamic programming. (English) Zbl 1098.90081 Inf. Comput. 204, No. 9, 1325-1345 (2006). MSC: 90C39 90C60 PDFBibTeX XMLCite \textit{P. Steffen} and \textit{R. Giegerich}, Inf. Comput. 204, No. 9, 1325--1345 (2006; Zbl 1098.90081) Full Text: DOI
Arkin, Esther M.; Bender, Michael A.; Mitchell, Joseph S. B.; Skiena, Steven S. The lazy bureaucrat scheduling problem. (English) Zbl 1026.90037 Inf. Comput. 184, No. 1, 129-146 (2003). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{E. M. Arkin} et al., Inf. Comput. 184, No. 1, 129--146 (2003; Zbl 1026.90037) Full Text: DOI