Computability and complexity theory.
DOI10.1007/978-1-4614-0682-2zbMATH Open1248.68192OpenAlexW4298156820MaRDI QIDQ640476FDOQ640476
Authors: S. Homer, Alan L. Selman 
Publication date: 18 October 2011
Published in: Texts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0682-2
Recommendations
- Computability and complexity theory
- scientific article; zbMATH DE number 3909745
- Elements of computation theory
- Basic course theoretical computer science with exercises and test questions.
- scientific article; zbMATH DE number 3965406
- scientific article; zbMATH DE number 738396
- scientific article; zbMATH DE number 578252
- scientific article; zbMATH DE number 225477
- scientific article; zbMATH DE number 1033441
- Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography.
computational complexitydecidabilitycounting complexityTuring machinerandomnesscomputabilityinteractive proof
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)
Cited In (28)
- Splitting NP-complete sets infinitely
- Computational Complexity
- The complexity of the \(K\)th largest subset problem and related problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Complexity
- Further results on an abstract model for branching and its application to mixed integer programming
- Computer science. The hardware, software and heart of it
- \textsc{Hanano} puzzle is \textsf{NP}-hard
- Effective guessing has unlikely consequences
- Title not available (Why is that?)
- Schema mapping coverage
- Theory of computation.
- Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets
- Theory of semi-feasible algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Machines that perform measurements
- The nature of computation
- On the termination and structural termination problems for counter machines with incrementing errors
- Computability and complexity theory
- A note on the complexity of S4.2
- Assortment optimization: a systematic literature review
- Title not available (Why is that?)
- Analyzing fractional Horn constraint systems
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
This page was built for publication: Computability and complexity theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640476)
