Pages that link to "Item:Q4018401"
From MaRDI portal
The following pages link to An Optimal Parallel Algorithm for Formula Evaluation (Q4018401):
Displaying 30 items.
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- The complexity of solitaire (Q1034532) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Speedup of determinism by alternation for multidimensional Turing machines (Q1341727) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Complexity of regular functions (Q2424670) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Cost Register Automata for Nested Words (Q2817901) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Optimal parallel generation of a computation tree form (Q3678673) (← links)
- Frege proof system and TNC° (Q4212930) (← links)
- Interpolating Arithmetic Read-Once Formulas in Parallel (Q4388878) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- (Q5136328) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
