Pages that link to "Item:Q3316595"
From MaRDI portal
The following pages link to Simulation of Parallel Random Access Machines by Circuits (Q3316595):
Displayed 50 items.
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits (Q293467) (← links)
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
- Parallel random access machines with bounded memory wordsize (Q757038) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- An optimal parallel connectivity algorithm (Q797997) (← links)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Efficient simulation of circuits by EREW PRAMs (Q911771) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- Limits on the power of concurrent-write parallel machines (Q1103403) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- Lower bound arguments with ``inaccessible'' numbers (Q1107308) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Learning in parallel (Q1187024) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Two \(P\)-complete problems in the theory of the reals (Q1203649) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- A query language for NC (Q1376409) (← links)
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Thresholds for extreme orientability (Q2249738) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL <font>P</font> SYSTEMS (Q3076599) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS (Q3569286) (← links)
- Parallel complexity of algebraic operations (Q4005330) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)