scientific article

No author found.

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Algorithms Complexity analysis of algorithms Theoretical computer science complexity theory

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items

Abstract complexity theory and the $\Delta_{2}^{0}$ degrees, AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS, P Systems with Active Membranes Operating under Minimal Parallelism, On the complexity of inducing categorical and quantitative association rules, 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, The computational complexity of scenario-based agent verification and design, Lattice-theoretical fixpont theorems in morphological image filtering, Obstructions to within a few vertices or edges of acyclic, On finding spanning trees with few leaves, Attribute value reordering for efficient hybrid OLAP, A reducibility concept for problems defined in terms of ordered binary decision diagrams, A bulk-synchronous parallel process algebra, Approximating call-scheduling makespan in all-optical networks, A complete one-way function based on a finite rank free $\mathbb{Z}\times\mathbb{Z}$-module, Area-efficient planar straight-line drawings of outerplanar graphs, On Lindenmayerian algebraic power series, On Lindenmayerian algebraic sequences, Semi-discrete optimal transport: hardness, regularization and numerical solution, Beyond the worst-case bisection bound: Fast sorting and ranking on meshes, Automated repair for timed systems, Scheduling multicasts on unit-capacity trees and meshes., Finding total unimodularity in optimization problems solved by linear programs, Asynchronous P systems with active membranes, Combinatorics on update digraphs in Boolean networks, Incorporating decision procedures in implicit induction., Smallest Formulas for Parity of 2 k Variables Are Essentially Unique, The Knuth-Bendix algorithm and the conjugacy problem in monoids., Formulae and Asymptotics for Coefficients of Algebraic Functions, FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY, Generalizing input-driven languages: theoretical and practical benefits, Parameters Tied to Treewidth, $L(2,1)$-labelings of some families of oriented planar graphs, Two-way automata and length-preserving homomorphisms, On-line routing in all-optical networks, 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, THE THOMPSON–HIGMAN MONOIDS M_k,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY, Data independence of read, write, and control structures in PRAM computations, Two linear time Union--Find strategies for image processing, Quantum Boolean image denoising, Selected Topics in Computational Complexity of Membrane Systems, Advice classes of parametrized tractability, Depth first search in claw-free graphs, A new SLDNF-tree, Global optimization test problems based on random field composition, One-way permutations, computational asymmetry and distortion., THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY, Logic circuits from zero forcing, THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M_{k, 1} AND THEIR COMPLEXITY, I/O- and CPU-optimal recognition of strongly connected components, Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta., Geometric phase-transition on systems with sparse long-range connections, A reducibility concept for problems defined in terms of ordered binary decision diagrams, A Generalization of Semenov’s Theorem to Automata over Real Numbers, Facility location with dynamic distance functions, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, Factoring with Two Large Primes, Shallow confluence of conditional term rewriting systems, ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS, Priority queues on parallel machines, Recognizing the tractability in big data computing, P systems attacking hard problems beyond NP: a survey, CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS, Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer, The word problem of the Brin-Thompson group is \textsf{coNP}-complete, On privacy preserving data release of linear dynamic networks, Class Steiner trees and VLSI-design, Reductions and functors from problems to word problems, Computation paths logic: An expressive, yet elementary, process logic, S-semantics for logic programming: a retrospective look, Abstract interpretation of resolution-based semantics, Synchronized Regular Expressions, Type dependencies for logic programs using ACI-unification, Proving primality in essentially quartic random time, A Theory of Bounded Fair Scheduling, Verification of programs with half-duplex communication, 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., A theory of even functionals and their algorithmic applications, On the Yoneda completion of a quasi-metric space, Logical optimality of groundness analysis, Three dual ontologies