scientific article; zbMATH DE number 5595162

zbMATH Open1191.68311MaRDI QIDQ3392275FDOQ3392275

Publication date: 13 August 2009

Title of this publication is not available (Why is that?)

Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (only showing first 100 items - show all)

A return to stochasticity and probability in spiking neural P systems
Computing with SN P systems with I/O mode
Generalized fuzzy automata with semantic computing
Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources
On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
Theory versus practice in annealing-based quantum computing
Polynomial expressions for non-binomial structures
Encodings of Turing machines in linear logic
Deciding the confusability of words under tandem repeats in linear time
Fibonacci numbers, consecutive patterns, and inverse peaks
Graph ambiguity
What is the natural abstraction level of an algorithm?
On computational complexity of Cremer Julia sets
A survey of graph burning
A game-semantic model of computation
The monoids of the patience sorting algorithm
The delay and window size problems in rule-based stream reasoning
Difference hierarchies and duality with an application to formal languages
About the domino problem for subshifts on groups
A linear time algorithm for embedding hypercube into cylinder and torus
Enumerating solutions to grid-based puzzles with a fixed number of rows
Confluent complement: an algorithm for the intersection of face ideals
Pregroup grammars with letter promotions: complexity and context-freeness
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS
On the hardnesses of several quantum decoding problems
On functions computed on trees
Computing the exact number of periodic orbits for planar flows
Parametric Church's thesis: synthetic computability without choice
Finite automata capturing winning sequences for all possible variants of the $PQ$ penny flip game
The origins of the halting problem
Verification-Led Smart Contracts
On the Generalized Membership Problem in Relatively Hyperbolic Groups
The cut operation in subclasses of convex languages (extended abstract)
Polynomial fill-in puzzles or how to make sense of the cook-Levin theorem
Operational complexity and pumping lemmas
Enhancement of automata with jumping modes
Complement for two-way alternating automata
Positive neural networks in discrete time implement monotone-regular behaviors
Two-way deterministic automata with jumping mode
On the complexity of the cogrowth sequence
Achievable complexity-performance tradeoffs in lossy compression
Consistently-detecting monitors
What's decidable about weighted automata?
Title not available (Why is that?)
Intricacies of quantum computational paths
``Viral Turing machines, computation from noise and combinatorial hierarchies
The computational complexity of classical knot recognition
Separability by piecewise testable languages is \textsc{PTime}-complete
Geometry of translations on a Boolean cube
From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories
Using low-density parity-check codes to improve the McEliece cryptosystem
Hyper-Minimization in O(n 2)
Model checking and synthesis for branching multi-weighted logics
An exponential separation between randomized and deterministic complexity in the LOCAL model
On the complexity of detecting convexity over a box
A PSPACE-complete first-order fragment of computability logic
Computation with multiple CTCs of fixed length and width
Computational models for networks of tiny artifacts: a survey
Retracted: Universal computation is `almost surely' chaotic
EXPTIME-completeness of thorough refinement on modal transition systems
On the complexity of computing winning strategies for finite poset games
A temporal logic for asynchronous hyperproperties
Computing Stable Outcomes in Hedonic Games
Unbounded-error quantum computation with small space bounds
Evaluating the Impact of Information Distortion on Normalized Compression Distance
Deciding confluence for a simple class of relational transducer networks
Metric structures and probabilistic computation
Unique Normalization for Shallow TRS
The stochastic thermodynamics of computation
Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
Polynomial recognition of cluster algebras of finite type
A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence
Instruction sequence processing operators
Primitivity of finitely presented monomial algebras.
The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
Solving a PSPACE-complete problem with cP systems
The compound interest in relaxing punctuality
A fixed-parameter perspective on \#BIS
Embedding ordered sets into distributive lattices
Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces
If the current clique algorithms are optimal, so is Valiant's parser
Logical and algorithmic properties of stable conditional independence
Probabilistic disclosure: maximisation vs. minimisation
An automaton-theoretic approach to the representation theory of quantum algebras
Approximately counting locally-optimal structures
On the iterative convergence of harmony search algorithm and a proposed modification
Varieties
An alternating hierarchy for finite automata
Information-theoretical complexity for the hydrogenic identity $S_N2$ exchange reaction
Existence of solutions of integral equations with asymptotic conditions
Interleaving isotactics -- an equivalence notion on behaviour abstractions
Membrane automata for modeling biomolecular processes
Closure properties of subregular languages under operations
Integer multiplication in time $O(n\log n)$
Space complexity equivalence of P systems with active membranes and Turing machines
Undecidable properties of flat term rewrite systems
Hugo Hadwiger's influence on geometric dissections with special properties
Theory of computation.
Combinatorics on partial word correlations

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)