Cited in
(42)- Tradeoffs for language recognition on alternating machines
- Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP
- scientific article; zbMATH DE number 3974291 (Why is no real title available?)
- scientific article; zbMATH DE number 4011937 (Why is no real title available?)
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- Parallel computation of manipulator inverse dynamics
- Physical portrayal of computational complexity
- Towards NP-P via proof complexity and search
- scientific article; zbMATH DE number 1453451 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 2096708 (Why is no real title available?)
- Computational Complexity
- \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
- scientific article; zbMATH DE number 4106275 (Why is no real title available?)
- Basic complexity
- Algorithmics -- is there hope for a unified theory? (Invited talk)
- Complexity theory basics: NP and NL
- Theoretical computer science: computational complexity
- Constructing a perfect matching is in random NC
- Book review of: Oded Goldreich, Computational complexity: a conceptual perspective
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 4098721 (Why is no real title available?)
- scientific article; zbMATH DE number 218387 (Why is no real title available?)
- Squeezing Feasibility
- A Short Introduction to Implicit Computational Complexity
- Logic, automata, and computational complexity. The works of Stephen A. Cook
- Statistical phase-space complexity of continuous-variable quantum channels
- COMPLEXITY AS A MEASURE OF THE DIFFICULTY OF SYSTEM DIAGNOSIS
- P, NP, and NP-completeness. The basics of computational complexity.
- Distributed Self-Stabilizing MIS with Few States and Weak Communication
- NP-completeness: a retrospective
- Classifying the computational complexity of problems
- Computing in combinatorial optimization
- Some estimated likelihoods for computational complexity
- Polynomial time computations in models of ET
- scientific article; zbMATH DE number 3999295 (Why is no real title available?)
- Technique for transforming discrete optimization problems into QUBO form
- On the impact of Turing machines
- scientific article; zbMATH DE number 4022600 (Why is no real title available?)
- Computational complexity
- 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
- A parallel algorithm for the monadic unification problem
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)
