<--- Back to Details
First PageDocument Content
Decision tree model / Randomized algorithm / NP / PP / P versus NP problem / Certificate / Aanderaa–Karp–Rosenberg conjecture / Communication complexity / Theoretical computer science / Applied mathematics / Computational complexity theory
Date: 2007-01-08 22:02:22
Decision tree model
Randomized algorithm
NP
PP
P versus NP problem
Certificate
Aanderaa–Karp–Rosenberg conjecture
Communication complexity
Theoretical computer science
Applied mathematics
Computational complexity theory

Add to Reading List

Source URL: www.cs.princeton.edu

Download Document from Source Website

File Size: 197,42 KB

Share Document on Facebook

Similar Documents

Graph coloring / Aanderaa–Karp–Rosenberg conjecture / Property testing / Planar graph / Clique / Graph property / Path decomposition / Line graph / Graph theory / Mathematics / Theoretical computer science

Property Testing and Its Connection to Learning and Approximation ODED GOLDREICH Weizmann Institute of Science, Rehovot, Israel SHAFI GOLDWASSER

DocID: 18X5D - View Document

Order theory / Computational complexity theory / Functional analysis / Monotonic function / Real analysis / Circuit complexity / FO / Aanderaa–Karp–Rosenberg conjecture / Galois connection / Theoretical computer science / Mathematics / Mathematical analysis

Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook Department of Computer Science University of Toronto Toronto, Canada {yuvalf, toni, robere, sacoo

DocID: 14yCi - View Document

Bipartite graph / Tree decomposition / Graph / Aanderaa–Karp–Rosenberg conjecture / Edge coloring / Graph theory / Mathematics / Clique

Monotonicity testing over general poset domains [Extended Abstract] Eldar Fischer Eric Lehman

DocID: 14bNq - View Document

Computational complexity theory / Quantum algorithm / Quantum computer / Randomized algorithm / Algorithm / Connectivity / Distributed computing / Low / Aanderaa–Karp–Rosenberg conjecture / Theoretical computer science / Applied mathematics / Mathematics

Simpler Exact Leader Election via Quantum Reduction

DocID: 13SUf - View Document

Order theory / Computational complexity theory / Functional analysis / Monotonic function / Real analysis / Circuit complexity / Aanderaa–Karp–Rosenberg conjecture / Clique problem / Mathematics / Mathematical analysis / Theoretical computer science

Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus∗∗ Toniann Pitassi∗† Robert Robere∗‡

DocID: 13GIS - View Document