Pages that link to "Item:Q2542990"
From MaRDI portal
The following pages link to On the computational power of pushdown automata (Q2542990):
Displayed 50 items.
- Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra (Q1060232) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Multiplication is the easiest nontrivial arithmetic function (Q1066671) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Computing in general Abelian groups is hard (Q1070820) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Molecular dynamics on vector computers (Q1073533) (← links)
- System structure: stability and controllability (Q1078524) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- Computing a ham-sandwich cut in two dimensions (Q1091824) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A fast algorithm for the discrete Laplace transformation (Q1104064) (← links)
- A multiprocessor architecture for solving nonlinear partial differential equations (Q1118368) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- Fast verification, testing, and generation of large primes (Q1132906) (← links)
- Uniform data encodings (Q1134520) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- On evaluating strategies for the computation of DWBA integrals (Q1151229) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Some elements of a Galois theory of the structure and complexity of the tree automorphism problem (Q1155358) (← links)
- General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
- Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293) (← links)
- On the complexity of edge labelings for trees (Q1161294) (← links)
- An algorithm for matrix symmetrization (Q1166891) (← links)
- A graph theoretic approach to switching function minimization (Q1168952) (← links)
- Scheduling subject to nonrenewable-resource constraints (Q1169397) (← links)
- (g//0,g//1,\dots ,g//k)-trees and unary OL systems (Q1169816) (← links)
- On the complexity of the one-terminal network design problem (Q1169929) (← links)
- A simple algorithm to detect balance in signed graphs (Q1170207) (← links)
- The complexity of computing metric distances between partitions (Q1170849) (← links)
- R-domination of block graphs (Q1171499) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata (Q1184982) (← links)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)