The following pages link to Mario Szegedy (Q178701):
Displaying 32 items.
- (Q4314041) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- (Q4464731) (← links)
- a(mod p) ≤b(mod p) for all Primes p Implies a = b (Q4724695) (← links)
- (Q4730211) (← links)
- (Q4763409) (← links)
- The Lovász Local Lemma – A Survey (Q4928468) (← links)
- (Q4938652) (← links)
- A new line of attack on the dichotomy conjecture (Q5172770) (← links)
- Query Complexity (Q5218478) (← links)
- The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry) (Q5232578) (← links)
- Locality based graph coloring (Q5248487) (← links)
- The Garden Hose Complexity for the Equality Function (Q5251639) (← links)
- Long monotone paths in line arrangements (Q5361614) (← links)
- Quantum Algorithms for the Triangle Problem (Q5386207) (← links)
- Moser and tardos meet Lovász (Q5419093) (← links)
- Product Rules in Semidefinite Programming (Q5444982) (← links)
- Parallel Repetition of the Odd Cycle Game (Q5458570) (← links)
- Quantum Query Complexity of State Conversion (Q5494975) (← links)
- Probabilistic Verification and Non-Approximability (Q5692513) (← links)
- Automata, Languages and Programming (Q5716754) (← links)
- Computing and Combinatorics (Q5716989) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5901075) (← links)
- Efficient testing of large graphs (Q5932749) (← links)
- Parent-identifying codes (Q5947366) (← links)
- (Q6179336) (← links)
- A simplified proof of a Lee-Yang type theorem (Q6253369) (← links)
- Impossibility Theorems and the Universal Algebraic Toolkit (Q6262366) (← links)
- What do QAOA energies reveal about graphs? (Q6331904) (← links)
- Budgeted Steiner Networks: Three Terminals with Equal Path Weights (Q6389388) (← links)
- Repeated Averages on Graphs (Q6398684) (← links)