Derandomized graph products
- 1 March 1995
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 5 (1) , 60-75
- https://doi.org/10.1007/bf01277956
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The complexity and approximability of finding maximum feasible subsystems of linear relationsTheoretical Computer Science, 1995
- Greed is goodPublished by Association for Computing Machinery (ACM) ,1994
- On the complexity of approximating the independent set problemInformation and Computation, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Ramanujan graphsCombinatorica, 1988
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- Eigenvalues and expandersCombinatorica, 1986
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981