Amanote Research

Amanote Research

    RegisterSign In

Lower Bounds for Recognizing Small Cliques on CRCW PRAM's

Discrete Applied Mathematics - Netherlands
doi 10.1016/0166-218x(90)90079-r
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

November 1, 1990

Authors
Paul Beame
Publisher

Elsevier BV


Related search

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Volumes of Small Balls on Open Manifolds: Lower Bounds and Examples

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

On Lower Bounds for the Kirchhoff Index

Kragujevac Journal of Science
2017English

On Lower Bounds for the Ihara Constants and

Compositio Mathematica
Number TheoryAlgebra
2013English

Lower Bounds

2016English

On Some Lower Bounds for the Kirchhoff Index

Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
2018English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy