scientific article; zbMATH DE number 5595151
From MaRDI portal
Publication:3392273
Cited in
(only showing first 100 items - show all)- Lower bounds for the graph homomorphism problem
- scientific article; zbMATH DE number 7770057 (Why is no real title available?)
- Regular model checking revisited
- Flowpipe approximation and clustering in space-time
- Interactive and probabilistic proof-checking
- Jug measuring: algorithms and complexity
- The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
- Frontiers of tractability for typechecking simple XML transformations
- The instability of instability of centered distributions
- An efficient protocol for oblivious DFA evaluation and applications
- Concatenation of Regular Languages and Descriptional Complexity
- A formal model of semantic computing
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
- Boolean circuit programming: A new paradigm to design parallel algorithms
- On the algorithmic complexity of static structures
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
- Computational complexity of some problems involving congruences on algebras
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- On the computational power of affine automata
- Computational complexity in non-Turing models of computation: the what, the why and the how
- Nondeterministic complexity of operations on closed and ideal languages
- Relational semantics for Kleene logic and action logic
- Tradeoff lower lounds for stack machines
- On \(\tau\)-adic representations of integers
- Supervisory Control of Discrete-Event Systems
- On the decidability of stability of hybrid systems
- A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions
- Decision problems and projection languages for restricted variants of two-dimensional automata
- Prefix-free languages: left and right quotient and reversal
- A bypassing path based routing algorithm for the pyramid structures
- The complexity of concatenation on deterministic and alternating finite automata
- Inverse subsemigroups of finite index in finitely generated inverse semigroups
- Lifting non-finite axiomatizability results to extensions of process algebras
- A fixed-parameter perspective on \#BIS
- Magic Numbers and Ternary Alphabet
- 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
- Self-verifying finite automata and descriptional complexity
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
- System theory for system identification.
- Log-space conjugacy problem in the Grigorchuk group
- The Complexity of Languages Resulting from the Concatenation Operation
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
- Temporal logic model predictive control for discrete-time systems
- First-cycle games
- A note on algebras of languages
- Regular path queries under approximate semantics
- Concatenation of regular languages and descriptional complexity
- Randomness and computation
- A note on tolerance graph recognition
- The complexity of finding SUBSEQ\((A)\)
- Does the polynomial hierarchy collapse if onto functions are invertible?
- Nondeterministic polynomial time factoring in the tile assembly model
- Computing equilibria: a computational complexity perspective
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Almost periodic sequences.
- Tile invariants: New horizons.
- Factorizing RSA keys, an improved analogue solution
- Modal and mixed specifications: key decision problems and their complexities
- On Khot’s unique games conjecture
- Control design for specifications on stochastic hybrid systems
- Iterative temporal motion planning for hybrid systems in partially unknown environments
- Book review of: S. Arora and B. Barak, Computational complexity: a modern approach.
- Computational bounds on polynomial differential equations
- Verifying time complexity of Turing machines
- Grothendieck-type inequalities in combinatorial optimization
- On the expressiveness of interaction
- Small fast universal Turing machines
- Magic numbers and ternary alphabet
- Scott sentences for certain groups
- Multiple pattern matching: a Markov chain approach
- On expressive power of regular realizability problems
- State complexity of some operations on binary regular languages
- A study of a generalization of a card problem
- Reverse complexity
- Computation with finite stochastic chemical reaction networks
- Finite state complexity
- Self-similar fractals: an algorithmic point of view
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- A structural/temporal query language for business processes
- Limited-information control of hybrid systems via reachable set propagation
- State complexity of projected languages
- Boundedness of the domain of definition is undecidable for polynomial ODEs
- Efficiently identifying deterministic real-time automata from labeled data
- On the formalization of some results of context-free language theory
- Physical portrayal of computational complexity
- Deterministic blow-ups of minimal NFA's
- The efficiency of identifying timed automata and the power of clocks
- Exponential lower bounds for polytopes in combinatorial optimization
- The axiomatic power of Kolmogorov complexity
- Solving NP-complete problems in the tile assembly model
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
- On a structural property in the state complexity of projected regular languages
- On the Complexity of Input/Output Logic
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
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)
