Lower bounds for recognizing small cliques on CRCW PRAM's
- 1 November 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 29 (1) , 3-20
- https://doi.org/10.1016/0166-218x(90)90079-r
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- First-order definability on finite structuresAnnals of Pure and Applied Logic, 1989
- Optimal bounds for decision problems on the CRCW PRAMJournal of the ACM, 1989
- Limits on the power of concurrent-write parallel machinesInformation and Computation, 1988
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983