scientific article; zbMATH DE number 5595151
From MaRDI portal
Publication:3392273
Cited in
(only showing first 100 items - show all)- Remarks on the computational power of some restricted variants of P systems with active membranes
- Games for complexity of second-order call-by-name programs
- Least-violating control strategy synthesis with safety rules
- Learning nonlinear hybrid systems: from sparse optimization to support vector regression
- Reversal of binary regular languages
- Flowpipe approximation and clustering in space-time
- Observer design for a class of piecewise affine hybrid systems
- Tracking differentiable trajectories across polyhedra boundaries
- Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
- The application of hypergroups in symbolic executions and finite automata
- The Complexity of Languages Resulting from the Concatenation Operation
- On the computational power of affine automata
- Ambiguity of unary symmetric difference NFAs
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Modal and mixed specifications: key decision problems and their complexities
- Limited-information control of hybrid systems via reachable set propagation
- Decision problems and projection languages for restricted variants of two-dimensional automata
- The complexity of quantum circuit mapping with fixed parameters
- Liouville numbers and the computational complexity of changing bases
- On the complexity of conversion between classic real number representations
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- On computable numbers, nonuniversality, and the genuine power of parallelism
- Universality of SN P systems with stochastic application of rules
- Factorizing RSA keys, an improved analogue solution
- \(\mathcal P = \mathcal{NP}\)?
- Physical portrayal of computational complexity
- Interactive and probabilistic proof-checking
- Interpolating greedy and reluctant algorithms
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- Lifting non-finite axiomatizability results to extensions of process algebras
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems
- Statistical estimation with bounded memory
- Producing and verifying extremely large propositional refutations
- Control of discrete-event systems with partial observations using coalgebra and coinduction
- The complexity of finding SUBSEQ(A)
- Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
- On the expressiveness of interaction
- Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares
- Frontiers of tractability for typechecking simple XML transformations
- Automated analysis of real-time scheduling using graph games
- On the algorithmic complexity of static structures
- Non-expansive matrix number systems with bases similar to certain Jordan blocks
- A study of heuristic guesses for adiabatic quantum computation
- Polynomial functors constrained by regular expressions
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
- On solving systems of diagonal polynomial equations over finite fields
- A structural/temporal query language for business processes
- Multiple pattern matching: a Markov chain approach
- Efficiently identifying deterministic real-time automata from labeled data
- Finite state complexity
- Solving NP-complete problems in the tile assembly model
- Efficient enumeration of regular expressions for faster regular expression synthesis
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
- Admissibility of cut in LC with fixed point combinator
- Prefix-free subsets of regular languages and descriptional complexity
- Two-Way Automata versus Logarithmic Space
- Safe schedulability of bounded-rate multi-mode systems
- Minimal DFA for testing divisibility
- The efficiency of identifying timed automata and the power of clocks
- Regular Programming for Quantitative Properties of Data Streams
- Tracing compressed curves in triangulated surfaces
- On Khot’s unique games conjecture
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Exponential lower bounds for polytopes in combinatorial optimization
- Computational bounds on polynomial differential equations
- Equivalence classes and conditional hardness in massively parallel computations
- Reasoning about actions with loops via Hoare logic
- Average-energy games
- Agent-based modeling, mathematical formalism for
- Turing machines can be efficiently simulated by the general purpose analog computer
- A bypassing path based routing algorithm for the pyramid structures
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- System theory for system identification.
- Fan type condition and characterization of Hamiltonian graphs
- Reverse complexity
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
- Randomness and computation
- Square on Deterministic, Alternating, and Boolean Finite Automata
- Parameterised counting in logspace
- Small fast universal Turing machines
- On detectability of labeled Petri nets and finite automata
- On the formalization of some results of context-free language theory
- A fixed-parameter perspective on \#BIS
- Computation with finite stochastic chemical reaction networks
- State complexity of some operations on binary regular languages
- Gaussian quantum computation with oracle-decision problems
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- Inverse subsemigroups of finite index in finitely generated inverse semigroups
- Computability Models: Algebraic, Topological and Geometric Algorithms
- Grammar-based compression and its use in symbolic music analysis
- Polynomial kernels for vertex cover parameterized by small degree modulators
- An extension of complex role inclusion axioms in the description logic \(\mathcal{SROIQ}\)
- Adaptive Bin Packing with Overflow
- Magic Numbers and Ternary Alphabet
- Scott sentences for certain groups
- On the decidability of infix inclusion problem
- Algorithmic economics: incomputability, undecidability and unsolvability in economics
- Optimal CPU allocation to a set of control tasks with soft real-time execution constraints
- The combinatorics of evenly spaced binomial coefficients
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)
