Add second year
This commit is contained in:
@ -0,0 +1,499 @@
|
||||
% $ biblatex auxiliary file $
|
||||
% $ biblatex bbl format version 3.2 $
|
||||
% Do not modify the above lines!
|
||||
%
|
||||
% This is an auxiliary file used by the 'biblatex' package.
|
||||
% This file may safely be deleted. It will be recreated by
|
||||
% biber as required.
|
||||
%
|
||||
\begingroup
|
||||
\makeatletter
|
||||
\@ifundefined{ver@biblatex.sty}
|
||||
{\@latex@error
|
||||
{Missing 'biblatex' package}
|
||||
{The bibliography requires the 'biblatex' package.}
|
||||
\aftergroup\endinput}
|
||||
{}
|
||||
\endgroup
|
||||
|
||||
|
||||
\refsection{0}
|
||||
\datalist[entry]{none/global//global/global}
|
||||
\entry{slides}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=4db5fdda44d980dfd1fa3c357d9f1fe3}{%
|
||||
family={Glavin},
|
||||
familyi={G\bibinitperiod},
|
||||
given={Frank},
|
||||
giveni={F\bibinitperiod}}}%
|
||||
}
|
||||
\strng{namehash}{4db5fdda44d980dfd1fa3c357d9f1fe3}
|
||||
\strng{fullhash}{4db5fdda44d980dfd1fa3c357d9f1fe3}
|
||||
\strng{bibnamehash}{4db5fdda44d980dfd1fa3c357d9f1fe3}
|
||||
\strng{authorbibnamehash}{4db5fdda44d980dfd1fa3c357d9f1fe3}
|
||||
\strng{authornamehash}{4db5fdda44d980dfd1fa3c357d9f1fe3}
|
||||
\strng{authorfullhash}{4db5fdda44d980dfd1fa3c357d9f1fe3}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{Uploaded to Blackboard: 2023-02-17}
|
||||
\field{title}{Topic Three: Algorithm Analysis \& Dynamic Programming Part II}
|
||||
\keyw{p,np}
|
||||
\endentry
|
||||
\entry{wolfram}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=d041a125476c57c12ca53005c1fe93b1}{%
|
||||
family={Terr},
|
||||
familyi={T\bibinitperiod},
|
||||
given={David},
|
||||
giveni={D\bibinitperiod}}}%
|
||||
}
|
||||
\strng{namehash}{d041a125476c57c12ca53005c1fe93b1}
|
||||
\strng{fullhash}{d041a125476c57c12ca53005c1fe93b1}
|
||||
\strng{bibnamehash}{d041a125476c57c12ca53005c1fe93b1}
|
||||
\strng{authorbibnamehash}{d041a125476c57c12ca53005c1fe93b1}
|
||||
\strng{authornamehash}{d041a125476c57c12ca53005c1fe93b1}
|
||||
\strng{authorfullhash}{d041a125476c57c12ca53005c1fe93b1}
|
||||
\field{sortinit}{2}
|
||||
\field{sortinithash}{8b555b3791beccb63322c22f3320aa9a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{title}{Polynomial Time}
|
||||
\verb{urlraw}
|
||||
\verb https://mathworld.wolfram.com/PolynomialTime.html
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://mathworld.wolfram.com/PolynomialTime.html
|
||||
\endverb
|
||||
\keyw{p}
|
||||
\endentry
|
||||
\entry{floydnondeterm}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=6a7319445e476f9e3f352261abd48a4a}{%
|
||||
family={Floyd},
|
||||
familyi={F\bibinitperiod},
|
||||
given={Robert\bibnamedelima W.},
|
||||
giveni={R\bibinitperiod\bibinitdelim W\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Journal of the ACM}%
|
||||
}
|
||||
\strng{namehash}{6a7319445e476f9e3f352261abd48a4a}
|
||||
\strng{fullhash}{6a7319445e476f9e3f352261abd48a4a}
|
||||
\strng{bibnamehash}{6a7319445e476f9e3f352261abd48a4a}
|
||||
\strng{authorbibnamehash}{6a7319445e476f9e3f352261abd48a4a}
|
||||
\strng{authornamehash}{6a7319445e476f9e3f352261abd48a4a}
|
||||
\strng{authorfullhash}{6a7319445e476f9e3f352261abd48a4a}
|
||||
\field{sortinit}{3}
|
||||
\field{sortinithash}{ad6fe7482ffbd7b9f99c9e8b5dccd3d7}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{month}{10}
|
||||
\field{title}{Nondeterministic Algorithms}
|
||||
\field{year}{1967}
|
||||
\field{dateera}{ce}
|
||||
\verb{doi}
|
||||
\verb 10.1145/321420.321422
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{britnpcomp}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=b5b5d41e9deb4fed9ffa108254d8b7ad}{%
|
||||
family={Hosch},
|
||||
familyi={H\bibinitperiod},
|
||||
given={William\bibnamedelima L.},
|
||||
giveni={W\bibinitperiod\bibinitdelim L\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Encyclopedia Britannica}%
|
||||
}
|
||||
\strng{namehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{fullhash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{bibnamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authorbibnamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authornamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authorfullhash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\field{extraname}{1}
|
||||
\field{sortinit}{4}
|
||||
\field{sortinithash}{9381316451d1b9788675a07e972a12a7}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{day}{10}
|
||||
\field{month}{3}
|
||||
\field{title}{NP-complete problem}
|
||||
\field{year}{2023}
|
||||
\field{dateera}{ce}
|
||||
\verb{urlraw}
|
||||
\verb https://www.britannica.com/science/NP-complete-problem#ref97458
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://www.britannica.com/science/NP-complete-problem#ref97458
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{fortnow}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=e43a5724fcae7ec1838dfc44579da075}{%
|
||||
family={Fortnow},
|
||||
familyi={F\bibinitperiod},
|
||||
given={Lance},
|
||||
giveni={L\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Communications of the ACM}%
|
||||
}
|
||||
\strng{namehash}{e43a5724fcae7ec1838dfc44579da075}
|
||||
\strng{fullhash}{e43a5724fcae7ec1838dfc44579da075}
|
||||
\strng{bibnamehash}{e43a5724fcae7ec1838dfc44579da075}
|
||||
\strng{authorbibnamehash}{e43a5724fcae7ec1838dfc44579da075}
|
||||
\strng{authornamehash}{e43a5724fcae7ec1838dfc44579da075}
|
||||
\strng{authorfullhash}{e43a5724fcae7ec1838dfc44579da075}
|
||||
\field{sortinit}{5}
|
||||
\field{sortinithash}{20e9b4b0b173788c5dace24730f47d8c}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{title}{The status of the P versus NP problem}
|
||||
\field{year}{2009}
|
||||
\field{dateera}{ce}
|
||||
\verb{doi}
|
||||
\verb 10.1145/1562164.1562186
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{techopedia}{online}{}
|
||||
\list{publisher}{1}{%
|
||||
{techopedia}%
|
||||
}
|
||||
\field{sortinit}{6}
|
||||
\field{sortinithash}{b33bc299efb3c36abec520a4c896a66d}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{day}{29}
|
||||
\field{month}{8}
|
||||
\field{title}{Non-Deterministic Polynomial Time (NP)}
|
||||
\field{year}{2019}
|
||||
\field{dateera}{ce}
|
||||
\verb{urlraw}
|
||||
\verb https://www.techopedia.com/definition/21028/non-deterministic-polynomial-time-np
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://www.techopedia.com/definition/21028/non-deterministic-polynomial-time-np
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{britpvsnpproblem}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=b5b5d41e9deb4fed9ffa108254d8b7ad}{%
|
||||
family={Hosch},
|
||||
familyi={H\bibinitperiod},
|
||||
given={William\bibnamedelima L.},
|
||||
giveni={W\bibinitperiod\bibinitdelim L\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Encyclopedia Britannica}%
|
||||
}
|
||||
\strng{namehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{fullhash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{bibnamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authorbibnamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authornamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authorfullhash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\field{extraname}{2}
|
||||
\field{sortinit}{9}
|
||||
\field{sortinithash}{0a5ebc79d83c96b6579069544c73c7d4}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{day}{22}
|
||||
\field{month}{2}
|
||||
\field{title}{P versus NP problem}
|
||||
\field{year}{2023}
|
||||
\field{dateera}{ce}
|
||||
\verb{urlraw}
|
||||
\verb https://www.britannica.com/science/P-versus-NP-problem
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://www.britannica.com/science/P-versus-NP-problem
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{salesman}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=d29e15a1eaae3938b743eb055c894692}{%
|
||||
family={Carlson},
|
||||
familyi={C\bibinitperiod},
|
||||
given={Stephan\bibnamedelima C.},
|
||||
giveni={S\bibinitperiod\bibinitdelim C\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Encyclopedia Britannica}%
|
||||
}
|
||||
\strng{namehash}{d29e15a1eaae3938b743eb055c894692}
|
||||
\strng{fullhash}{d29e15a1eaae3938b743eb055c894692}
|
||||
\strng{bibnamehash}{d29e15a1eaae3938b743eb055c894692}
|
||||
\strng{authorbibnamehash}{d29e15a1eaae3938b743eb055c894692}
|
||||
\strng{authornamehash}{d29e15a1eaae3938b743eb055c894692}
|
||||
\strng{authorfullhash}{d29e15a1eaae3938b743eb055c894692}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{day}{5}
|
||||
\field{month}{2}
|
||||
\field{title}{Travelling salesman Problem}
|
||||
\field{year}{2023}
|
||||
\field{dateera}{ce}
|
||||
\verb{urlraw}
|
||||
\verb https://www.britannica.com/science/traveling-salesman-problem
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://www.britannica.com/science/traveling-salesman-problem
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{wolframnphard}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=819197bfeff32a3f58d49b2a3eb0a580}{%
|
||||
family={Weisstein},
|
||||
familyi={W\bibinitperiod},
|
||||
given={Eric\bibnamedelima W.},
|
||||
giveni={E\bibinitperiod\bibinitdelim W\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{MathWorld = A Wolfram Web Resource}%
|
||||
}
|
||||
\strng{namehash}{819197bfeff32a3f58d49b2a3eb0a580}
|
||||
\strng{fullhash}{819197bfeff32a3f58d49b2a3eb0a580}
|
||||
\strng{bibnamehash}{819197bfeff32a3f58d49b2a3eb0a580}
|
||||
\strng{authorbibnamehash}{819197bfeff32a3f58d49b2a3eb0a580}
|
||||
\strng{authornamehash}{819197bfeff32a3f58d49b2a3eb0a580}
|
||||
\strng{authorfullhash}{819197bfeff32a3f58d49b2a3eb0a580}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{title}{NP-Hard Problem}
|
||||
\verb{urlraw}
|
||||
\verb https://mathworld.wolfram.com/NP-HardProblem.html
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://mathworld.wolfram.com/NP-HardProblem.html
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{interact}{book}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=d7582c31fe3061838883debf5d237536}{%
|
||||
family={Johnson},
|
||||
familyi={J\bibinitperiod},
|
||||
given={Michael\bibnamedelimb R.\bibnamedelimi Garey\bibnamedelimb \& David\bibnamedelima S.},
|
||||
giveni={M\bibinitperiod\bibinitdelim R\bibinitperiod\bibinitdelim G\bibinitperiod\bibinitdelim \\bibinitperiod\bibinitdelim D\bibinitperiod\bibinitdelim S\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{W.H. Freeman}%
|
||||
}
|
||||
\strng{namehash}{d7582c31fe3061838883debf5d237536}
|
||||
\strng{fullhash}{d7582c31fe3061838883debf5d237536}
|
||||
\strng{bibnamehash}{d7582c31fe3061838883debf5d237536}
|
||||
\strng{authorbibnamehash}{d7582c31fe3061838883debf5d237536}
|
||||
\strng{authornamehash}{d7582c31fe3061838883debf5d237536}
|
||||
\strng{authorfullhash}{d7582c31fe3061838883debf5d237536}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{isbn}{0-7167-1045-5}
|
||||
\field{title}{Computers \& Intractability: A Guide to the Theory of NP-Completeness}
|
||||
\field{year}{1979}
|
||||
\field{dateera}{ce}
|
||||
\endentry
|
||||
\entry{halting}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=38ba3b8c5a650c291517635c39277196}{%
|
||||
family={al.},
|
||||
familyi={a\bibinitperiod},
|
||||
given={Karleigh\bibnamedelima Moore},
|
||||
giveni={K\bibinitperiod\bibinitdelim M\bibinitperiod},
|
||||
prefix={et},
|
||||
prefixi={e\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Brilliant}%
|
||||
}
|
||||
\strng{namehash}{38ba3b8c5a650c291517635c39277196}
|
||||
\strng{fullhash}{38ba3b8c5a650c291517635c39277196}
|
||||
\strng{bibnamehash}{38ba3b8c5a650c291517635c39277196}
|
||||
\strng{authorbibnamehash}{38ba3b8c5a650c291517635c39277196}
|
||||
\strng{authornamehash}{38ba3b8c5a650c291517635c39277196}
|
||||
\strng{authorfullhash}{38ba3b8c5a650c291517635c39277196}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{title}{Halting Problem}
|
||||
\verb{urlraw}
|
||||
\verb https://brilliant.org/wiki/halting-problem/
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://brilliant.org/wiki/halting-problem/
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{npcompbrit}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=db058bcb62506fba9fe25e53a62e1e0f}{%
|
||||
family={Gregersen},
|
||||
familyi={G\bibinitperiod},
|
||||
given={Erik},
|
||||
giveni={E\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Encyclopedia Britannica}%
|
||||
}
|
||||
\strng{namehash}{db058bcb62506fba9fe25e53a62e1e0f}
|
||||
\strng{fullhash}{db058bcb62506fba9fe25e53a62e1e0f}
|
||||
\strng{bibnamehash}{db058bcb62506fba9fe25e53a62e1e0f}
|
||||
\strng{authorbibnamehash}{db058bcb62506fba9fe25e53a62e1e0f}
|
||||
\strng{authornamehash}{db058bcb62506fba9fe25e53a62e1e0f}
|
||||
\strng{authorfullhash}{db058bcb62506fba9fe25e53a62e1e0f}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-12)}
|
||||
\field{day}{10}
|
||||
\field{month}{3}
|
||||
\field{title}{NP-Complete Problem}
|
||||
\field{year}{2023}
|
||||
\field{dateera}{ce}
|
||||
\verb{urlraw}
|
||||
\verb https://www.britannica.com/science/traveling-salesman-problem
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://www.britannica.com/science/traveling-salesman-problem
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{cook}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=6d0042ba6060405425561c0184e8ece1}{%
|
||||
family={Cook},
|
||||
familyi={C\bibinitperiod},
|
||||
given={Stephen},
|
||||
giveni={S\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Proceedings of the Third Annual ACM Symposium on Theory of Computing}%
|
||||
}
|
||||
\strng{namehash}{6d0042ba6060405425561c0184e8ece1}
|
||||
\strng{fullhash}{6d0042ba6060405425561c0184e8ece1}
|
||||
\strng{bibnamehash}{6d0042ba6060405425561c0184e8ece1}
|
||||
\strng{authorbibnamehash}{6d0042ba6060405425561c0184e8ece1}
|
||||
\strng{authornamehash}{6d0042ba6060405425561c0184e8ece1}
|
||||
\strng{authorfullhash}{6d0042ba6060405425561c0184e8ece1}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{title}{The complexity of theorem-proving procedures}
|
||||
\field{year}{1971}
|
||||
\field{dateera}{ce}
|
||||
\verb{doi}
|
||||
\verb 10.1145/800157.805047
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{pvsnpbrit}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=b5b5d41e9deb4fed9ffa108254d8b7ad}{%
|
||||
family={Hosch},
|
||||
familyi={H\bibinitperiod},
|
||||
given={William\bibnamedelima L.},
|
||||
giveni={W\bibinitperiod\bibinitdelim L\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Encyclopedia Britannica}%
|
||||
}
|
||||
\strng{namehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{fullhash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{bibnamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authorbibnamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authornamehash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\strng{authorfullhash}{b5b5d41e9deb4fed9ffa108254d8b7ad}
|
||||
\field{extraname}{3}
|
||||
\field{sortinit}{1}
|
||||
\field{sortinithash}{4f6aaa89bab872aa0999fec09ff8e98a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{addendum}{(Accessed: 2023-03-03)}
|
||||
\field{day}{22}
|
||||
\field{month}{2}
|
||||
\field{title}{P versus NP problem}
|
||||
\field{year}{2023}
|
||||
\field{dateera}{ce}
|
||||
\verb{urlraw}
|
||||
\verb https://www.britannica.com/science/P-versus-NP-problem
|
||||
\endverb
|
||||
\verb{url}
|
||||
\verb https://www.britannica.com/science/P-versus-NP-problem
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{poll}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=888d7977ce776bc206a593c5821bea9f}{%
|
||||
family={Gasarch},
|
||||
familyi={G\bibinitperiod},
|
||||
given={William\bibnamedelima I.},
|
||||
giveni={W\bibinitperiod\bibinitdelim I\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{SIGACT News}%
|
||||
}
|
||||
\strng{namehash}{888d7977ce776bc206a593c5821bea9f}
|
||||
\strng{fullhash}{888d7977ce776bc206a593c5821bea9f}
|
||||
\strng{bibnamehash}{888d7977ce776bc206a593c5821bea9f}
|
||||
\strng{authorbibnamehash}{888d7977ce776bc206a593c5821bea9f}
|
||||
\strng{authornamehash}{888d7977ce776bc206a593c5821bea9f}
|
||||
\strng{authorfullhash}{888d7977ce776bc206a593c5821bea9f}
|
||||
\field{sortinit}{2}
|
||||
\field{sortinithash}{8b555b3791beccb63322c22f3320aa9a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{month}{6}
|
||||
\field{title}{The P=?NP poll}
|
||||
\field{year}{2002}
|
||||
\field{dateera}{ce}
|
||||
\verb{doi}
|
||||
\verb 10.1145/564585.564599
|
||||
\endverb
|
||||
\endentry
|
||||
\entry{sipser}{online}{}
|
||||
\name{author}{1}{}{%
|
||||
{{hash=13b9c16a9de2bb891eb8aa2a768eb2a8}{%
|
||||
family={Sipser},
|
||||
familyi={S\bibinitperiod},
|
||||
given={Michael},
|
||||
giveni={M\bibinitperiod}}}%
|
||||
}
|
||||
\list{publisher}{1}{%
|
||||
{Proceedings of the twenty-fourth annual ACM Symposium on Theory of Computing}%
|
||||
}
|
||||
\strng{namehash}{13b9c16a9de2bb891eb8aa2a768eb2a8}
|
||||
\strng{fullhash}{13b9c16a9de2bb891eb8aa2a768eb2a8}
|
||||
\strng{bibnamehash}{13b9c16a9de2bb891eb8aa2a768eb2a8}
|
||||
\strng{authorbibnamehash}{13b9c16a9de2bb891eb8aa2a768eb2a8}
|
||||
\strng{authornamehash}{13b9c16a9de2bb891eb8aa2a768eb2a8}
|
||||
\strng{authorfullhash}{13b9c16a9de2bb891eb8aa2a768eb2a8}
|
||||
\field{sortinit}{2}
|
||||
\field{sortinithash}{8b555b3791beccb63322c22f3320aa9a}
|
||||
\field{labelnamesource}{author}
|
||||
\field{labeltitlesource}{title}
|
||||
\field{month}{7}
|
||||
\field{title}{The history \& status of the P versus NP question}
|
||||
\field{year}{1992}
|
||||
\field{dateera}{ce}
|
||||
\verb{doi}
|
||||
\verb 10.1145/129712.129771
|
||||
\endverb
|
||||
\endentry
|
||||
\enddatalist
|
||||
\endrefsection
|
||||
\endinput
|
||||
|
||||
@ -0,0 +1,86 @@
|
||||
<?xml version="1.0" standalone="yes"?>
|
||||
<!-- logreq request file -->
|
||||
<!-- logreq version 1.0 / dtd version 1.0 -->
|
||||
<!-- Do not edit this file! -->
|
||||
<!DOCTYPE requests [
|
||||
<!ELEMENT requests (internal | external)*>
|
||||
<!ELEMENT internal (generic, (provides | requires)*)>
|
||||
<!ELEMENT external (generic, cmdline?, input?, output?, (provides | requires)*)>
|
||||
<!ELEMENT cmdline (binary, (option | infile | outfile)*)>
|
||||
<!ELEMENT input (file)+>
|
||||
<!ELEMENT output (file)+>
|
||||
<!ELEMENT provides (file)+>
|
||||
<!ELEMENT requires (file)+>
|
||||
<!ELEMENT generic (#PCDATA)>
|
||||
<!ELEMENT binary (#PCDATA)>
|
||||
<!ELEMENT option (#PCDATA)>
|
||||
<!ELEMENT infile (#PCDATA)>
|
||||
<!ELEMENT outfile (#PCDATA)>
|
||||
<!ELEMENT file (#PCDATA)>
|
||||
<!ATTLIST requests
|
||||
version CDATA #REQUIRED
|
||||
>
|
||||
<!ATTLIST internal
|
||||
package CDATA #REQUIRED
|
||||
priority (9) #REQUIRED
|
||||
active (0 | 1) #REQUIRED
|
||||
>
|
||||
<!ATTLIST external
|
||||
package CDATA #REQUIRED
|
||||
priority (1 | 2 | 3 | 4 | 5 | 6 | 7 | 8) #REQUIRED
|
||||
active (0 | 1) #REQUIRED
|
||||
>
|
||||
<!ATTLIST provides
|
||||
type (static | dynamic | editable) #REQUIRED
|
||||
>
|
||||
<!ATTLIST requires
|
||||
type (static | dynamic | editable) #REQUIRED
|
||||
>
|
||||
<!ATTLIST file
|
||||
type CDATA #IMPLIED
|
||||
>
|
||||
]>
|
||||
<requests version="1.0">
|
||||
<internal package="biblatex" priority="9" active="0">
|
||||
<generic>latex</generic>
|
||||
<provides type="dynamic">
|
||||
<file>CT2109-Assignment-04.bcf</file>
|
||||
</provides>
|
||||
<requires type="dynamic">
|
||||
<file>CT2109-Assignment-04.bbl</file>
|
||||
</requires>
|
||||
<requires type="static">
|
||||
<file>blx-dm.def</file>
|
||||
<file>blx-compat.def</file>
|
||||
<file>biblatex.def</file>
|
||||
<file>standard.bbx</file>
|
||||
<file>numeric.bbx</file>
|
||||
<file>numeric-comp.bbx</file>
|
||||
<file>numeric-comp.cbx</file>
|
||||
<file>biblatex.cfg</file>
|
||||
<file>english.lbx</file>
|
||||
</requires>
|
||||
</internal>
|
||||
<external package="biblatex" priority="5" active="0">
|
||||
<generic>biber</generic>
|
||||
<cmdline>
|
||||
<binary>biber</binary>
|
||||
<infile>CT2109-Assignment-04</infile>
|
||||
</cmdline>
|
||||
<input>
|
||||
<file>CT2109-Assignment-04.bcf</file>
|
||||
</input>
|
||||
<output>
|
||||
<file>CT2109-Assignment-04.bbl</file>
|
||||
</output>
|
||||
<provides type="dynamic">
|
||||
<file>CT2109-Assignment-04.bbl</file>
|
||||
</provides>
|
||||
<requires type="dynamic">
|
||||
<file>CT2109-Assignment-04.bcf</file>
|
||||
</requires>
|
||||
<requires type="editable">
|
||||
<file>references.bib</file>
|
||||
</requires>
|
||||
</external>
|
||||
</requests>
|
||||
@ -0,0 +1,5 @@
|
||||
[0] Config.pm:306> INFO - This is Biber 2.18
|
||||
[0] Config.pm:309> INFO - Logfile is 'CT2109-Assignment-04.tex.blg'
|
||||
[47] biber:340> INFO - === Tue Mar 14, 2023, 17:38:31
|
||||
[138] Utils.pm:410> ERROR - Cannot find 'CT2109-Assignment-04.tex.bcf'!
|
||||
[138] Biber.pm:135> INFO - ERRORS: 1
|
||||
@ -0,0 +1,46 @@
|
||||
\addtolength{\hoffset}{-2.25cm}
|
||||
\addtolength{\textwidth}{4.5cm}
|
||||
\addtolength{\voffset}{-3.25cm}
|
||||
\addtolength{\textheight}{5cm}
|
||||
\setlength{\parskip}{0pt}
|
||||
\setlength{\parindent}{0in}
|
||||
|
||||
%----------------------------------------------------------------------------------------
|
||||
% PACKAGES AND OTHER DOCUMENT CONFIGURATIONS
|
||||
%----------------------------------------------------------------------------------------
|
||||
|
||||
\usepackage{blindtext} % Package to generate dummy text
|
||||
\usepackage{charter} % Use the Charter font
|
||||
\usepackage[utf8]{inputenc} % Use UTF-8 encoding
|
||||
\usepackage{microtype} % Slightly tweak font spacing for aesthetics
|
||||
\usepackage[english]{babel} % Language hyphenation and typographical rules
|
||||
\usepackage{amsthm, amsmath, amssymb} % Mathematical typesetting
|
||||
\usepackage{float} % Improved interface for floating objects
|
||||
\usepackage[final, colorlinks = true,
|
||||
linkcolor = black,
|
||||
citecolor = black]{hyperref} % For hyperlinks in the PDF
|
||||
\usepackage{graphicx, multicol} % Enhanced support for graphics
|
||||
\usepackage{xcolor} % Driver-independent color extensions
|
||||
\usepackage{marvosym, wasysym} % More symbols
|
||||
\usepackage{rotating} % Rotation tools
|
||||
\usepackage{censor} % Facilities for controlling restricted text
|
||||
\usepackage{listings, style/lstlisting} % Environment for non-formatted code, !uses style file!
|
||||
\usepackage{pseudocode} % Environment for specifying algorithms in a natural way
|
||||
\usepackage{style/avm} % Environment for f-structures, !uses style file!
|
||||
\usepackage{booktabs} % Enhances quality of tables
|
||||
\usepackage{tikz-qtree} % Easy tree drawing tool
|
||||
\tikzset{every tree node/.style={align=center,anchor=north},
|
||||
level distance=2cm} % Configuration for q-trees
|
||||
\usepackage{style/btree} % Configuration for b-trees and b+-trees, !uses style file!
|
||||
\usepackage{csquotes} % Context sensitive quotation facilities
|
||||
\usepackage[yyyymmdd]{datetime} % Uses YEAR-MONTH-DAY format for dates
|
||||
\renewcommand{\dateseparator}{-} % Sets dateseparator to '-'
|
||||
\usepackage{fancyhdr} % Headers and footers
|
||||
\pagestyle{fancy} % All pages have headers and footers
|
||||
\fancyhead{}\renewcommand{\headrulewidth}{0pt} % Blank out the default header
|
||||
\fancyfoot[L]{} % Custom footer text
|
||||
\fancyfoot[C]{} % Custom footer text
|
||||
\fancyfoot[R]{\thepage} % Custom footer text
|
||||
\newcommand{\note}[1]{\marginpar{\scriptsize \textcolor{red}{#1}}} % Enables comments in red on margin
|
||||
|
||||
%----------------------------------------------------------------------------------------
|
||||
@ -0,0 +1,116 @@
|
||||
@online{wolframnphard,
|
||||
author = "Eric W. Weisstein",
|
||||
title = "NP-Hard Problem",
|
||||
publisher = "MathWorld = A Wolfram Web Resource",
|
||||
url = "https://mathworld.wolfram.com/NP-HardProblem.html",
|
||||
addendum = "(Accessed: 2023-03-03)"
|
||||
}
|
||||
@online{wolfram,
|
||||
author = "David Terr",
|
||||
title = "Polynomial Time",
|
||||
url = "https://mathworld.wolfram.com/PolynomialTime.html",
|
||||
addendum = "(Accessed: 2023-03-03)",
|
||||
keywords = "p"
|
||||
}
|
||||
@online{slides,
|
||||
author = "Frank Glavin",
|
||||
title = "Topic Three: Algorithm Analysis \& Dynamic Programming Part II",
|
||||
addendum = "Uploaded to Blackboard: 2023-02-17",
|
||||
keywords = "p,np,"
|
||||
}
|
||||
@online{floydnondeterm,
|
||||
author = "Robert W. Floyd",
|
||||
title = "Nondeterministic Algorithms",
|
||||
publisher = "Journal of the ACM",
|
||||
date = "1967-10",
|
||||
doi = "10.1145/321420.321422"
|
||||
}
|
||||
@online{britnpcomp,
|
||||
author = "William L. Hosch",
|
||||
title = "NP-complete problem",
|
||||
publisher = "Encyclopedia Britannica",
|
||||
date = "2023-03-10",
|
||||
url = "https://www.britannica.com/science/NP-complete-problem#ref97458",
|
||||
addendum="(Accessed: 2023-03-03)"
|
||||
}
|
||||
@online{techopedia,
|
||||
title = "Non-Deterministic Polynomial Time (NP)",
|
||||
publisher = "techopedia",
|
||||
date = "2019-08-29",
|
||||
url = "https://www.techopedia.com/definition/21028/non-deterministic-polynomial-time-np",
|
||||
addendum="(Accessed: 2023-03-03)"
|
||||
}
|
||||
@online{fortnow,
|
||||
author = "Lance Fortnow",
|
||||
title = "The status of the P versus NP problem",
|
||||
publisher = "Communications of the ACM",
|
||||
date = "2009",
|
||||
doi = " 10.1145/1562164.1562186"
|
||||
}
|
||||
@online{britpvsnpproblem,
|
||||
author = "William L. Hosch",
|
||||
title = "P versus NP problem",
|
||||
publisher = "Encyclopedia Britannica",
|
||||
date = "2023-02-22",
|
||||
url = "https://www.britannica.com/science/P-versus-NP-problem",
|
||||
addendum="(Accessed: 2023-03-03)"
|
||||
}
|
||||
@online{salesman,
|
||||
author = "Stephan C. Carlson",
|
||||
title = "Travelling salesman Problem",
|
||||
publisher = "Encyclopedia Britannica",
|
||||
date = "2023-02-05",
|
||||
url = "https://www.britannica.com/science/traveling-salesman-problem",
|
||||
addendum="(Accessed: 2023-03-03)"
|
||||
}
|
||||
@book{interact,
|
||||
author = "Michael R. Garey \& David S. Johnson",
|
||||
title = "Computers \& Intractability: A Guide to the Theory of NP-Completeness",
|
||||
publisher = "W.H. Freeman",
|
||||
date = "1979",
|
||||
isbn = "0-7167-1045-5"
|
||||
}
|
||||
@online{halting,
|
||||
author = "Karleigh Moore et al.",
|
||||
title = "Halting Problem",
|
||||
publisher = "Brilliant",
|
||||
url = "https://brilliant.org/wiki/halting-problem/",
|
||||
addendum="(Accessed: 2023-03-03)"
|
||||
}
|
||||
@online{npcompbrit,
|
||||
author = "Erik Gregersen",
|
||||
title = "NP-Complete Problem",
|
||||
publisher = "Encyclopedia Britannica",
|
||||
date = "2023-03-10",
|
||||
url = "https://www.britannica.com/science/traveling-salesman-problem",
|
||||
addendum="(Accessed: 2023-03-12)"
|
||||
}
|
||||
@online{cook,
|
||||
author = "Stephen Cook",
|
||||
title = "The complexity of theorem-proving procedures",
|
||||
publisher = "Proceedings of the Third Annual ACM Symposium on Theory of Computing",
|
||||
date = "1971",
|
||||
doi = "10.1145/800157.805047"
|
||||
}
|
||||
@online{pvsnpbrit,
|
||||
author = "William L. Hosch",
|
||||
title = "P versus NP problem",
|
||||
publisher = "Encyclopedia Britannica",
|
||||
date = "2023-02-22",
|
||||
url = "https://www.britannica.com/science/P-versus-NP-problem",
|
||||
addendum="(Accessed: 2023-03-03)"
|
||||
}
|
||||
@online{poll,
|
||||
author = "William I. Gasarch",
|
||||
title = "The P=?NP poll",
|
||||
publisher = "SIGACT News",
|
||||
date = "2002-06",
|
||||
doi = "10.1145/564585.564599"
|
||||
}
|
||||
@online{sipser,
|
||||
author = "Michael Sipser",
|
||||
title = "The history \& status of the P versus NP question",
|
||||
publisher = "Proceedings of the twenty-fourth annual ACM Symposium on Theory of Computing",
|
||||
date = "1992-07",
|
||||
doi = "10.1145/129712.129771"
|
||||
}
|
||||
@ -0,0 +1,5 @@
|
||||
[0] Config.pm:306> INFO - This is Biber 2.18
|
||||
[0] Config.pm:309> INFO - Logfile is 'references.bib.blg'
|
||||
[47] biber:340> INFO - === Tue Mar 14, 2023, 17:38:23
|
||||
[129] Utils.pm:410> ERROR - Cannot find 'references.bib.bcf'!
|
||||
[129] Biber.pm:135> INFO - ERRORS: 1
|
||||
@ -0,0 +1,165 @@
|
||||
% avm.sty -- for attribute-value matrices -- mar 29, 1992; rev. dec 6, 1993
|
||||
% (c) 1992 christopher manning (manning@csli.stanford.edu) -- see avm.doc.tex
|
||||
|
||||
\newif\ifavmactive\newif\ifavmsorted\newif\ifavmlabeled
|
||||
\newif\ifavmcenter\newif\ifavmbottom
|
||||
\newif\ifavmbottomright\newif\ifavmtopleft\newif\ifavmtopright
|
||||
|
||||
\newdimen\avmdimen
|
||||
\newbox\avmboxone\newbox\avmboxthree
|
||||
|
||||
\def\avmoptions#1{\avmactivefalse\avmsortedfalse\avmlabeledfalse
|
||||
\avmcenterfalse\avmbottomfalse
|
||||
\avmbottomrightfalse\avmtopleftfalse\avmtoprightfalse
|
||||
\def\more{#1}\ifx\more\empty\else\avmjoptions#1,\@nil\fi}
|
||||
\def\avmjoptions#1,#2\@nil{\def\more{#2}\csname avm#1true\endcsname
|
||||
\ifx\more\empty\else\avmjoptions#2\@nil\fi}
|
||||
|
||||
|
||||
\def\avmfont#1{\def\avmjfont{#1}}
|
||||
\def\avmjfont{}
|
||||
|
||||
\def\avmvalfont#1{\def\avmjvalfont{#1}}
|
||||
\def\avmjvalfont{}
|
||||
|
||||
\def\avmsortfont#1{\def\avmjsortfont{#1}}
|
||||
\def\avmjsortfont{}
|
||||
|
||||
\def\avmhskip#1{\def\avmjhskip{#1}}
|
||||
\def\avmjhskip{1em}
|
||||
|
||||
\def\avmbskip#1{\def\avmjbskip{#1}}
|
||||
\def\avmjbskip{0em}
|
||||
|
||||
\def\avmvskip#1{\def\avmjvskip{#1}}
|
||||
\def\avmjvskip{0.385ex}%was .3875
|
||||
|
||||
|
||||
\def\avmjprolog#1{$\mskip-\thinmuskip
|
||||
\left#1\hskip\avmjbskip\vcenter\bgroup\vskip\avmjvskip
|
||||
\ialign\bgroup\avmjfont
|
||||
\strut ##\unskip\hfil
|
||||
&&\hskip\avmjhskip\avmjvalfont ##\unskip\hfil\cr}
|
||||
\def\avmjpostlog#1{\crcr\egroup\vskip\avmjvskip\egroup
|
||||
\hskip\avmjbskip\right#1\mskip-\thinmuskip$\ignorespaces}
|
||||
|
||||
|
||||
\def\avmjcatcode{\let\lparen=(\let\rparen=)\catcode`\[=13\catcode`\]=13
|
||||
\catcode`\<=13\catcode`\@=13\catcode`\(=13\catcode`\)=13
|
||||
\catcode`\>=13\catcode`\|=13}
|
||||
|
||||
{\avmjcatcode % new group: redefine above catcodes as active
|
||||
|
||||
\gdef\specialavm{\avmjcatcode
|
||||
\def({\avmjprolog\lparen}%
|
||||
\def){\avmjpostlog\rparen}%
|
||||
\def<{\avmjprolog\langle}%
|
||||
\def>{\avmjpostlog\rangle}%
|
||||
\ifavmsorted
|
||||
\def[##1{\setbox\avmboxthree=\hbox{\avmjsortfont##1\/}\setbox2=\hbox
|
||||
\bgroup\avmjprolog\lbrack}%
|
||||
\def]{\avmjpostlog\rbrack\egroup\avmjsort}%
|
||||
\else\ifavmlabeled
|
||||
\def[##1{\def\more{##1}\setbox2=\hbox\bgroup\avmjprolog[}%
|
||||
\def]{\avmjpostlog]\egroup\node{\more}{\box2}}%
|
||||
\else
|
||||
\def[{\avmjprolog\lbrack}%
|
||||
\def]{\avmjpostlog\rbrack}%
|
||||
\fi\fi
|
||||
%
|
||||
\def\<{$\langle$}\def\>{$\rangle$}%
|
||||
\def\({\lparen}\def\){\rparen}%
|
||||
\def\[{\lbrack}\def\]{\rbrack}%
|
||||
\def|{$\,\vert\,$}%
|
||||
\def@##1{\avmbox{##1}}%
|
||||
} % end defn of \specialavm
|
||||
} % restore active catcodes
|
||||
|
||||
|
||||
\long\def\avm{\begingroup
|
||||
\ifavmactive\specialavm
|
||||
\else
|
||||
\def\({\avmjprolog(}%
|
||||
\def\){\avmjpostlog)}%
|
||||
\def\<{\avmjprolog\langle}%
|
||||
\def\>{\avmjpostlog\rangle}%
|
||||
%
|
||||
\ifavmsorted
|
||||
\def\[##1{\setbox\avmboxthree=\hbox{\avmjsortfont##1\/}\setbox
|
||||
2=\hbox\bgroup\avmjprolog[}%
|
||||
\def\]{\avmjpostlog]\egroup\avmjsort}%
|
||||
\else\ifavmlabeled
|
||||
\def\[##1{\def\more{##1}\setbox2=\hbox\bgroup\avmjprolog[}%
|
||||
\def\]{\avmjpostlog]\egroup\node{\more}{\box2}}%
|
||||
\else
|
||||
\def\[{\avmjprolog[}%
|
||||
\def\]{\avmjpostlog]}%
|
||||
\fi\fi
|
||||
%
|
||||
\def\|{$\,\vert\,$}%
|
||||
\def\@##1{\avmbox{##1}}%
|
||||
\fi % end not active
|
||||
%
|
||||
\ifx\LaTeX\undefined\def\\{\cr}% running under TeX
|
||||
\else \def\\{\@tabularcr}% Leverage off LaTeX's \\*[dimen] options
|
||||
\fi
|
||||
\def\!{\node}%
|
||||
\long\def\avmjsort{\dimen2=\ht2\advance\dimen2 by -.25\baselineskip
|
||||
\global\dimen\avmdimen=\wd\avmboxthree
|
||||
\ifavmtopleft \raise\dimen2\llap{\box\avmboxthree}\box2%
|
||||
\else\ifavmtopright \box2\raise\dimen2\box\avmboxthree%
|
||||
\else\ifavmbottomright \box2\lower\dimen2\box\avmboxthree%
|
||||
\else \lower\dimen2\llap{\box\avmboxthree}\box2%
|
||||
\fi\fi\fi}%
|
||||
\long\def\sort##1##2{\setbox2=\hbox{##2}\setbox
|
||||
\avmboxthree=\hbox{\avmjsortfont##1\/}\dimen2=\ht2
|
||||
\advance\dimen2 by -.25\baselineskip
|
||||
\ifavmtopleft \raise\dimen2\box\avmboxthree\box2%
|
||||
\else\ifavmtopright \box2\raise\dimen2\box\avmboxthree%
|
||||
\else\ifavmbottomright \box2\lower\dimen2\box\avmboxthree%
|
||||
\else \lower\dimen2\box\avmboxthree\box2%
|
||||
\fi\fi\fi}%
|
||||
\long\def\osort##1##2{\setbox2=\hbox{##2}\setbox
|
||||
\avmboxthree=\hbox{\avmjsortfont ##1\/}\avmjsort}%
|
||||
\def\avml{\avmjprolog.}%
|
||||
\def\avmr{\avmjpostlog.}%
|
||||
\def\avmb##1{\node{##1}{\lbrack\;\rbrack}}%
|
||||
\def\avmd##1{\node{##1}{---}}%
|
||||
\def\q##1{\ifx ##1\{$\lbrace$\else
|
||||
\ifx ##1\}$\rbrace$\else
|
||||
\ifx ##1<$\langle$\else
|
||||
\ifx ##1>$\rangle$\fi \fi \fi \fi}%
|
||||
\def\{{\avmjprolog\lbrace}%
|
||||
\def\}{\avmjpostlog\rbrace}%
|
||||
\def\;{\hskip\avmjhskip}%
|
||||
\def\avmspan##1{\multispan2\strut ##1\expandafter\hfil}%
|
||||
\avmjfont
|
||||
\openup\avmjvskip
|
||||
\setbox\avmboxone=\hbox\bgroup\ignorespaces
|
||||
} % end defn of \avm
|
||||
|
||||
|
||||
\def\endavm{\egroup\ifvmode\leavevmode\fi % this if is useful!
|
||||
\ifavmsorted\null\hskip\dimen\avmdimen\fi
|
||||
\ifavmcenter
|
||||
\box\avmboxone
|
||||
\else \ifavmbottom
|
||||
\lower.575\baselineskip\hbox{\vbox{\box\avmboxone\null}}%
|
||||
\else
|
||||
% the next bit is ripped off from Emma's \evnup in lingmacros.sty
|
||||
\dimen2=\ht\avmboxone\advance\dimen2 by -.725\baselineskip
|
||||
\lower\dimen2\box\avmboxone
|
||||
\fi \fi \endgroup}
|
||||
|
||||
|
||||
% based on TeXbook exercise 21.3
|
||||
\def\avmbox#1{\setbox2=\hbox{$\scriptstyle #1$}\lower.2ex\vbox{\hrule
|
||||
\hbox{\vrule\kern1.25pt
|
||||
\vbox{\kern1.25pt\box2\kern1.25pt}\kern1.25pt\vrule}\hrule}}
|
||||
|
||||
% ============ COSTOM CONFIGURATION =============
|
||||
\avmfont{\sc}
|
||||
\avmoptions{sorted,active}
|
||||
\avmvalfont{\rm}
|
||||
\avmsortfont{\scriptsize\it}
|
||||
% ===============================================
|
||||
@ -0,0 +1,131 @@
|
||||
%% Last Modified: Thu Oct 18 18:26:25 2007.
|
||||
|
||||
\NeedsTeXFormat{LaTeX2e}
|
||||
\ProvidesPackage{style/btree}
|
||||
\typeout{Document Style `weiw_BTree - Support drawing B+-Tree (ver 0.999)}
|
||||
|
||||
\RequirePackage{tikz}
|
||||
\RequirePackage{ifthen}
|
||||
|
||||
% use libraries
|
||||
\usetikzlibrary{arrows,shapes,decorations,matrix}
|
||||
|
||||
|
||||
%% global declaration
|
||||
\tikzstyle{btreeptr} = [draw, semithick, minimum height=2em]
|
||||
\tikzstyle{btreeval} = [draw, semithick, minimum size=2em]
|
||||
\tikzstyle{btreevale} = [draw,semithick, minimum size=2em]
|
||||
\tikzstyle{btlink} = [draw, semithick, ->, >=triangle 45]
|
||||
|
||||
%% macro
|
||||
%% helper macros
|
||||
\newcommand{\suppressemptystr}[1]{% leave blank for entries in leaf nodes
|
||||
\ifthenelse{\equal{#1}{}}%
|
||||
{%
|
||||
\relax%
|
||||
}%
|
||||
% Else
|
||||
{%
|
||||
#1\textsuperscript{*}%
|
||||
}%
|
||||
}%
|
||||
|
||||
\newcommand{\xyshift}[3]{% help to place the nodes
|
||||
\begin{scope}[xshift=#1, yshift=#2]
|
||||
#3
|
||||
\end{scope}%
|
||||
}
|
||||
|
||||
%% Common btree macros
|
||||
\newcommand{\btreelink}[2]{% #1: src node; #2: dest node;
|
||||
\draw[btlink] ([yshift=3pt] #1.south) -- (#2-b.north);
|
||||
}
|
||||
|
||||
\newcommand{\btreelinknorth}[2]{% #1: src node; #2: dest node;
|
||||
\draw[btlink] ([yshift=3pt] #1.south) -- (#2.north);
|
||||
}
|
||||
|
||||
\newcommand{\btreetriangle}[2]{% #1: node name; #2 text inside
|
||||
\node[anchor=north, regular polygon, regular polygon sides=3, draw] (#1) {#2};
|
||||
}
|
||||
|
||||
%%======================================================================
|
||||
%% btree with capacity = 4
|
||||
\newcommand{\btreeinodefour}[5]{%
|
||||
\matrix [ampersand replacement=\&] (#1)
|
||||
{
|
||||
\node[btreeptr] (#1-1) {\vphantom{1}}; \& \node[btreeval] (#1-a) {#2}; \&
|
||||
\node[btreeptr] (#1-2) {\vphantom{1}}; \& \node[btreeval] (#1-b) {#3}; \&
|
||||
\node[btreeptr] (#1-3) {\vphantom{1}}; \& \node[btreeval] (#1-c) {#4}; \&
|
||||
\node[btreeptr] (#1-4) {\vphantom{1}}; \& \node[btreeval] (#1-d) {#5}; \&
|
||||
\node[btreeptr] (#1-5) {\vphantom{1}}; \\
|
||||
};
|
||||
}
|
||||
\newcommand{\btreelnodefour}[5]{%
|
||||
\matrix [ampersand replacement=\&, outer sep=0pt, matrix anchor=north] (#1)
|
||||
{
|
||||
\node[btreevale] (#1-a) {\suppressemptystr{#2}}; \&
|
||||
\node[btreevale] (#1-b) {\suppressemptystr{#3}}; \&
|
||||
\node[btreevale] (#1-c) {\suppressemptystr{#4}}; \&
|
||||
\node[btreevale] (#1-d) {\suppressemptystr{#5}}; \\
|
||||
};
|
||||
}
|
||||
|
||||
%%======================================================================
|
||||
%% btree with capacity = 3
|
||||
\newcommand{\btreeinodethree}[4]{%
|
||||
\matrix [ampersand replacement=\&] (#1)
|
||||
{
|
||||
\node[btreeptr] (#1-1) {\vphantom{1}}; \& \node[btreeval] (#1-a) {#2}; \&
|
||||
\node[btreeptr] (#1-2) {\vphantom{1}}; \& \node[btreeval] (#1-b) {#3}; \&
|
||||
\node[btreeptr] (#1-3) {\vphantom{1}}; \& \node[btreeval] (#1-c) {#4}; \&
|
||||
\node[btreeptr] (#1-4) {\vphantom{1}}; \\
|
||||
};
|
||||
}
|
||||
\newcommand{\btreelnodethree}[4]{%
|
||||
\matrix [ampersand replacement=\&, outer sep=0pt, matrix anchor=north] (#1)
|
||||
{
|
||||
\node[btreevale] (#1-a) {\suppressemptystr{#2}}; \&
|
||||
\node[btreevale] (#1-b) {\suppressemptystr{#3}}; \&
|
||||
\node[btreevale] (#1-c) {\suppressemptystr{#4}}; \\
|
||||
};
|
||||
}
|
||||
|
||||
%%======================================================================
|
||||
%% btree with capacity = 2
|
||||
\newcommand{\btreeinodetwo}[4]{%
|
||||
\matrix [ampersand replacement=\&] (#1)
|
||||
{
|
||||
\node[btreeptr] (#1-1) {\vphantom{1}}; \& \node[btreeval] (#1-a) {#2}; \&
|
||||
\node[btreeptr] (#1-2) {\vphantom{1}}; \& \node[btreeval] (#1-b) {#3}; \&
|
||||
\node[btreeptr] (#1-3) {\vphantom{1}}; \\
|
||||
};
|
||||
}
|
||||
\newcommand{\btreelnodetwo}[3]{%
|
||||
\matrix [ampersand replacement=\&, outer sep=0pt, matrix anchor=north] (#1)
|
||||
{
|
||||
\node[btreevale] (#1-a) {\suppressemptystr{#2}}; \&
|
||||
\node[btreevale] (#1-b) {\suppressemptystr{#3}}; \\
|
||||
};
|
||||
}
|
||||
%%======================================================================
|
||||
|
||||
|
||||
|
||||
|
||||
%% simple example
|
||||
% \begin{center}
|
||||
% \scalebox{0.7}{
|
||||
% \begin{tikzpicture}
|
||||
% %
|
||||
% \btreeinodefour{root}{13}{17}{24}{30};
|
||||
% \xyshift{-40mm}{-20mm}{\btreelnodefour{n1}{2}{3}{5}{7}}
|
||||
% \xyshift{-0mm}{-20mm}{\btreelnodefour{n2}{14}{16}{}{}}
|
||||
% \xyshift{40mm}{-20mm}{\btreelnodefour{n3}{19}{20}{22}{}}
|
||||
% \xyshift{80mm}{-20mm}{\btreelnodefour{n4}{24}{27}{29}{}}
|
||||
% \xyshift{120mm}{-20mm}{\btreelnodefour{n5}{33}{34}{38}{39}}
|
||||
% %
|
||||
% \foreach \x in {1,2,...,5} { \btreelink{root-\x}{n\x} }
|
||||
% \end{tikzpicture}
|
||||
% }
|
||||
% \end{center}
|
||||
Binary file not shown.
|
After Width: | Height: | Size: 66 KiB |
@ -0,0 +1,38 @@
|
||||
% Source: ss17_wissschreib (Eva)
|
||||
|
||||
\lstset{
|
||||
basicstyle=\ttfamily\scriptsize\mdseries,
|
||||
keywordstyle=\bfseries\color[rgb]{0.171875, 0.242188, 0.3125},
|
||||
identifierstyle=,
|
||||
commentstyle=\color[rgb]{0.257813, 0.15625, 0},
|
||||
stringstyle=\itshape\color[rgb]{0.0195313, 0.195313, 0.0117188},
|
||||
numbers=left,
|
||||
numberstyle=\tiny,
|
||||
stepnumber=1,
|
||||
breaklines=true,
|
||||
frame=none,
|
||||
showstringspaces=false,
|
||||
tabsize=4,
|
||||
backgroundcolor=\color[rgb]{0.98,0.98,0.98},
|
||||
captionpos=b,
|
||||
float=htbp,
|
||||
language=Python,
|
||||
xleftmargin=15pt,
|
||||
xrightmargin=15pt
|
||||
}
|
||||
|
||||
%(deutsche) Sonderzeichen
|
||||
\lstset{literate=%
|
||||
{Ä}{{\"A}}1
|
||||
{Ö}{{\"O}}1
|
||||
{Ü}{{\"U}}1
|
||||
{ä}{{\"a}}1
|
||||
{ö}{{\"o}}1
|
||||
{ü}{{\"u}}1
|
||||
{ß}{{\ss}}1
|
||||
}
|
||||
|
||||
%Verwendung im Text:
|
||||
%-> \begin{lstlisting}[language=Python,firstnumber=27] ... \end{lstlisting}
|
||||
%-> \begin{lstlisting}[language=Python,numbers=none] ... \end{lstlisting}
|
||||
%-> \lstinline[language=JAVA]{...}
|
||||
Reference in New Issue
Block a user