Pages that link to "Item:Q2542990"

The following pages link to On the computational power of pushdown automata (Q2542990):

Displaying 50 items.

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
• The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
• A tight bound for approximating the square root (Q287183) (← links)
• Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint (Q287196) (← links)
• K-M-P string matching revisited (Q293129) (← links)
• Path-based depth-first search for strong and biconnected components (Q294748) (← links)
• An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
• Even faster integer multiplication (Q306687) (← links)
• The derivational complexity of string rewriting systems (Q441853) (← links)
• \(k\)-abelian pattern matching (Q491150) (← links)
• Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
• Simultaneous modular reduction and Kronecker substitution for small finite fields (Q540334) (← links)
• 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)
• Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
• The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation (Q630612) (← links)
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← 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)
• On the parameterized complexity of associative and commutative unification (Q729894) (← links)
• Simple algorithms for approximating all roots of a polynomial with real roots (Q757494) (← links)
• The complexity of equivalence for commutative rings (Q758209) (← links)
• Cost analysis of object-oriented bytecode programs (Q764297) (← 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)
• A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
• Algorithms for near solutions to polynomial equations (Q840709) (← links)