Guest User

Untitled

a guest
Apr 24th, 2018
76
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.72 KB | None | 0 0
  1. documentclass[10pt]{article}
  2. usepackage{parskip,multicol,amsmath,amsfonts}
  3.  
  4. newcommand{defPP}[4]
  5. {
  6. fbox
  7. {
  8. begin{minipage}{textwidth}
  9.  
  10. #1
  11.  
  12. begin{tabular}{r l}
  13.  
  14.  
  15. textit{Instance:}& #2\
  16. textit{Parameter:}& #3\
  17. textit{Problem:}& #4
  18. end{tabular}
  19.  
  20. end{minipage}
  21. }
  22.  
  23. }
  24.  
  25. begin{document}
  26. defPP{emph{p}-textsc{Bounded-NTM-Halt}}{A deterministic TM $mathbb{M}$, $n in mathbb{N}$ in unary, $k in mathbb{N}$}{$k$}{Decide whether $mathbb{M}$ accepts the empty string at most in $n$ steps and using at most $k$ nondeterministic steps.}
  27.  
  28. To show that $p$-textsc{Bounded-NTM-Halt} $in text{W[P]}$, [...]
  29. end{document}
Add Comment
Please, Sign In to add comment