Search filters

List of works by Mario Szegedy

Approximating clique is almost NP-complete

scholarly article

Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions

Efficient Testing of Large Graphs ⬇️

scholarly article from 'Combinatorica' published in 2000

Interactive proofs and the hardness of approximating cliques

Long Monotone Paths in Line Arrangements

article

On Conway's Thrackle Conjecture

scientific article published in 1997

Proof verification and hardness of approximation problems

1992 conference paper

Proof verification and the hardness of approximation problems

journal article published in 1998

Quantum Algorithms for the Triangle Problem

scholarly article by Frédéric Magniez et al published January 2007 in SIAM Journal on Computing

The Space Complexity of Approximating the Frequency Moments

The space complexity of approximating the frequency moments

a(mod p) ≤ b(mod p) for all primes p implies a = b

scientific article published in February 1987

Paulina is supported by:

About Paulina

Help