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.
- A note on detecting simple redundancies in linear systems (Q579125) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- Fast computation of divided differences and parallel Hermite interpolation (Q581992) (← links)
- String-matching with OBDDs (Q596086) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- A note on the complexity of approximative evaluation of polynomials (Q599498) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- Resolving all deadlocks in distributed systems (Q672659) (← links)
- A simple sub-quadratic algorithm for computing the subset partial order (Q672836) (← links)
- A theory of even functionals and their algorithmic applications (Q672856) (← links)
- An algebraic characterization of frontier testable tree languages (Q672861) (← links)
- A grid embedding into the star graph for image analysis solutions (Q673233) (← links)
- Sparse interpolation of symmetric polynomials (Q678607) (← links)
- Computability of recurrence equations (Q685372) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- Complexity of algorithm and operations on trees (Q688696) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Anonymous message communications with user hierarchy in a multicast system (Q702584) (← links)
- Simple algorithms for approximating all roots of a polynomial with real roots (Q757494) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- The complexity of monadic recursion schemes: executability problems, nesting depth, and applications (Q792758) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- Efficient inference control for range SUM queries (Q797310) (← links)
- A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Communication complexity of PRAMs (Q913504) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- The unpredictable deviousness of models (Q959796) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- On limits on the computational power of data-accumulating algorithms (Q1007605) (← links)
- Computational experience with minimum spanning tree algorithms (Q1053620) (← links)
- Embeddings of binary trees in lines (Q1058856) (← links)
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs (Q1059646) (← links)
- 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)