The following pages link to (Q3392275):
Displaying 50 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Deciding confluence for a simple class of relational transducer networks (Q269334) (← links)
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure (Q279371) (← links)
- Polynomial recognition of cluster algebras of finite type (Q279747) (← links)
- Approximately counting locally-optimal structures (Q295655) (← links)
- On the iterative convergence of harmony search algorithm and a proposed modification (Q297874) (← links)
- Retracted: Universal computation is `almost surely' chaotic (Q403026) (← links)
- Scheduling in a dynamic heterogeneous distributed system using estimation error (Q436905) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- Information-theoretical complexity for the hydrogenic identity \(S_N2\) exchange reaction (Q445421) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- The complexity of debate checking (Q493647) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Capacity factors in a point-to-point network (Q508675) (← links)
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Hugo Hadwiger's influence on geometric dissections with special properties (Q613905) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- On complete one-way functions (Q734307) (← links)
- A temporal logic for asynchronous hyperproperties (Q832224) (← links)
- Turing machines and bimachines (Q930927) (← links)
- Logical and algorithmic properties of stable conditional independence (Q985147) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Primitivity of finitely presented monomial algebras. (Q1013104) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- An automaton-theoretic approach to the representation theory of quantum algebras (Q1047663) (← links)
- A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence (Q1621258) (← links)
- Existence of solutions of integral equations with asymptotic conditions (Q1640814) (← links)
- Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- ``Viral'' Turing machines, computation from noise and combinatorial hierarchies (Q1694134) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources (Q1723059) (← links)
- Polynomial expressions for non-binomial structures (Q1729687) (← links)
- Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces (Q1745633) (← links)
- Pregroup grammars with letter promotions: complexity and context-freeness (Q1757847) (← links)
- Achievable complexity-performance tradeoffs in lossy compression (Q1945149) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- Computing with SN P systems with I/O mode (Q1982977) (← links)
- Solving a PSPACE-complete problem with cP systems (Q1982985) (← links)
- A return to stochasticity and probability in spiking neural P systems (Q1983017) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- The compound interest in relaxing punctuality (Q2024340) (← links)
