CREW PRAMs and Decision Trees
- 1 December 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (6) , 999-1007
- https://doi.org/10.1137/0220062
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?Combinatorica, 1989
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- Parallel RAMs with owned global memory and deterministic context-free language recognitionPublished by Springer Nature ,1986
- Lower bounds on probabilistic linear decision treesTheoretical Computer Science, 1985
- A topological approach to evasivenessCombinatorica, 1984
- The critical complexity of graph propertiesInformation Processing Letters, 1984
- A tight Ω(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functionsPublished by Springer Nature ,1983
- Further results on the Aanderaa-Rosenberg conjectureJournal of Combinatorial Theory, Series B, 1980
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976
- On the time required to recognize properties of graphsACM SIGACT News, 1973