Skip to content


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
tree: 01990a641a
Fetching contributors…

Cannot retrieve contributors at this time

75 lines (62 sloc) 2.119 kb
%% poster.tex
%% Copyright 2011 Jeffrey Finkelstein
%% Except where otherwise noted, this work is made available under the terms of
%% the Creative Commons Attribution-ShareAlike 3.0 license,
%% You are free:
%% * to Share — to copy, distribute and transmit the work
%% * to Remix — to adapt the work
%% Under the following conditions:
%% * Attribution — You must attribute the work in the manner specified by
%% the author or licensor (but not in any way that suggests that they
%% endorse you or your use of the work).
%% * Share Alike — If you alter, transform, or build upon this work, you may
%% distribute the resulting work only under the same, similar or a
%% compatible license.
%% * For any reuse or distribution, you must make clear to others the
%% license terms of this work. The best way to do this is with a link to the
%% web page
%% * Any of the above conditions can be waived if you get permission from
%% the copyright holder.
%% * Nothing in this license impairs or restricts the author's moral rights.
\title{Computational complexity of the linear matching templates (LMT) problem}
\author{Jeffrey Finkelstein}
\advisor{Steve Homer}
\department{Computer Science}
%\institute{Boston University}
\theoremstyle{definition} \newtheorem*{definition}{Definition}
%% first column
\section{Problem definition}
%% second column
\section{Linear programming characterization}
\section{\NP-complete variants}
\section{Example instance}
\section{Further work}
Jump to Line
Something went wrong with that request. Please try again.