The following pages link to (Q3998976):
Displaying 50 items.
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- Asynchronous P systems with active membranes (Q418762) (← links)
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications (Q458460) (← links)
- The problem of stabilization of networked systems under computational power constraints (Q468338) (← links)
- Quantum Boolean image denoising (Q501140) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- Finding total unimodularity in optimization problems solved by linear programs (Q627545) (← links)
- Combinatorics on update digraphs in Boolean networks (Q628333) (← links)
- The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← links)
- Two linear time Union--Find strategies for image processing (Q672744) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
- Attribute value reordering for efficient hybrid OLAP (Q855692) (← links)
- A bulk-synchronous parallel process algebra (Q875955) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- S-semantics for logic programming: a retrospective look (Q1035702) (← links)
- Abstract interpretation of resolution-based semantics (Q1035705) (← links)
- A new SLDNF-tree (Q1199935) (← links)
- I/O- and CPU-optimal recognition of strongly connected components (Q1209333) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- Lattice-theoretical fixpont theorems in morphological image filtering (Q1343389) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
- On Lindenmayerian algebraic power series (Q1391140) (← links)
- On Lindenmayerian algebraic sequences (Q1391141) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Incorporating decision procedures in implicit induction. (Q1404422) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
- On the Yoneda completion of a quasi-metric space (Q1605178) (← links)
- Logical optimality of groundness analysis (Q1605228) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Automata techniques for query inference machines (Q1849855) (← links)
- A simplified correctness proof for a well-known algorithm computing strongly connected components. (Q1853027) (← links)
- Automata, Boolean matrices, and ultimate periodicity. (Q1854295) (← links)
- Three dual ontologies (Q1868336) (← links)
- On the complexity of inducing categorical and quantitative association rules (Q1884923) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Logic circuits from zero forcing (Q2003480) (← links)
- P systems attacking hard problems beyond NP: a survey (Q2299891) (← links)
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657) (← links)
- On privacy preserving data release of linear dynamic networks (Q2307532) (← links)
- The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
