An overview of computational complexity
From MaRDI portal
Cited in
(43)- A parallel algorithm for the monadic unification problem
- Constructing a perfect matching is in random NC
- Tradeoffs for language recognition on alternating machines
- Some estimated likelihoods for computational complexity
- Computing in combinatorial optimization
- Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP
- Basic complexity
- Complexity theory basics: NP and NL
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- On the impact of Turing machines
- P, NP, and NP-completeness. The basics of computational complexity.
- A Short Introduction to Implicit Computational Complexity
- Squeezing Feasibility
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- Algorithmics -- is there hope for a unified theory? (Invited talk)
- scientific article; zbMATH DE number 3974291 (Why is no real title available?)
- scientific article; zbMATH DE number 4011937 (Why is no real title available?)
- scientific article; zbMATH DE number 4022600 (Why is no real title available?)
- Classifying the computational complexity of problems
- scientific article; zbMATH DE number 4098721 (Why is no real title available?)
- scientific article; zbMATH DE number 4106275 (Why is no real title available?)
- Parallel computation of manipulator inverse dynamics
- Physical portrayal of computational complexity
- Towards NP-P via proof complexity and search
- Limit, logic, and computation
- NP-completeness: a retrospective
- Book review of: Oded Goldreich, Computational complexity: a conceptual perspective
- scientific article; zbMATH DE number 218387 (Why is no real title available?)
- scientific article; zbMATH DE number 3999295 (Why is no real title available?)
- scientific article; zbMATH DE number 2096708 (Why is no real title available?)
- COMPLEXITY AS A MEASURE OF THE DIFFICULTY OF SYSTEM DIAGNOSIS
- scientific article; zbMATH DE number 1453451 (Why is no real title available?)
- Complexity of computer computations. Proceedings of a symposium on the complexity of computer computations, held March 20--22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, mathematics program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department
- Computational complexity
- \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Computational Complexity
- Distributed Self-Stabilizing MIS with Few States and Weak Communication
- Theoretical computer science: computational complexity
- Logic, automata, and computational complexity. The works of Stephen A. Cook
- Technique for transforming discrete optimization problems into QUBO form
- Statistical phase-space complexity of continuous-variable quantum channels
- Polynomial time computations in models of ET
This page was built for publication: An overview of computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759938)
