Theoretical computer science: computational complexity
From MaRDI portal
Publication:6602263
Recommendations
Cites work
- scientific article; zbMATH DE number 3646282 (Why is no real title available?)
- scientific article; zbMATH DE number 445159 (Why is no real title available?)
- scientific article; zbMATH DE number 6019540 (Why is no real title available?)
- scientific article; zbMATH DE number 3123490 (Why is no real title available?)
- scientific article; zbMATH DE number 5667324 (Why is no real title available?)
- scientific article; zbMATH DE number 3658049 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 46423 (Why is no real title available?)
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3523154 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 1142310 (Why is no real title available?)
- scientific article; zbMATH DE number 2013798 (Why is no real title available?)
- scientific article; zbMATH DE number 2155184 (Why is no real title available?)
- scientific article; zbMATH DE number 1848310 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3320380 (Why is no real title available?)
- scientific article; zbMATH DE number 3090508 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A Mathematical Theory of Communication
- A new recursion-theoretic characterization of the polytime functions
- A note on two problems in connexion with graphs
- Adding nesting structure to words
- Algorithms for determining relative star height and star height
- Alternation
- An introduction to Kolmogorov complexity and its applications
- An overview of computational complexity
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Average Case Complete Problems
- Classically controlled quantum computation
- Clustering by Compression
- Complexity measures for regular expressions
- Complexity of computations
- Computability and randomness
- Computational Depth Complexity of Measurement-Based Quantum Computation
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Fast Multiple-Precision Evaluation of Elementary Functions
- Fast Pattern Matching in Strings
- Fast multiplication of large numbers
- Faster integer multiplication
- From regular expressions to deterministic automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Grammatical inference. Learning automata and grammars.
- Handbook of knowledge representation.
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Light linear logic
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- On n-quantifier induction
- On a question of Eggan
- On equations for regular languages, finite automata, and sequential networks
- On finite monoids having only trivial subgroups
- One-unambiguous regular languages
- PAC learning under helpful distributions
- Parity, circuits, and the polynomial-time hierarchy
- Quantum Query Complexity of Some Graph Problems
- Quantum Walk Algorithm for Element Distinctness
- Quantum algorithms for the triangle problem
- Quantum complexity theory
- Quantum computation by measurement and quantum memory
- Quantum computational networks
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum verification of matrix products
- Rapid solution of problems by quantum computation
- Recognizable formal power series on trees
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Regular expressions into finite automata
- Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
- Relational queries computable in polynomial time
- THE ABSTRACT THEORY OF AUTOMATA
- Testing and generating infinite sequences by a finite automaton
- The HOM problem is EXPTIME-complete
- The Similarity Metric
- The complexity of analog computation
- The complexity of theorem-proving procedures
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- The importance of the P versus NP question
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Time bounded random access machines
- Transition graphs and the star-height of regular events
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Tree-walking automata cannot be determinized
- Visibly pushdown languages
- Weak Second‐Order Arithmetic and Finite Automata
- \(L(A)=L(B)\)? A simplified decidability proof.
- `Ideal learning' of natural language: positive results about learning from positive evidence
This page was built for publication: Theoretical computer science: computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602263)
