scientific article; zbMATH DE number 5595151

zbMATH Open1169.68300MaRDI QIDQ3392273FDOQ3392273

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)

Flowpipe approximation and clustering in space-time
On the computational power of affine automata
The Complexity of Languages Resulting from the Concatenation Operation
Decision problems and projection languages for restricted variants of two-dimensional automata
Interactive and probabilistic proof-checking
Lifting non-finite axiomatizability results to extensions of process algebras
Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares
Second-level algorithms, superrecursivity, and recovery problem in distributed systems
Statistical estimation with bounded memory
Control of discrete-event systems with partial observations using coalgebra and coinduction
Producing and verifying extremely large propositional refutations
The complexity of finding SUBSEQ\((A)\)
Frontiers of tractability for typechecking simple XML transformations
On the algorithmic complexity of static structures
A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
A bypassing path based routing algorithm for the pyramid structures
System theory for system identification.
Randomness and computation
A fixed-parameter perspective on \#BIS
Inverse subsemigroups of finite index in finitely generated inverse semigroups
Magic Numbers and Ternary Alphabet
A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions
Regular path queries under approximate semantics
Does the polynomial hierarchy collapse if onto functions are invertible?
A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
Computational complexity in non-Turing models of computation: the what, the why and the how
Self-verifying finite automata and descriptional complexity
Lower bounds for the graph homomorphism problem
Regular model checking revisited
Tradeoff lower lounds for stack machines
On the decidability of stability of hybrid systems
Boolean circuit programming: A new paradigm to design parallel algorithms
Prefix-free languages: left and right quotient and reversal
The complexity of concatenation on deterministic and alternating finite automata
The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
Concatenation of Regular Languages and Descriptional Complexity
An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
Title not available (Why is that?)
MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
Concatenation of regular languages and descriptional complexity
Supervisory Control of Discrete-Event Systems
An efficient protocol for oblivious DFA evaluation and applications
Jug measuring: algorithms and complexity
On \(\tau\)-adic representations of integers
A note on tolerance graph recognition
A note on algebras of languages
Nondeterministic polynomial time factoring in the tile assembly model
The instability of instability of centered distributions
Computational complexity of some problems involving congruences on algebras
Nondeterministic complexity of operations on closed and ideal languages
Computing equilibria: a computational complexity perspective
A formal model of semantic computing
First-cycle games
Relational semantics for Kleene logic and action logic
Temporal logic model predictive control for discrete-time systems
Log-space conjugacy problem in the Grigorchuk group
\textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
Reversal of binary regular languages
STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
Modal and mixed specifications: key decision problems and their complexities
Limited-information control of hybrid systems via reachable set propagation
Factorizing RSA keys, an improved analogue solution
Physical portrayal of computational complexity
Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
On the expressiveness of interaction
A study of heuristic guesses for adiabatic quantum computation
On solving systems of diagonal polynomial equations over finite fields
Multiple pattern matching: a Markov chain approach
Finite state complexity
A structural/temporal query language for business processes
Efficiently identifying deterministic real-time automata from labeled data
Solving NP-complete problems in the tile assembly model
Two-Way Automata versus Logarithmic Space
Admissibility of cut in LC with fixed point combinator
On Khot’s unique games conjecture
Exponential lower bounds for polytopes in combinatorial optimization
The efficiency of identifying timed automata and the power of clocks
On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
Computational bounds on polynomial differential equations
Small fast universal Turing machines
Reverse complexity
On the formalization of some results of context-free language theory
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
State complexity of some operations on binary regular languages
Computation with finite stochastic chemical reaction networks
Gaussian quantum computation with oracle-decision problems
Scott sentences for certain groups
Efficient 3-SAT algorithms in the tile assembly model
A full computation-relevant topological dynamics classification of elementary cellular automata
Control design for specifications on stochastic hybrid systems
Iterative temporal motion planning for hybrid systems in partially unknown environments
On a structural property in the state complexity of projected regular languages
A formalization of multi-tape Turing machines
Some remarks on real numbers induced by first-order spectra
Quantum walks: a comprehensive review
Grothendieck-type inequalities in combinatorial optimization
Boundedness of the domain of definition is undecidable for polynomial ODEs

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 Q3392273)