Pages that link to "Item:Q3694688"
From MaRDI portal
The following pages link to A taxonomy of problems with fast parallel algorithms (Q3694688):
Displaying 50 items.
- Relativizing small complexity classes and their theories (Q260396) (← links)
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228) (← links)
- An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- On the complexity of topological sorting (Q750150) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- The effective entropies of some extensions of context-free languages (Q751289) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- Pipelining tree-structured algorithms on SIMD architectures (Q911739) (← links)
- Parallel complexity of the regular code problem (Q913513) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- A P-complete graph partition problem (Q917313) (← links)
- Problems complete for \(\oplus L\) (Q918696) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Reductions to graph isomorphism (Q987394) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Parallelism and the maximal path problem (Q1098641) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- A parallel algorithm for bisection width in trees (Q1103410) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- Membership testing in commutative transformation semigroups (Q1108790) (← links)
- A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- On a complexity hierarchy between L and NL (Q1114402) (← links)
- A measure of relativized space which is faithful with respect to depth (Q1115190) (← links)
- On a proposed divide-and-conquer minimal spanning tree algorithm (Q1115202) (← links)
