The following pages link to (Q3392273):
Displaying 50 items.
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
- On \(\tau\)-adic representations of integers (Q1008948) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Factorizing RSA keys, an improved analogue solution (Q1031929) (← links)
- Computation with finite stochastic chemical reaction networks (Q1035715) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Tile invariants: New horizons. (Q1401369) (← links)
- Almost periodic sequences. (Q1401389) (← links)
- \(\mathcal P = \mathcal{NP}\)? (Q1404168) (← links)
- System theory for system identification. (Q1421324) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Graph-theoretical characterization of invertible cellular automata (Q1581757) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
- Scott sentences for certain groups (Q1745362) (← links)
- Quantum walks: a comprehensive review (Q1757875) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Minimal DFA for testing divisibility (Q1880782) (← links)
- A note on tolerance graph recognition (Q1887065) (← links)
- On conditional decomposability (Q1932746) (← links)
- Light tail asymptotics in multidimensional reflecting processes for queueing networks (Q1939045) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- Decision problems and projection languages for restricted variants of two-dimensional automata (Q2029491) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Fitness landscape analysis of automated machine learning search spaces (Q2057125) (← links)
- Incompleteness and the halting problem (Q2062219) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Automata equipped with auxiliary data structures and regular realizability problems (Q2096592) (← links)
- The application of hypergroups in symbolic executions and finite automata (Q2098344) (← links)
- The complexity of quantum circuit mapping with fixed parameters (Q2102776) (← links)
- Liouville numbers and the computational complexity of changing bases (Q2106591) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- Efficient enumeration of regular expressions for faster regular expression synthesis (Q2117664) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar (Q2142536) (← links)
- A modal view on resource-bounded propositional logics (Q2157601) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369) (← links)
- Self-similar fractals: an algorithmic point of view (Q2254823) (← links)
- On expressive power of regular realizability problems (Q2262977) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- The instability of instability of centered distributions (Q2270335) (← links)
- A fixed-parameter perspective on \#BIS (Q2272593) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- A formal model of semantic computing (Q2318288) (← links)
