Cover Image
Read Now

1
Published 2020
Springer International Publishing
Table of Contents: “... Complexity of the Expected Coverage Problem -- Computational Hardness of Multidimensional Subtraction Games...”
Cover Image
Read Now

2
Published 2002
Springer Berlin Heidelberg
Table of Contents: “... Strings Is NP-hard -- Some Classes of Regular Languages Identifiable in the Limit from Positive Data...”
Cover Image
Read Now

3
Published 2024
Springer Nature Switzerland
Table of Contents: “... Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode -- Local Certification of Majority...”
Cover Image
Read Now

4
Published 2008
Springer Berlin Heidelberg
Table of Contents: “...-Automata -- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard...”
Cover Image
Read Now

5
Published 2010
Springer Berlin Heidelberg
Table of Contents: “... Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness -- Hard Counting Problems...”