scientific article; zbMATH DE number 5595162
From MaRDI portal
Publication:3392275
Cited in
(only showing first 100 items - show all)- Primitivity of finitely presented monomial algebras.
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- An automaton-theoretic approach to the representation theory of quantum algebras
- A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence
- Existence of solutions of integral equations with asymptotic conditions
- Interleaving isotactics -- an equivalence notion on behaviour abstractions
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
- ``Viral Turing machines, computation from noise and combinatorial hierarchies
- Separability by piecewise testable languages is \textsc{PTime}-complete
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories
- Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources
- Polynomial expressions for non-binomial structures
- Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces
- Pregroup grammars with letter promotions: complexity and context-freeness
- Achievable complexity-performance tradeoffs in lossy compression
- Intricacies of quantum computational paths
- Computing with SN P systems with I/O mode
- Solving a PSPACE-complete problem with cP systems
- A return to stochasticity and probability in spiking neural P systems
- A linear time algorithm for embedding hypercube into cylinder and torus
- The compound interest in relaxing punctuality
- The origins of the halting problem
- What's decidable about weighted automata?
- Varieties
- Generalized fuzzy automata with semantic computing
- Formalization of the computational theory of a Turing complete functional language model
- Closure properties of subregular languages under operations
- On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
- What is the natural abstraction level of an algorithm?
- The delay and window size problems in rule-based stream reasoning
- Confluent complement: an algorithm for the intersection of face ideals
- Parametric Church's thesis: synthetic computability without choice
- Enumerating solutions to grid-based puzzles with a fixed number of rows
- The cut operation in subclasses of convex languages (extended abstract)
- Polynomial fill-in puzzles or how to make sense of the cook-Levin theorem
- Fibonacci numbers, consecutive patterns, and inverse peaks
- Operational complexity and pumping lemmas
- On the complexity of the cogrowth sequence
- Geometry of translations on a Boolean cube
- On the complexity of detecting convexity over a box
- The complexities of nonperturbative computations
- Enhancement of automata with jumping modes
- Theory versus practice in annealing-based quantum computing
- Difference hierarchies and duality with an application to formal languages
- Membrane automata for modeling biomolecular processes
- A game-semantic model of computation
- Universal map for cellular automata
- Model checking and synthesis for branching multi-weighted logics
- Space complexity equivalence of P systems with active membranes and Turing machines
- Graph ambiguity
- Theory of computation.
- Embedding ordered sets into distributive lattices
- Computation with multiple CTCs of fixed length and width
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Modeling RNA:DNA hybrids with formal grammars
- Two-way deterministic automata with jumping mode
- Integer multiplication in time \(O(n\log n)\)
- On the hardnesses of several quantum decoding problems
- Deciding confluence for a simple class of relational transducer networks
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Polynomial recognition of cluster algebras of finite type
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Approximately counting locally-optimal structures
- Solution to motif finding problem in membranes
- On the iterative convergence of harmony search algorithm and a proposed modification
- The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
- A note on accelerated Turing machines
- Computing Stable Outcomes in Hedonic Games
- The road to quantum computational supremacy
- Evaluating the Impact of Information Distortion on Normalized Compression Distance
- GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- Least upper bounds on the size of Church-Rosser diagrams in term rewriting and -calculus
- Hyper-Minimization in O(n 2)
- REMARKS ON TWO NONSTANDARD VERSIONS OF PERIODICITY IN WORDS
- Unique Normalization for Shallow TRS
- The \Pi^0_2 -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
- Retracted: Universal computation is `almost surely' chaotic
- scientific article; zbMATH DE number 702378 (Why is no real title available?)
- Scheduling in a dynamic heterogeneous distributed system using estimation error
- An alternating hierarchy for finite automata
- Information-theoretical complexity for the hydrogenic identity \(S_N2\) exchange reaction
- If the current clique algorithms are optimal, so is Valiant's parser
- About the domino problem for subshifts on groups
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- The monoids of the patience sorting algorithm
- Computational models for networks of tiny artifacts: a survey
- The complexity of debate checking
- scientific article; zbMATH DE number 1453451 (Why is no real title available?)
- Deciding the confusability of words under tandem repeats in linear time
- A survey of graph burning
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
- Attention is Turing-complete
- scientific article; zbMATH DE number 7471686 (Why is no real title available?)
- Operations on Permutation Automata
- Refining complexity analyses in planning by exploiting the exponential time hypothesis
- Computational Hardness of Multidimensional Subtraction Games
- On the Generalized Membership Problem in Relatively Hyperbolic Groups
- The stochastic thermodynamics of computation
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 Q3392275)
