Towards a Study of Low-Complexity Graphs
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 119-131
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- A Brief History of Generative Models for Power Law and Lognormal DistributionsInternet Mathematics, 2004
- Property testing and its connection to learning and approximationJournal of the ACM, 1998
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Natural ProofsJournal of Computer and System Sciences, 1997
- Interactive proofs and the hardness of approximating cliquesJournal of the ACM, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984