Publication:3998976
From MaRDI portal
zbMath0712.68054MaRDI QIDQ3998976
No author found.
Publication date: 23 January 1993
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science
Related Items
Factoring with Two Large Primes, THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY, AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS, Two-way automata and length-preserving homomorphisms, Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta., A Generalization of Semenov’s Theorem to Automata over Real Numbers, CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS, A Theory of Bounded Fair Scheduling, Geometric phase-transition on systems with sparse long-range connections, A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module, Asynchronous P systems with active membranes, 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, The problem of stabilization of networked systems under computational power constraints, Finding total unimodularity in optimization problems solved by linear programs, Combinatorics on update digraphs in Boolean networks, The Knuth-Bendix algorithm and the conjugacy problem in monoids., Two linear time Union--Find strategies for image processing, Advice classes of parametrized tractability, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees, A coarse-grained multicomputer algorithm for the detection of repetitions, Attribute value reordering for efficient hybrid OLAP, A bulk-synchronous parallel process algebra, Approximating call-scheduling makespan in all-optical networks, Area-efficient planar straight-line drawings of outerplanar graphs, One-way permutations, computational asymmetry and distortion., On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, S-semantics for logic programming: a retrospective look, Abstract interpretation of resolution-based semantics, A new SLDNF-tree, I/O- and CPU-optimal recognition of strongly connected components, Class Steiner trees and VLSI-design, Lattice-theoretical fixpont theorems in morphological image filtering, A reducibility concept for problems defined in terms of ordered binary decision diagrams, On Lindenmayerian algebraic power series, On Lindenmayerian algebraic sequences, Scheduling multicasts on unit-capacity trees and meshes., Incorporating decision procedures in implicit induction., Reductions and functors from problems to word problems, Type dependencies for logic programs using ACI-unification, On the Yoneda completion of a quasi-metric space, Logical optimality of groundness analysis, Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Automata techniques for query inference machines, A simplified correctness proof for a well-known algorithm computing strongly connected components., Automata, Boolean matrices, and ultimate periodicity., Three dual ontologies, On the complexity of inducing categorical and quantitative association rules, On-line routing in all-optical networks, Data independence of read, write, and control structures in PRAM computations, The computational complexity of scenario-based agent verification and design, On finding spanning trees with few leaves, \(L(2,1)\)-labelings of some families of oriented planar graphs, Shallow confluence of conditional term rewriting systems, Verification of programs with half-duplex communication, Synchronized Regular Expressions, P Systems with Active Membranes Operating under Minimal Parallelism, THE THOMPSON–HIGMAN MONOIDS Mk,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY, Selected Topics in Computational Complexity of Membrane Systems, ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS, Proving primality in essentially quartic random time, Smallest Formulas for Parity of 2 k Variables Are Essentially Unique, FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY, THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID Mk, 1 AND THEIR COMPLEXITY
