Book contents
- Frontmatter
- Contents
- List of Figures
- List of Tables
- Preface
- Part I Introduction
- Part II Concepts and Techniques
- Part III Reflections and Elaborations
- 8 Dealing with Intractability
- 9 Replies to Common Objections
- Part IV Applications
- Appendix A Mathematical Background
- Appendix B List of Computational Problems
- Appendix C Compendium of Complexity Results
- References
- Index
9 - Replies to Common Objections
from Part III - Reflections and Elaborations
Published online by Cambridge University Press: 18 April 2019
Book contents
- Frontmatter
- Contents
- List of Figures
- List of Tables
- Preface
- Part I Introduction
- Part II Concepts and Techniques
- Part III Reflections and Elaborations
- 8 Dealing with Intractability
- 9 Replies to Common Objections
- Part IV Applications
- Appendix A Mathematical Background
- Appendix B List of Computational Problems
- Appendix C Compendium of Complexity Results
- References
- Index
Summary
This chapter discusses a set of possible objections to the tractability constraint on computational-level theories. Any of these objections may naturally arise when reading Chapter 1. It is an option to read this chapter directly after Chapter 1. However we believe that the responses to the listed objections can be best appreciated after having mastered the formal concepts and techniques in Chapters 2–7 and familiarized oneself with the conceptual arguments in Chapter 8.
Information
- Type
- Chapter
- Information
- Cognition and IntractabilityA Guide to Classical and Parameterized Complexity Analysis, pp. 188 - 214Publisher: Cambridge University PressPrint publication year: 2019
Accessibility standard: Unknown
Accessibility compliance for the PDF of this book is currently unknown
and may be updated in the future.