The following pages link to (Q4843270):
Displaying 50 items.
- On the complexity of asynchronous freezing cellular automata (Q2051787) (← links)
- On fungal automata (Q2086749) (← links)
- On the complexity of generalized Q2R automaton (Q2134005) (← links)
- Rational index of languages with bounded dimension of parse trees (Q2164007) (← links)
- On the complexity of the stability problem of binary freezing totalistic cellular automata (Q2201794) (← links)
- The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
- Computational universality of fungal sandpile automata (Q2213185) (← links)
- Interval matrices with Monge property. (Q2216225) (← links)
- The complexity of the majority rule on planar graphs (Q2255002) (← links)
- On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- The complexity of linear programming in \((\gamma ,\kappa )\)-form (Q2380073) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Problem of checking the functional completeness in the class of piecewise parallel functions (Q2513031) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Partial order games (Q2669153) (← links)
- A lattice-based McEliece scheme for encryption and signature (Q2741436) (← links)
- Trace Refinement in Labelled Markov Decision Processes (Q2811347) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- The complexity of the comparator circuit value problem (Q2828221) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- A mobility model for studying wireless communication and the complexity of problems in the model (Q2894250) (← links)
- On computational complexity of construction of \(c\)-optimal linear regression models over finite experimental domains (Q2913226) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Dynamic Complexity of the Dyck Reachability (Q2988373) (← links)
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Path Checking for MTL and TPTL over Data Words (Q3451113) (← links)
- On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution (Q3543341) (← links)
- COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS (Q3569286) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
- On the Average Case Complexity of Some P-complete Problems (Q4256141) (← links)
- Ideal membership in polynomial rings over the integers (Q4461098) (← links)
- The Logic of Choice (Q4527924) (← links)
- (Q4536416) (← links)
- (Q4553282) (← links)
- Certified Graph View Maintenance with Regular Datalog (Q4559800) (← links)
- On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism (Q4686646) (← links)
- Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
- Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks (Q4884664) (← links)
