Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 15 results in range #1 to #15.
- Isomorphism of Planar Graphs (Working Paper): Label: en
- Toward a Lower Bound for Sorting Networks: Label: en
- An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File: Label: en
- Permuting Information in Idealized Two-Level Storage: Label: en
- Reducibility among Combinatorial Problems: Label: en
- The Computational Complexity of Elliptic Partial Differential Equations: Label: en
- The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations: Label: en
- Parallel Iteration Methods: Label: en
- Efficient Iterations for Algebraic Numbers: Label: en
- On Obtaining Upper Bounds on the Complexity of Matrix Multiplication: Label: en
- Simple Proofs of Lower Bounds for Polynomial Evaluation: Label: en
- Solving Linear Equations by Means of Scalar Products: Label: en
- Evaluation of Rational Functions: Label: en
- Panel Discussion: Label: en
- Efficiency of Equivalence Algorithms: Label: en
