Pages that link to "Item:Q919820"
From MaRDI portal
The following pages link to Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820):
Displaying 8 items.
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- \(O (\log^* n)\) algorithms on a Sum-CRCW PRAM (Q873150) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- \(O(\log \log n)\)-time integer geometry on the CRCW PRAM (Q1894712) (← links)
- Ehrenfeucht-Fraïssé Games on Random Structures (Q3638295) (← links)
- (Q5077146) (← links)
- (Q5875501) (← links)
