scientific article; zbMATH DE number 4002078
From MaRDI portal
Publication:3754606
zbMATH Open0618.03017MaRDI QIDQ3754606FDOQ3754606
Authors: Michael Sipser 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3938569
- The complexity of some topological inference problems
- scientific article; zbMATH DE number 5263151
- scientific article; zbMATH DE number 4012593
- A topological approach to non-uniform complexity
- scientific article; zbMATH DE number 16121
- Complexity of some geometric and topological problems
- The computability problem in algebraic topology
- On higher analogs of topological complexity
- Computational complexity of topological invariants
Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (21)
- Title not available (Why is that?)
- Local rainbow colorings for various graphs
- Complexity classes as mathematical axioms
- RECYCLING RANDOM BITS IN PARALLEL
- Borel separability of the coanalytic Ramsey sets
- Algorithmic complexity of recursive and inductive algorithms
- Title not available (Why is that?)
- The expressive power of analog recurrent neural networks on infinite input streams
- Title not available (Why is that?)
- On locally rainbow colourings
- Topology of cycles in pseudolinear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving properties of interactive proofs by a generalized counting technique
- A topological approach to Yablo's paradox
- Formal aspects of topological complexity
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- Some complexity results in topology and analysis
- If not empty, NP-P is topologically large
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754606)
