From e62db6b69cdbbe37825f060eec98f600282b4118 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Fri, 20 Mar 2015 17:03:50 -0400
Subject: Add comment on parametric functions

---
 results.tex | 6 ++++++
 1 file changed, 6 insertions(+)

(limited to 'results.tex')

diff --git a/results.tex b/results.tex
index f4cea1a..41452ad 100644
--- a/results.tex
+++ b/results.tex
@@ -272,6 +272,12 @@ By using standard concentration bounds, we can hope to obtain within $poly(n, \f
 
 \subsection{Parametric submodular functions}
 
+\textbf{Note:} all known examples of submodular functions are parametric. The
+question is not parametric vs non-parametric but whether or not the number of
+parameters is polynomial or exponential in $n$ (the size of the ground set).
+For all examples I know except martroid rank functions, it seems to be
+polynomial.
+
 \subsubsection{Influence Functions}
 
 Let $G = (V, E)$ be a weighted directed graph. Without loss of generality, we
-- 
cgit v1.2.3-70-g09d2

