scientific article; zbMATH DE number 47903
From MaRDI portal
Publication:3998976
Complexity of computation (including implicit computational complexity) (03D15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(96)- 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
- Generalizing input-driven languages: theoretical and practical benefits
- Depth first search in claw-free graphs
- 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
- Logic circuits from zero forcing
- P systems attacking hard problems beyond NP: a survey
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete
- On privacy preserving data release of linear dynamic networks
- 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
- Parameters tied to treewidth
- The Thompson-Higman monoids \(M_{k,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
- scientific article; zbMATH DE number 3856408 (Why is no real title available?)
- 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 \(M_{k,1}\) and their complexity.
- Algorithms and theory of computation handbook. General concepts and techniques.
- Algorithms and theory of computation handbook. Special topics and techniques.
- scientific article; zbMATH DE number 3950421 (Why is no real title available?)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module
- scientific article; zbMATH DE number 107961 (Why is no real title available?)
- Asynchronous P systems with active membranes
- Factoring with Two Large Primes
- scientific article; zbMATH DE number 1047152 (Why is no real title available?)
- Computation paths logic: an expressive, yet elementary, process logic
- 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
- A theory of even functionals and their algorithmic applications
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
- The problem of stabilization of networked systems under computational power constraints
- AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS
- Current Trends in Theoretical Computer Science
- Two-way automata and length-preserving homomorphisms
- Refining and compressing abstract model checking
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- Quantum Boolean image denoising
- A reducibility concept for problems defined in terms of ordered binary decision diagrams
- Priority queues on parallel machines
- Facility location with dynamic distance functions
- Obstructions to within a few vertices or edges of acyclic
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- Global optimization test problems based on random field composition
- Formulae and asymptotics for coefficients of algebraic functions
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
- A Theory of Bounded Fair Scheduling
- Computational Complexity
- Geometric phase-transition on systems with sparse long-range connections
- 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
- 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.
- Theoretical computer science: computational complexity
- Constraint satisfaction, graph isomorphism, and the pebbling comonad
- On the complexity of the sequential sampling method
- Two linear time Union--Find strategies for image processing
- Advice classes of parametrized tractability
- Generalized asymptotic notations via filters: a new framework for algorithm analysis
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3998976)
