Derandomized graph products
type: Item
instance of: scholarly article
title: Derandomized graph products
zbMATH Open document ID: 0816.60070
DOI: 10.1007/BF01277956
author: Noga Alon
author: A. Wigderson
author: David Zuckerman
author: Uriel Feige
published in: Computational Complexity
publication date: 1995-07-16T00:00:00Z
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 746211
zbMATH Keywords: approximation
zbMATH Keywords: derandomization
zbMATH Keywords: randomized graph products
zbMATH Keywords: random walks on expander graphs
MaRDI profile type: Publication
cites work: Eigenvalues and expanders
cites work: Explicit construction of linear sized tolerant networks
cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations
cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations
cites work: Q4230322
cites work: Q4230321
cites work: Randomness in interactive proofs
cites work: Q3128896
cites work: On the complexity of approximating the independent set problem
cites work: Explicit constructions of linear-sized superconcentrators
cites work: Q4198056
cites work: Greed is good: approximating independent sets in sparse and bounded-degree graphs
cites work: Ramanujan graphs
cites work: Q5331504
cites work: Optimization, approximation, and complexity classes
full work available at URL: https://doi.org/10.1007/bf01277956
OpenAlex ID: W2055656009
description: scientific article; zbMATH DE number 746211