@string{acm = "ACM Press, New York"}
@string{ams = "American Mathematical Society"}
@string{abs-ams = "Abs. Amer. Math. Soc."}
@string{beatcs = "Bull. EATCS"}
@string{bull-ams = "Bull. Amer. Math. Soc."}
@string{cacm = "Comm. Assn. Comp. Mach."}
@string{cocoon = "Intl. Combinatorics and Computing Conference"}
@string{colt = "IEEE Conference on Computational Learning Theory"}
@string{compcomp = "Computational Complexity"}
@string{crc = "CRC Press"}
@string{cup = "Cambridge University Press"}
@string{eccc = "Electronic Colloquium in Computational Complexity"}
@string{gtm = "Graduate Texts in Mathematics"}
@string{ieee = "IEEE Computer Society Press, Los Alamitos, California"}
@string{ieeetc = "IEEE Trans. Comput."}
@string{ijcm = "Intern. J. Comp. Math."}
@string{ijfcs = "Intern. J. Found. Comp. Sci."}
@string{infcomp = "Inform. and Comp."}
@string{infcon = "Inform. and Control"}
@string{ipl = "Inf. Proc. Lett."}
@string{issac = "International Symposium on Symbolic and Algebraic Computation"}
@string{itit = "IEEE Transactions on Information Theory"}
@string{itnn = "IEEE Trans. Neural Networks"}
@string{jacm = "J. Assn. Comp. Mach."}
@string{jams = "J. Amer. Math. Soc."}
@string{jalg = "J. Alg"}
@string{jcta = "J. Comb. Thy. Ser. A"}
@string{jctb = "J. Comb. Thy. Ser. B"}
@string{jcss = "J. Comp. Sys. Sci."}
@string{jpdc = "J. Par. Dist. Comp."}
@string{jsl = "J. Symb. Logic"},
@string{lms = "London Math. Soc."}
@string{lncs = "Lect. Notes in Comp. Sci."},
@string{lnm = "Lect. Notes in Math."}
@string{mathann = "Math. Annalen"}
@string{mathsys = "Math. Sys. Thy."}
@string{mst = "Math. Sys. Thy."}
@string{sicomp = "SIAM J. Comput."}
@string{sigact = "SIGACT News"}
@string{sjam = "SIAM J. App. Math."}
@string{sjdm = "SIAM J. Disc. Math."}
@string{springer = "Springer Verlag"}
@string{tcs = "Theor. Comp. Sci."}
@string{tcsa = "Theor. Comp. Sci., Ser. A"}
@string{tcsb = "Theor. Comp. Sci., Ser. A"}
@string{trans-ams = "Trans. Amer. Math. Soc."}
@string{ugtm = "Undergraduate Texts in Mathematics"}
@string{wiley = "John Wiley and Sons"}
@string{zml = "Zeitschrift {f\"ur} Mathematische Logik und Grundlagen der
Mathematik"}
@string{unpub-mss = "Unpublished manuscript"}
@string{ieee = "IEEE"}
@string{acm = "ACM"}
@string{wcsl = "Workshop on Computer Science Logic"}
@string{afocs = "Annual IEEE Symposium on Foundations of Computer Science"}
@string{astoc = "Annual ACM Symposium on the Theory of Computing"}
@string{aicalp = "Annual International Conference on Automata, Languages, and Programming"}
@string{astacs = "Annual Symposium on Theoretical Aspects of Computer Science"}
@string{aicci = "Annual International Conference on Computers and Information"}
@string{astructures = "Annual IEEE Conference on Structure in Complexity Theory"}
@string{alics = "Annual IEEE Conference on Logic in Computer Science"}
@string{ifct = "International Conference on Fundamentals of Computation Theory"}
@string{afsttcs = "Annual Conference on Foundations of Software Technology and Theoretical Computer Science"}
@string{imfcs = "International Symposium on Mathematical Foundations of Computer
Science"}
@string{acolt = "Annual ACM Workshop on Computational Learning Theory"}
@string{ilfcs = "International Symposium on Logical Foundations of Computer
Science"}
@string{aisaac = "Annual International Symposium on Algorithms and
Computation"}
@string{icocoon = "International Combinatorics and Computing Conference"}
@string{accc = "Annual IEEE Conference on Computational Complexity"}
@string{sCSL = "CSL"}
@string{sFOCS = "FOCS"}
@string{sSTOC = "STOC"}
@string{sICALP = "ICALP"}
@string{sSTACS = "STACS"}
@string{sICCI = "ICCI"}
@string{sStructures = "Structures"}
@string{sLICS = "LICS"}
@string{sFCT = "FCT"}
@string{sFSTTCS = "FSTTCS"}
@string{sMFCS = "MFCS"}
@string{sCOLT = "COLT"}
@string{sLFCS = "LFCS"}
@string{sISAAC = "ISAAC"}
@string{sCOCOON = "COCOON"}
@string{sCCC = "CCC"}
% @string{csl = sCSL}
% @string{focs = sFOCS}
% @string{stoc = sSTOC}
% @string{icalp = sICALP}
% @string{stacs = sSTACS}
% @string{icci = sICCI}
% @string{structures = sStructures}
% @string{lics = sLICS}
% @string{fct = sFCT}
% @string{fsttcs = sFSTTCS}
% @string{mfcs = sMFCS}
% @string{colt = sCOLT}
% @string{lfcs = slfcs}
% @string{isaac = sISAAC}
% @string{ccc = sCCC}
@string{csl = wcsl}
@string{focs = afocs}
@string{stoc = astoc}
@string{icalp = aicalp}
@string{stacs = astacs}
@string{icci = aicci}
@string{structures = astructures}
@string{lics = alics}
@string{fct = ifct}
@string{fsttcs = afsttcs}
@string{mfcs = imfcs}
@string{colt = acolt}
@string{lfcs = ilfcs}
@string{isaac = aisaac}
@string{cocoon = icocoon}
@string{ccc = accc}
@string{proc1 = "Proc.\ 1st "}
@string{proc2 = "Proc.\ 2nd "}
@string{proc3 = "Proc.\ 3rd "}
@string{proc4 = "Proc.\ 4th "}
@string{proc5 = "Proc.\ 5th "}
@string{proc6 = "Proc.\ 6th "}
@string{proc7 = "Proc.\ 7th "}
@string{proc8 = "Proc.\ 8th "}
@string{proc9 = "Proc.\ 9th "}
@string{proc10 = "Proc.\ 10th "}
@string{proc11 = "Proc.\ 11th "}
@string{proc12 = "Proc.\ 12th "}
@string{proc13 = "Proc.\ 13th "}
@string{proc14 = "Proc.\ 14th "}
@string{proc15 = "Proc.\ 15th "}
@string{proc16 = "Proc.\ 16th "}
@string{proc17 = "Proc.\ 17th "}
@string{proc18 = "Proc.\ 18th "}
@string{proc19 = "Proc.\ 19th "}
@string{proc20 = "Proc.\ 20th "}
@string{proc21 = "Proc.\ 21st "}
@string{proc22 = "Proc.\ 22nd "}
@string{proc23 = "Proc.\ 23rd "}
@string{proc24 = "Proc.\ 24th "}
@string{proc25 = "Proc.\ 25th "}
@string{proc26 = "Proc.\ 26th "}
@string{proc27 = "Proc.\ 27th "}
@string{proc28 = "Proc.\ 28th "}
@string{proc29 = "Proc.\ 29th "}
@string{proc30 = "Proc.\ 30th "}
@string{proc31 = "Proc.\ 31st "}
@string{proc32 = "Proc.\ 32nd "}
@string{proc33 = "Proc.\ 33rd "}
@string{proc34 = "Proc.\ 34th "}
@string{proc35 = "Proc.\ 35th "}
@string{proc36 = "Proc.\ 36th "}
@string{proc37 = "Proc.\ 37th "}
@string{proc38 = "Proc.\ 38th "}
@string{proc39 = "Proc.\ 39th "}
@string{proc40 = "Proc.\ 40th "}
@string{proc41 = "Proc.\ 41st "}
@string{proc42 = "Proc.\ 42nd "}
@string{proc43 = "Proc.\ 43rd "}
@string{proc44 = "Proc.\ 44th "}
@string{proc45 = "Proc.\ 45th "}
@string{proc46 = "Proc.\ 46th "}
@string{proc47 = "Proc.\ 47th "}
@string{proc48 = "Proc.\ 48th "}
@string{proc49 = "Proc.\ 49th "}
@string{proc50 = "Proc.\ 50th "}
@string{proc51 = "Proc.\ 51st "}
@string{proc52 = "Proc.\ 52nd "}
@string{proc53 = "Proc.\ 53rd "}
@string{proc54 = "Proc.\ 54th "}
@string{proc55 = "Proc.\ 55th "}
@string{proc56 = "Proc.\ 56th "}
@string{proc57 = "Proc.\ 57th "}
@string{proc58 = "Proc.\ 58th "}
@string{proc59 = "Proc.\ 59th "}
@string{proc60 = "Proc.\ 60th "}
@inproceedings{Aan93,
author = {S. Aanderaa},
title = {A universal {T}uring machine},
booktitle = proc6 # csl,
series = lncs,
volume = {702},
publisher = springer,
year = {1993},
pages = {1--4}
}
@INPROCEEDINGS{Aar02,
author="S. Aaronson",
title = "Quantum lower bound for the collision problem",
booktitle = "Proc. 34th ACM STOC",
year = "2002",
pages = "635-642",
note = "[STOC:509907.509999, arXiv:quant-ph/0111102]"
}
@INPROCEEDINGS{Aar04,
author="S. Aaronson",
title = "Limitations of quantum advice and one-way communication",
booktitle = "19th IEEE Conf. Comput. Complexity (CCC)",
year = "2004",
pages = "320-332",
note = "[CCC:10.1109/CCC.2004.1313854, arXiv:quant-ph/0402095]"
}
@inproceedings{Aar04,
author = {S. Aaronson},
title = {Multilinear formulas and skepticism about quantum
computing},
booktitle = proc36 # stoc,
year = {2004},
note = {Also ECCC TR03-079}
}
@article{AaGo04,
author = {S. Aaronson and D. Gottesman},
title = {Improved simulation of stabilizer circuits},
journal = {Phys. Rev. A},
volume = {70},
number = {052328},
year = {2004}
}
@misc{Aar07,
author = {S. Aaronson},
title = {Experimental complexity theory (blog post)},
year = {2007},
month = {June},
howpublished = {https://www.scottaaronson.com/blog/?p=252}
}
@inproceedings{AaWi08,
author = {S. Aaronson and A. Wigderson},
title = {Algebrization: A new barrier in complexity theory},
booktitle = proc40 # stoc,
year = {2008},
pages = {731--740}
}
@article{AaWi09,
author = {S. Aaronson and A. Wigderson},
title = {Algebrization: A new barrier in complexity theory},
journal = {ACM Transactions on Computing Theory},
volume = {1},
number = {1},
year = {2009}
}
@misc{Aar08,
author = {S. Aaronson},
title = {Arithmetic natural proofs theory is sought},
howpublished = {``Shtetl-Optimized'' weblog,
\url{http://scottaaronson.com/blog/?p=336}},
month = {June 30},
year = {2008}
}
@inproceedings{Aar10,
author = {S. Aaronson},
title = {{BQP} and the polynomial hierarchy},
booktitle = proc42 # stoc,
year = {2010},
pages = {141--150}
}
@misc{AaAr10,
author = {S. Aaronson and A. Arkhipov},
title = {The computational complexity of linear optics},
year = {2010},
month = {November},
day = {14},
howpublished = {http://arxiv.org/abs/1011.3245}
}
@misc{AaCh16,
author = {S. Aaronson and L. Chen},
title = {Complexity-Theoretic Foundations of Quantum Supremacy
Experiments},
year = {2016},
howpublished = {https://arxiv.org/abs/1612.05903}
}
@article{AbVi91,
author = {S. Abiteboul and V. Vianu},
title = {Datalog extensions for database queries and updates},
journal = jcss,
volume = {43},
year = {1991},
pages = {62--124}
}
@article{AbVi95,
author = {S. Abiteboul and V. Vianu},
title = {Computing with first-order logic},
journal = jcss,
volume = {50},
year = {1995},
pages = {309--335}
}
@inproceedings{Abr86,
author = {K. Abrahamson},
title = {Time-space tradeoffs for branching programs
compared with those for straight line programs},
booktitle = proc27 # focs,
year = {1986},
pages = {402--409}
}
@article{Abr87,
author = {K. Abrahamson},
title = {Generalized string matching},
journal = sicomp,
volume = {16},
year = {1987},
pages = {1039--1051}
}
@article{ADKP89,
author = {K. Abrahamson and N. Dadoun and D. Kirkpatrick and
T. Przytycka},
title = {A simple parallel tree contraction algorithm},
journal = {Journal of Algorithms},
volume = {10},
year = {1989},
pages = {287--302}
}
@inproceedings{Abr90,
author = {K. Abrahamson},
title = {A time-space tradeoff for {B}oolean matrix multiplication},
booktitle = proc31 # focs,
year = {1990},
pages = {412--419}
}
@article{Abr91,
author = {K. Abrahamson},
title = {Time-space tradeoffs for algebraic problems on
general sequential machines},
journal = jcss,
volume = {43},
year = {1991},
pages = {269--289}
}
@article{AbFe92,
author = {K. Abrahamson and M. Fellows},
title = {Finite automata, bounded treewidth, and well-quasiordering},
journal = {Contemporary Mathematics},
volume = {nnn},
year = {1992},
pages = {nnn--nnn}
}
@misc{ADF92,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {IV}:
Completeness for {W[P]} and {P-Space} analogs},
year = {1992}
}
@inproceedings{ADF93,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter intractability {II}:
On completeness for {W[1]}},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {374--385}
}
@inproceedings{ADF93II,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {II}:
On completeness for {W[1]}},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {374--385}
}
@article{ADF95,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {IV}: On
completeness for {W[P]} and {PSPACE} analogs},
journal = {Annals of Pure and Applied Logic},
volume = {73},
year = {1995},
pages = {235--276}
}
@inproceedings{ACRW02,
author = {S. Aida and M. Crasmaru and K. Regan and O. Watanabe},
title = {Games with a uniqueness property},
booktitle = proc19 # stacs,
series = lncs,
volume = {2285},
publisher = springer,
year = {2002},
pages = {396--407}
}
@article{ACRW04,
author = {S.~Aida and M.~Crasmaru and K.~Regan and O.~Watanabe},
title = {Games with Uniqueness Properties},
journal = tcs,
volume = {37},
year = {2004},
pages = {29--47}
}
@inproceedings{AEFM89,
author = {K. Abrahamson and J. Ellis and M. Fellows and M. Mata},
title = {On the complexity of fixed-parameter problems},
booktitle = proc30 # focs,
year = {1989},
pages = {210--215},
note = {Final version to appear in {\it J. Comput. Sys. Sci.}}
}
@techreport{AbFe92,
author = {K. Abrahamson and M. Fellows},
title = {Finite automata, bounded treewidth, and well-quasiordering},
institution = {University of British Columbia, Computer
Science Department},
year = {1992}
}
@article{AdIw84,
author = {A. Adachi and S. Iwata},
title = {Some combinatorial game problems require {$\Omega(n^k)$} time},
journal = jacm,
volume = {31},
year = {1984},
pages = {361--376}
}
@article{AdBu07,
author = {B. Adamczewski and Y. Bugeaud},
title = {On the complexity of algebraic numbers {I}: Expansions
in integer bases},
journal = {Annals of Mathematics},
volume = {165},
pages = {547--565},
year = {2007}
}
@article{AdBu05,
author = {B. Adamczewski and Y. Bugeaud},
title = {On the complexity of algebraic numbers {II}: Continued
fractions},
journal = {Acta Mathematica},
volume = {195},
pages = {1--20},
year = {2005}
}
@article{AdBu07b,
author = {B. Adamczewski and Y. Bugeaud},
title = {On the independence of expansions of algebraic
numbers in an integer base},
journal = {Bulletin of the London Mathematical Society},
volume = {39},
pages = {283--289},
year = {2007},
}
@article{AdBu10,
author = {B. Adamczewski and Y. Bugeaud},
title = {Mesures de transcendance et aspects quantitatifs
de la m{\`e}thode de {T}hue-{S}iegel-{R}oth-{S}chmidt},
journal = {Proceedings of the London Mathematical
Society},
volume = {101},
pages = {1--26},
year = {2010}
}
@article{ABL04,
author = {B. Adamczewski and Y. Bugeaud and F. Luca},
title = {Sur la complexit{\'e} des nombres
alg{\'e}briques},
journal = {Comptes Rendus de l’Acad{\'e}mie des Sciences, Paris Ser. I},
volume = {336},
pages = {1--10},
year = {2004}
}
@misc{ACL16,
author = {B. Adamczewski and J. Cassaigne and M. Le Gonidec},
title = {On the computational complexity of algebraic numbers: the {H}artmanis--{S}tearns problem revisited},
year = {2016},
\howpublished = {https://arxiv.org/abs/1601.02771}
}
@article{ATT92,
author = {E. Adamides and Ph. Tsalides and A. Thanailakis},
title = {Hierarchical cellular automata structures},
journal = {Parallel Computing},
volume = {18},
year = {1992},
pages = {517--524}
}
@INPROCEEDINGS{AdMa77,
AUTHOR = {L. Adleman and K. Manders},
TITLE = {Reducibility, randomness, and intractability},
BOOKTITLE = proc9 # stoc,
YEAR = {1977},
PAGES = {151--163}
}
@inproceedings{Adl78,
author = {L. Adleman},
title = {Two theorems on random polynomial time},
booktitle = proc19 # focs,
year = {1978},
pages = {75--83}
}
@inproceedings{AdMa79,
AUTHOR = {L. Adleman and K. Manders},
TITLE = {Reductions that lie},
booktitle = proc20 # focs,
year = {1979},
pages = {397--410}
}
@incollection{AdHu92,
author = {L. Adleman and M.-D. Huang},
title = {Primality testing and {A}belian varieties over finite fields},
booktitle = {},
series = lnm,
volume = {1512},
publisher = springer,
pages = {nnn--nnn}
}
@article{Adl94,
author = {L. Adleman},
title = {Molecular computation of solutions to combinatorial
problems},
journal = {Science},
volume = {266},
year = {1994},
pages = {1021--1024}
}
@article{ADH97,
author = {L. Adleman and J.~DeMarrais and M.~Huang},
title = {Quantum computability},
journal = sicomp,
volume = {26},
year = {1997},
pages = {1524--1540}
}
@inproceedings{AgCh88,
author = {A. Aggarwal and A. Chandra},
title = {Virtual memory algorithms},
BOOKTITLE = proc20 # stoc,
year = {1988},
pages = {173--185}
}
@INPROCEEDINGS{AACS87,
AUTHOR = {A. Aggarwal and B. Alpern and A. Chandra and M. Snir},
TITLE = {A model for hierarchical memory},
BOOKTITLE = proc19 # stoc,
YEAR = {1987},
PAGES = {305--314}
}
@INPROCEEDINGS{ACS87,
AUTHOR = {A. Aggarwal and A. Chandra and M. Snir},
TITLE = {Hierarchical memory with block transfer},
BOOKTITLE = proc28 # focs,
YEAR = {1987},
PAGES = {204--216}
}
@article{ACS90,
author = {A. Aggarwal and A. Chandra and M. Snir},
title = {Communication complexity of {PRAMs}},
journal = tcs,
volume = {71},
year = {1990},
pages = {3--28}
}
@ARTICLE{AgVi88,
AUTHOR = {A. Aggarwal and J. Vitter},
TITLE = {The input-output complexity of sorting and related problems},
JOURNAL = cacm,
VOLUME = {31},
YEAR = {1988},
PAGES = {1116--1127}
}
@inproceedings{AMV88,
author = {G. Agnew and R. Mullin and S. Vanstone},
title = {Fast exponentialtion in {$GF(2^n)$}},
booktitle = {Proceedings, Advances in Cryptology: Eurocrypt '88},
series = lncs,
volume = {330},
publiher = springer,
year = {1988},
pages = {251--255}
}
@inproceedings{AgBi93,
author = {M. Agrawal and S. Biswas},
title = {Polynomial isomorphism of {1-L} complete sets},
booktitle = proc8 # structures,
year = {1993},
pages = {75--80}
}
@inproceedings{Agr94,
author = {M. Agrawal},
title = {On the isomorphism problem for weak reductions (extended
abstract)},
booktitle = proc9 # structures,
year = {1994},
pages = {338--355}
}
@inproceedings{AgAr95,
author = {M. Agrawal and V. Arvind},
title = {Reductions of self-reducible sets to depth-1 weighted
threshold circuit classes, and sparse sets},
booktitle = proc10 # structures,
year = {1995},
pages = {264--276}
}
@inproceedings{AgAl96,
author = {M. Agrawal and E. Allender},
title = {An isomorphism theorem for circuit complexity},
booktitle = proc11 # ccc,
year = {1996},
pages = {2--11}
}
@inproceedings{AAIPR97,
author = {M.~Agrawal and E.~Allender and R.~Impagliazzo and
T.~Pitassi and S.~Rudich},
title = {Reductions in complexity theory: An isomorphism theorem
and a gap theorem},
booktitle = proc29 # stoc,
year = {1997},
note = "to appear"
}
@inproceedings{AAD97,
author = {M. Agrawal and E. Allender and S. Datta},
title = {On {TC}^0, {AC}^0, and Arithmetic Circuits},
booktitle = proc12 # ccc,
year = {1997},
pages = {134--148}
}
@inproceedings{AgVi08,
author = {M. Agrawal and V. Vinay},
title = {Arithmetic circuits: A chasm at depth four},
booktitle = proc49 # focs,
year = {2008},
pages = {67--75}
}
@INPROCEEDINGS{AhBO97,
author="D. Aharonov and M. Ben-Or",
title = "Fault tolerant computation with constant error",
booktitle = "Proc. ACM Symposium on the Theory of Computing (STOC)",
year = "1997",
pages = "176-188"
}
@article{AhDu89,
author = {R. Ahlswede and G. Dueck},
title = {Identification via channels},
journal = itit,
volume = {35},
year = {1989},
pgaes = {15--29}
}
@article{AhDu89b,
author = {R. Ahlswede and G. Dueck},
title = {Identification in the presence of feedback---a discovery
of new capacity formulas},
journal = itit,
volume = {35},
year = {1989},
pgaes = {30--36}
}
@article{AhCs93,
author = {R. Ahlswede and I. Csisz{\`a}r},
title = {Common randomness in information theory and
cryptography---part {I}: Secret sharing},
journal = itit,
volume = {39},
year = {1993},
pages = {1121--1132}
}
@book{AHU74,
author = {A. Aho and J. Hopcroft and J. Ullman},
title = {The Design and Analysis of Computer Algorithms},
publisher = {Addison-Wesley},
address = {Reading, Mass.},
year = {1974}
}
@INCOLLECTION{Aho90,
AUTHOR = {A. Aho},
TITLE = {Algorithms for finding patterns in strings},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {}
}
@article{Ajt83,
author = {M. Ajtai},
title = {{$\Sigma_1^1$} formulae on finite structures},
journal = {Annals of Pure and Applied Logic},
volume = {24},
year = {1983},
pages = {1--48}
}
@inproceedings{AKS83,
author = {M. Ajtai and J. Komlos and E. Szemer{\'e}di},
title = {An {$O(n \log n)$} sorting network},
booktitle = proc15 # stoc,
year = {1983},
pages = {1--9}
}
@inproceedings{AjBe84,
author = {M. Ajtai and M. {Ben-Or}},
title = {A theorem on probabilistic constant-depth circuits},
booktitle = proc16 # stoc,
year = {1984},
pages = {471--474}
}
@inproceedings{Ajt88,
author = {M. Ajtai},
title = {The complexity of the pigeonhole principle},
booktitle = proc29 # focs,
year = {1988},
pages = {346--355}
}
@incollection{AKSS89,
author = {M. Ajtai and J. Koml{\'o}s and W. Steiger and
E. Szemer{\'e}di},
title = {Almost sorting in one round},
booktitle = {Randomness and Computation},
series = {Advances in Computing Research},
volume = {5},
editor = {S. Micali},
publisher = {JAI Press},
address = {Greenwich, CT, USA},
year = {1989},
pages = {117--125}
}
@article{AjFa90,
author = {M. Ajtai and R. Fagin},
title = {Reachability is harder for directed than for undirected
finite graphs},
journal = jsl,
volume = {55},
year = {1990},
pages = {113--150}
}
@article{Ajt93,
author = {M. Ajtai},
title = {Approximate counting with uniform constant-depth circuits},
journal = {DIMACS Series in Discrete Mathematics and Theoretical
Computer Science},
volume = {13},
year = {1993},
pages = {1--20}
}
@article{Ajt94,
author = {M. Ajtai},
title = {The complexity of the pigeonhole principle},
journal = {Combinatorica},
volume = {14},
year = {1994},
pages = {417--433}
}
@inproceedings{Ajt96,
author = {M. Ajtai},
title = {Generating Hard Instances of Lattice Problems (Extended
abstract)},
booktitle = proc28 # stoc,
year = {1996},
pages = {99--108}
}
@techreport{Ajt99,
author = {M. Ajtai},
title = {Determinism versus non-determinism for linear time
{RAM}s with memory restrictions},
institution = eccc,
number = {ECCC TR98-077, revision 1},
month = {January},
year = {1999},
note = {A preliminary version appeared in the proceedings of
the 31st ACM STOC, 1999}
}
@techreport{Ajt99b,
author = {M. Ajtai},
title = {A non-linear time lower bound for {B}oolean branching
programs},
institution = eccc,
number = {ECCC TR99-026},
month = {July},
year = {1999},
note = {A preliminary version appeared in the proceedings of
the 40th IEEE FOCS, 1999}
}
@InProceedings{AjDw97,
title = "A Public-Key Cryptosystem with Worst-Case/Average-Case
Equivalence",
author = {M. Ajtai and C. Dwork},
pages = "284--293",
booktitle = proc29 # stoc,
year = "1997",
}
@inproceedings{AGS03,
author = {Adi Akavia and Shafi Goldwasser and Shmuel Safra},
title = {Proving Hard-Core Predicates Using List Decoding},
booktitle = proc44 # focs,
year = {2003},
pages = {146-155},
ee = {http://csdl.computer.org/comp/proceedings/focs/2003/2040/00/20400146abs.htm},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{Aka10,
author = {Adi Akavia},
title = {Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions},
booktitle = proc23 # colt,
year = {2010},
pages = {381-393},
ee = {http://www.colt2010.org/papers/005akavia.pdf},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Alb38,
author = {A. Albert},
title = {Symmetric and alternate matrices in an arbitrary field, {I}},
journal = trans-ams,
volume = {43},
year = {1938},
pages = {386--436}
}
@inproceedings{AKLLR79,
author = {R. Aleliunas and R. Karp and R. Lipton and L. Lov{\'a}sz
and C. Rackoff},
title = {Random walks, universal traversal sequences,
and the complexity of maze problems},
booktitle = proc20 # focs,
year = {1979},
pages = {218--223}
}
@misc{All10,
author = {J. Allcock},
title = {Emulating circuit-based and measurement-based quantum computation},
year = {2010},
note = {Master's Thesis, Imperial College London Department of Computing},
howpublished = {https://www.doc.ic.ac.uk/teaching/distinguished-projects/2010/s.allcock.pdf},
note = {(also http://studyres.com/doc/6906481/emulating-quantum-computation)}
}
@article{Allen91,
author = {W. Allen},
title = {Arithmetizing uniform {NC}},
journal = {Annals of Pure and Applied Logic},
volume = {53},
year = {1991},
pages = {1--50}
}
@article{All88,
author = {E. Allender},
title = {Isomorphisms and {1-L} reductions},
journal = jcss,
volume = {36},
year = {1988},
pages = {336--350}
}
@inproceedings{All89,
author = {E.~Allender},
title = {A note on the power of threshold circuits},
booktitle = proc30 # focs,
year = {1989},
pages = {580--584}
}
@techreport{All89b,
author = {E. Allender},
title = {Limitations of the upward separation technique},
institution = {Rutgers University},
number = {LCSR-TR-133},
year = {1989}
}
@article{All89c,
author = {E. Allender},
title = {Some consequences of the existence of pseudorandom
generators},
journal = jcss,
volume = {39},
year = {1989},
pages = {101--124}
}
@techreport{AlWi89,
author = {E. Allender and C. Wilson},
title = {Downward translations of equality},
institution = {Rutgers University},
number = {DCS-TR-258},
year = {1989}
}
@inproceedings{All90,
author = {E. Allender},
title = {Oracles versus proof techniques that do not relativize},
booktitle = proc1 # isaac,
year = {1990}
}
@inproceedings{AlHe90,
author = {E. Allender and U. Hertrampf},
title = {On the power of uniform families of constant-depth
circuits},
booktitle = proc15 # mfcs,
publisher = springer,
series = lncs,
volume = {452},
year = {1990},
pages = {158--164}
}
@ARTICLE{AlWa90,
AUTHOR = {E. Allender and K. Wagner},
TITLE = {Counting Hierarchies: Polynomial Time and Constant Depth
Circuits},
JOURNAL = beatcs,
YEAR = {1990},
VOLUME = {40},
PAGES = {182--194},
MONTH = {February}
}
@article{AlWi90,
author = {E. Allender and C. Wilson},
title = {Downward translations of equality},
journal = tcs,
volume = {75},
year = {1990},
pages = {nnn--nnn}
}
@techreport{AlGo90,
author = {E. Allender and V. Gore},
title = {On strong separations from {$AC^0$}},
institution = {DIMACS},
number = {Tech. Report 90-32},
year = {1990}
}
@inproceedings{AlGo91,
author = {E. Allender and V. Gore},
title = {On strong separations from {$AC^0$}},
booktitle = proc8 # fct,
publisher = springer,
series = lncs,
volume = {529},
year = {1991},
pages = {1--15},
note = {To appear in the {DIMACS} Special Year volume, ed.\
J.-Y. Cai, {AMS} Publications}
}
@article{AlGo91b,
author = {E. Allender and V. Gore},
title = {Rudimentary reductions revisited},
journal = ipl,
volume = {40},
year = {1991},
pages = {89--95}
}
@article{All91,
author = {E. Allender},
title = {Limitations of the upward separation technique},
journal = mst,
volume = {24},
year = {1991},
pages = {nnn-nnn}
}
@techreport{AlGo92,
author = {E. Allender and V. Gore},
title = {A uniform circuit lower bound for the permanent},
institution = {DIMACS},
number = {Tech. Report 92-30},
year = {1992}
}
@inproceedings{ABI93,
author = {E. Allender and J. Balc{\'a}zar and N. Immerman},
title = {A first-order isomorphism theorem},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {163--174}
}
@techreport{ABI93tr,
author = {E. Allender and J. Balc{\'a}zar and N. Immerman},
title = {A first-order isomorphism theorem},
institution = {DIMACS},
number = {Tech. Report 93-20},
year = {1993}
}
@article{ABHH93,
author = {E. Allender and R. Beigel and U. Hertarmpf and S. Homer},
title = {Almost-everywhere complexity hierarchies for
nondeterministic time},
journal = tcs,
volume = {115},
year = {1993},
pages = {225--241}
}
@article{AlHe93,
author = {E. Allender and U. Hertrampf},
title = {Depth reduction for circuits of unbounded fan-in},
journal = infcomp,
volume = {nnn},
year = {1993},
note = {To appear}
}
@inproceedings{AlJi93,
author = {E. Allender and J. Jiao},
title = {Depth reduction for noncommutative arithmetic circuits
(extended abstract)},
booktitle = proc25 # stoc,
year = {1993},
pages = {515--522}
}
@techreport{AlOg93,
author = {E. Allender and M. Ogiwara},
title = {Relationships among {PL}, {\#L}, and the determinant},
institution = {DIMACS},
number = {Tech. Report 93-43},
year = {1993}
}
@article{AlGo94,
author = {E. Allender and V. Gore},
title = {A uniform circuit lower bound for the permanent},
journal = sicomp,
volume = {23},
year = {1994},
pages = {1026--1049}
}
@techreport{AlSt94,
author = {E. Allender and M. Strauss},
title = {Measure on small complexity classes,
with applications for {BPP}},
institution = {Rutgers University and DIMACS},
number = {DIMACS TR 94-18},
month = {April},
year = {1994},
}
@inproceedings{AlSt94f,
author = {E. Allender and M. Strauss},
title = {Measure on small complexity classes,
with applications for {BPP}},
booktitle = proc35 # focs,
year = {1994},
pages = {807--818}
}
@misc{AlSt94c,
author = {E. Allender and M. Strauss},
note = {In preparation},
year = {1994}
}
@inproceedings{AlSt95,
author = {E. Allender and M. Strauss},
title = {Measure on {P}: {R}obustness of the notion},
booktitle = proc20 # mfcs,
series = lncs,
volume = {969},
publisher = springer,
year = {1995},
pages = {129--138}
}
@misc{All94pc,
author = {E. Allender},
title = {Personal communication},
month = {August},
year = {1994}
}
@incollection{All96,
author = {E. Allender},
title = {A Note on Uniform Circuit Lower Bounds for the
Counting Hierarchy},
booktitle = proc2 # cocoon,
series = lncs,
publisher = springer,
volume = {1090},
year = {1996},
pages = {127--135},
note = {Update titled ``The permanent requires large uniform
threshold circuits'' available as ECCC TR}
}
@inproceedings{ABO96,
author = {E.~Allender and R.~Beals and M.~Ogihara},
title = {The complexity of matrix rank
and feasible systems of linear equations},
booktitle = proc28 # stoc,
year = {1996},
pages = {161--167}
}
@article{AlOg96,
author = {E.~Allender and M.~Ogihara},
title = {Relationships among {PL}, {\#L}, and the determinant},
journal = {RAIRO},
volume = {30},
year = {1996},
pages = {1--21}
}
@techreport{All97,
author = {E. Allender},
title = {The permanent requires large uniform threshold circuits},
institution = {DIMACS},
number = {TR 97-51},
month = {September},
year = {1997},
note = {Submitted for publication}
}
@incollection{ALR97a,
author = {E. Allender and M. Loui and K. Regan},
title = {Complexity classes},
booktitle = {CRC Handbook on Algorithms and Theory of Computation},
editor = {M. Atallah},
publisher = crc,
year = {1997},
note = {to appear in 1998}
}
@incollection{ALR97b,
author = {E. Allender and M. Loui and K. Regan},
title = {Reducibility and completeness},
booktitle = {CRC Handbook on Algorithms and Theory of Computation},
editor = {M. Atallah},
publisher = crc,
year = {1997},
note = {to appear in 1998}
}
@incollection{ALR97c,
author = {E. Allender and M. Loui and K. Regan},
title = {Other complexity classes and measures},
booktitle = {CRC Handbook on Algorithms and Theory of Computation},
editor = {M. Atallah},
publisher = crc,
year = {1997},
note = {to appear in 1998}
}
@article{All99,
author = {E. Allender},
title = {The permanent requires large uniform threshold circuits},
journal = {Chicago Journal of Theoretical Computer Science},
volume = {1999:7},
year = {1999},
pages = {}
}
@incollection{ALR04,
author = {E. Allender and M. Loui and K. Regan},
title = {Complexity theory},
booktitle = {CRC Handbook of Computer Science and Engineering,
2nd ed.},
editor = {M. Atallah},
publisher = crc,
year = {2004},
note = {to appear}
}
@article{ABKMR06,
author = {E. Allender and H. Buhrman and M. Koucky and
D. van Melkebeek and D. Ronneburger},
title = {Power from random strings},
journal = sicomp,
volume = {35},
year = {2006},
pages = {1467--1493}
}
@techreport{AKRR09,
author = {Eric Allender and Michal Koucky and Detlef Ronneburger
and Sambuddha Roy},
title = {The Pervasive Reach of Resource-Bounded {K}olmogorov
Complexity in Computational Complexity Theory},
institution = eccc,
number = {TR09-051},
month = {July},
day = {2},
year = {2009}
}
@article{Alon86,
author = {N. Alon},
title = {Eigenvalues and expanders},
journal = {Combinatorica},
volume = {6},
year = {1986},
pages = {83--96}
}
@article{ABI86,
author = {N. Alon and L. Babai and A. Itai},
title = {A Fast and Simple Randomized Parallel Algorithm for
the Maximal Independent Set Problem},
journal = {Journal of Algorithms},
volume = {7},
year = {1986},
pages = {567--583}
}
@ARTICLE{AlMa88,
AUTHOR = {N. Alon and W. Maass},
TITLE = {Meanders and their application to lower bound arguments},
JOURNAL = jcss,
VOLUME = {37},
YEAR = {1988},
PAGES = {118--129}
}
@inproceedings{AGHP90,
author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta},
title = {Simple constructions of almost {$k$-wise} independent
random variables},
booktitle = proc31 # focs,
year = {1990},
pages = {544--553}
}
@inproceedings{AST90,
author = {N. Alon and P. Seymour and R. Thomas},
title = {A separator theorem for graphs with an excluded minor
and its applications},
booktitle = proc22 # stoc,
year = {1990},
pages = {293--299}
}
@article{AST90j,
author = {N. Alon and P. Seymour and R. Thomas},
title = {A separator theorem for non-planar graphs},
journal = jams,
volume = {3},
year = {1990}
}
@article{AKW90,
author = {N. Alon and M. Karchmer and A. Wigderson},
title = {Linear circuits over {GF(2)}},
journal = sicomp,
volume = {19},
year = {1990},
pages = {1064--1067}
}
@article{ABLP91,
author = {N. Alon and A. Bar-Noy and N. Linial and D. Peleg},
title = {A lower bound for radio broadcast},
journal = jcss,
volume = {43},
year = {1991},
pages = {290--298}
}
@book{AS92,
author = {N. Alon and J. Spencer},
title = {The Probabilistic Method},
publisher = {Wiley},
year = {1992},
note = {With an appendix by P. Erd{\H{o}}s}
}
@article{ABNNR92,
author = {N. Alon and J. Bruck and J. Naor and M. Naor and R. Roth},
title = {Construction of asymptotically good low-rate
error-correcting codes through pseudo-random graphs},
journal = itit,
volume = {38},
number = {2},
month = {March},
year = {1992},
pages = {509--512}
}
@incollection{AGHP92,
author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta},
title = {Simple constructions of almost {$k$-wise}
independent random variables},
booktitle = {Random Structures and Algorithms},
publisher = {Wiley},
year = {1992},
pages = {nnn-nnn},
note = {An earlier version appeared in Proc.\ 31st FOCS,
1990, 544--553}
}
@incollection{AGHP93,
author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta},
title = {Addendum to ``Simple constructions of almost {$k$-wise}
independent random variables''},
booktitle = {Random Structures and Algorithms},
publisher = {Wiley},
year = {1993},
pages = {nnn-nnn}
}
@article{AlSu00,
author = {N. Alon and B. Sudakov},
title = {Bipartite subgraphs and the smallest eigenvalue},
journal = {Combinatorics, Probability, and Computing},
volume = {9},
year = {2000},
pages = {1--12}
}
@misc{Alon11PC,
author = {N. Alon},
title = {Personal communication},
year = {2011}
}
@ARTICLE{AKKLR03,
AUTHOR = {N. Alon and T. Kaufman and M. Krivelevich and S. Litsyn and D. Ron},
TITLE = {Testing {R}eed-{M}uller Codes},
JOURNAL = {IEEE Transactions on Information Theory },
YEAR = {2005},
volume = {51},
number = {11},
pages = {4032-4039},
month = {November},
Note = {Preliminary version ``Testing Low-Degree Polynomials over $GF(2)$'' appeared in RANDOM 2003},
file = F
}
@book{AlBe95,
author = {J.L. Alperin and R.B. Bell},
title = {Groups and Representations},
publisher = springer,
series = gtm,
volume = {162},
year = {1995}
}
@INPROCEEDINGS{ACF90,
AUTHOR = {B. Alpern and L. Carter and E. Feig},
TITLE = {Uniform memory hierarchies},
BOOKTITLE = proc31 # focs,
YEAR = {1990},
PAGES = {600--608}
}
@inproceedings{Alt83,
author = {H. Alt},
title = {Multiplication is the easiest nontrivial function},
booktitle = proc24 # focs,
year = {1983},
pages = {320--322}
}
@techreport{AlJe91,
author = {C. Alvarez and B. Jenner},
title = {A very hard log-space counting class},
institution = {Fachbereich Informatik, Universitaet Hamburg},
number = {FBI-HH-147/91},
year = {1991}
}
@article{AlJe93,
author = {C. Alvarez and B. Jenner},
title = {A very hard log-space counting class},
journal = tcs,
volume = {107},
year = {1993},
pages = {3--30}
}
@inproceedings{AlJe94,
author = {C. Alvarez and B. Jenner},
title = {On adaptive {D}logtime and {P}olylogtime reductions},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {301--312}
}
@article{AKN92,
author = {S. Amari and K. Kurata and H. Nagaoka},
title = {Information geometry of {B}oltzmann machines},
journal = itnn,
volume = {3},
month = {March},
year = {1992},
pages = {260--271}
}
@ARTICLE{ANTV02,
author = "A. Ambainis and A. Nayak and A. Ta-Shma and U. V. Vazirani",
title = "Quantum dense coding and quantum finite automata",
journal = " J. ACM",
volume = "49",
year = "2002",
pages = "496-511",
note = "Earlier version in 31st ACM STOC, 1999, pp. 376-383. [JACM:581771.581773, arXiv:quant-ph/9804043]"
}
@article{Amb03,
author = {A. Ambainis},
title = {Quantum walks and their algorithmic applications},
journal = {Journal of Quantum Information},
volume = {1},
year = {2003},
pages = {507--518}
}
@article{Amb07,
author = {A. Ambainis},
title = {Quantum walk algorithm for element distinctness},
journal = sicomp,
volume = {37},
year = {2007},
pages = {210--239}
}
@inproceedings{AmbosSpies84,
author = {K. Ambos-Spies},
title = {P-mitotic sets},
booktitle = {Logic and Machines, Lecture Notes in Computer Science 177},
year = {1984},
editor = {E. B{\"o}rger and G. Hasenj{\"a}ger and D. Roding},
publisher = {Springer-Verlag},
pages = {1--23}
}
@inproceedings{A-S85,
author = {K. Amb{os-Spies}},
title = {Three theorems on polynomial degrees of {NP} sets},
booktitle = proc26 # focs,
year = {1985},
pages = {51--55}
}
@article{A-S85b,
author = {K. Amb{os-Spies}},
title = {Sublattices of the polynomial time degrees},
journal = infcon,
volume = {65},
year = {1985},
pages = {63--84}
}
@article{A-S86,
author = {K. Amb{os-Spies}},
title = {A note on complete problems for complexity classes},
journal = ipl,
volume = {23},
year = {1986},
pages = {227--230}
}
@article{A-S86b,
author = {K. Amb{os-Spies}},
title = {Inhomogeneities in the polynomial-time degrees: the
degrees of super sparse sets},
journal = ipl,
volume = {22},
year = {1986},
pages = {nnn-nnn}
}
@incollection{A-S86c,
author = {K. Amb{os-Spies}},
title = {Minimal pairs for polynomial reducibilities},
booktitle = {R{\"o}dding Volume},
editor = {E. B\"orger},
series = lncs,
publisher = springer,
volume = {270},
year = {1986},
pages = {nnn--nnn}
}
@article{A-S86d,
author = {K. Amb{os-Spies}},
title = {An inhomogeneity in the structure of {Karp} degrees},
journal = sicomp,
volume = {15},
year = {1986},
pages = {nnn--nnn}
}
@inproceedings{A-S86e,
author = {K. Amb{os-Spies}},
title = {Relativizations, randomness, and polynomial reducibilities},
booktitle = {Proceedings, First Annual Conference on Structure
in Complexity Theory},
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {23--34}
}
@inproceedings{A-S87,
author = {K. Amb{os-Spies}},
title = {Honest polynomial reducibilities, recursively enumerable sets,
and the {P =? NP} problem},
booktitle = proc2 # structures,
year = {1987},
pages = {60--68}
}
@article{AFH87,
author = {K. Amb{os-Spies} and H. Fleischhack and H. Huwig},
title = {Diagonalizations over polynomial computable sets},
journal = tcs,
volume = {51},
year = {1987},
pages = {177--204}
}
@incollection{A-S88,
author = {K. Amb{os-Spies}},
title = {Polynomial time degrees of {NP}-sets},
booktitle = {Trends in Theoretical Computer Science},
publisher = {Computer Science Press},
editor = {E. B{\"o}rger},
year = {1988},
pages = {95--142}
}
@inproceedings{AFH88,
author = {K. Amb{os-Spies} and H. Fleischhack and H. Huwig},
title = {Diagonalizing over deterministic polynomial time},
booktitle = proc1 # csl,
series = lncs,
volume = {329},
publisher = springer,
year = {1988},
pages = {1--16},
note = {A full version is Forschungsbericht Nr. 1/88,
Fachbereich Informatik der Universit\"at Oldenburg}
}
@article{A-S89,
author = {K. Amb{os-Spies}},
title = {Honest polynomial time reducibilities and the
{P =? NP} problem},
journal = jcss,
volume = {39},
year = {1989},
pages = {nnn-nnn}
}
@article{A-S89b,
author = {K. Amb{os-Spies}},
title = {On the relative complexity of hard problems for complexity
classes without complete problems},
journal = tcs,
volume = {63},
year = {1989},
pages = {nnn--nnn}
}
@inproceedings{AHS92,
author = {K. Amb{os-Spies} and S. Homer and R. Soare},
title = {Minimal pairs and complete problems},
booktitle = proc9 # stacs,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1992},
pages = {nnn--nnn}
}
@inproceedings{ANT94,
author = {K. Amb{os-Spies} and H.-C. Neis and S. Terwijn},
title = {Genericity and measure for exponential time},
booktitle = proc19 # mfcs,
series = lncs,
volume = {841},
publisher = springer,
year = {1994},
pages = {221--232}
}
@inproceedings{ATX94,
author = {K. Amb{os-Spies} and S. Terwijn and Z. Xizhong},
title = {Resource bounded randomness and weakly complete problems},
booktitle = {Algorithms and Computation: Proceedings, ISAAC'94},
series = lncs,
volume = {834},
publisher = springer,
year = {1994},
pages = {369--377}
}
@misc{AmLe96,
author = {K. Ambos-Spies and S.~Lempp},
month = {July},
year = {1996},
note = {Presentation at a Schloss Dagstuhl workshop on
``Algorithmic Information Theory and Randomness''}
}
@article{AmGa88,
author = {A. Amir and W. Gasarch},
title = {Polynomial terse sets},
journal = infcon,
volume = {77},
year = {1988},
pages = {37--56}
}
@inproceedings{ABG90,
author = {A. Amir and R. Beigel and W. Gasarch},
title = {Some connections between bounded query classes
and nonuniform complexity},
booktitle = proc5 # structures,
year = {1990},
pages = {232--243}
}
@ARTICLE{AmTr92,
AUTHOR = {T. Amtoft and J.L. Tr\"aff},
TITLE = {Partial memoization for obtaining linear time behavior
of a {2DPDA}},
JOURNAL = tcs,
VOLUME = {98},
YEAR = {1992},
PAGES = {347--356}
}
@article{AnBr06,
author = {S. Anders and H. Briegel},
title = {Fast simulation of stabilizer circuits using a graph state representation},
journal = {Phys. Rev. A},
volume = {73},
number = {022334},
year = {2006}
}
@inproceedings{AHNR95,
author = {A. Andersson and T. Hagerup and S. Nilsson and R. Raman},
title = {Sorting in linear time?},
booktitle = proc27 # stoc,
year = {1995},
pages = {427--436}
}
@ARTICLE{AnVa79,
AUTHOR = {D. Angluin and L. Valiant},
TITLE = {Fast probabilistic algorithms for {H}amiltonian circuits and
matchings},
JOURNAL = jcss,
VOLUME = {18},
YEAR = {1979},
PAGES = {155--193}
}
@article{Ang80,
author = {D. Angluin},
title = {Counting problems and the polynomial-time hierarchy},
journal = tcs,
volume = {12},
year = {1980},
pages = {nnn--nnn}
}
@article{AnSm83,
author = {D. Angluin and C. Smith},
title = {Inductive inference: Theory and methods},
journal = {ACM Computing Surveys},
volume = {15},
year = {1983},
pages = {237--269}
}
@article{Ang87,
author = {D. Angluin},
title = {Learning regular sets from queries and counterexamples},
journal = infcomp,
volume = {75},
year = {1987},
pages = {87--106}
}
@article{Ang88,
author = {D. Angluin},
title = {Queries and concept learning},
journal = {Machine Learning},
volume = {2},
year = {1988},
pages = {319--342}
}
@inproceedings{Ang92,
author = {D. Angluin},
title = {Computational learning theory:\ survey and selected
bibliography},
booktitle = proc24 # stoc,
year = {1992},
pages = {351--369}
}
@article{AnAn93,
author = {I. Anshel and M. Anshel},
title = {From the {Post}-{Markov} theorem through decision problems
to public-key cryptography},
journal = {Amer. Math. Monthly},
volume = {100},
year = {1993},
month = {November},
pages = {835--844}
}
@book{App97c,
author = {A. Appel},
title = {Modern Compiler Implementation in C},
publisher = cup,
year = {1997},
}
@book{App97m,
author = {A. Appel},
title = {Modern Compiler Implementation in ML},
publisher = cup,
year = {1997},
}
@book{App97j,
author = {A. Appel},
title = {Modern Compiler Implementation in Java},
publisher = cup,
year = {1997},
}
@book{Arb68,
editor = {M. Arbib},
title = {Algebraic Theory of Machines, Languages, and Semigroups},
publisher = {Academic Press},
year = {1968}
}
@inproceedings{ArSa92,
author = {S. Arora and S. Safra},
title = {Probabilistic checking of proofs},
booktitle = proc33 # focs,
YEAR = {1992},
pages = {2--13}
}
@inproceedings{ALMSS92,
author = {S. Arora and C. Lund and R. Motwani and M. Sudan
and M. Szegedy},
title = {Proof verification and hardness of approximation problems},
booktitle = proc33 # focs,
year = {1992},
pages = {14--23}
}
@incollection{ArLu96,
author = {S. Arora and C. Lund},
title = {Hardness of approximations},
booktitle = {Approximation Algorithms for {NP}-Hard Problems},
editor = {D. Hochbaum},
publisher = {PWS Publishing},
year = {1996}
}
@article{AS97,
author = "Sanjeev Arora and Madhu Sudan",
title = "Improved Low-Degree Testing and its Applications",
journal = "Combinatorica"
, volume = 23,
number = 3,
year = 2003,
pages = "365--426"
}
@article{ALMSS98,
author = {S. Arora and C. Lund and R. Motwani and M. Sudan
and M. Szegedy},
title = {Proof verification and hardness of approximation problems},
journal = jacm,
volume= {45},
year = {1998},
pages = {501--555}
}
@article{ArSa98,
author = {S. Arora and S. Safra},
title = {Probabilistic checking of proofs: a new characterization
of {NP}},
journal = jacm,
volume= {45},
year = {1998},
pages = {70--122}
}
@inproceedings{AKKSTV08,
author = {S. Arora and S. Khot and A. Kolla and D. Steurer and
M. Tulsiani and N. Vishnoi},
title = {Unique games on expanding constraint graphs are easy},
booktitle = proc40 # stoc,
year = {2008},
pages = {21--28}
}
@InProceedings{ASW09,
author={Sanjeev Arora, David Steurer and Avi Wigderson},
title={Towards a study of low-complexity graphs},
booktitle = proc36 # icalp,
year={2009},
pages={}
}
@techreport{AIMS10,
author = {S. Arora and R. Impagliazzo and W. Matthews and D. Steurer},
title = {Improved algorithms for unique games via divide and conquer},
institution = eccc,
number = {ECCC TR 2010-41},
year = {2010}
}
@misc{ABS10,
author = {S. Arora and B. Barak and D. Steurer},
title = {Subexponential algorithms for unique games and related
problems},
year = {2010}
}
@inproceedings{Ars87},
author = {M. Arslanov},
title = {The {R}ecursion {T}heorem, approximations, and
classifying index sets of recursively enumerable sets},
booktitle = proc6 # fct,
publisher = springer,
series = lncs,
volume = {nnn}
year = {1987},
pages = {34--37}
}
@techreport{AKM92,
author = {V. Arvind and J. K{\"o}bler and M. Mundhenk},
title = {Reliable reductions, high sets and low sets},
number = {Nr.\ 92-12},
institution = {Informatik, Universit{\"a}t Ulm},
year = {1992}
}
@inproceedings{ArKu02,
author = {V. Arvind and P. Kurur},
title = {Graph isomorphism is in {SPP}},
booktitle = proc43 # focs,
year = {2002},
pages = {743--750},
note = {Also ECCC TR02-037}
}
@misc{Ask14,
author = {Jonatan Asketorp},
title = {Attacking {RSA} moduli with {SAT} solvers},
school = {KTH, Stockholm},
year = {2014},
note = {Degree project}
}
@inproceedings{ABFR91,
author = {J. Aspnes and R. Beigel and M. Furst and S. Rudich},
title = {The expressive power of voting polynomials},
booktitle = proc33 # focs,
year = {1991},
pages = {402--409}
}
@article{ABFR94,
author = {J. Aspnes and R. Beigel and M. Furst and S. Rudich},
title = {The expressive power of voting polynomials},
journal = {Combinatorica},
volume = {14},
year = {1994},
pages = {1--14}
}
@inproceedings{ABDORU10,
author="Jim Aspnes and Eric Blais and Murat Demirbas and Ryan O'Donnell and Atri Rudra and Steve Uurtamo",
title="$k^+$ decision trees",
booktitle="Proceedings of 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)",
year="2010",
note="To appear"
}
@InBook{AsKe98,
AUTHOR = {Assumus Jr., E. F. and Key, J. D. },
TITLE = {{Polynomial codes and Finite Geometries in Handbook of Coding Theory, Vol II }, Edited by V. S. Pless Jr., and W. C. Huffman},
CHAPTER = {16},
PUBLISHER = {Elsevier},
year = {1998},
file = F
}
@article{AtVi84,
author = {M. Atallah and U. Vishkin},
title = {Finding {Euler} tours in parallel},
journal = jcss,
volume = {29},
year = {1984},
pages = {330--337}
}
@article{ACG89,
author = {M. Atallah and R. Cole and M. Goodrich},
title = {Cascading divide-and-conquer: A technique for designing
parallel algorithms},
journal = sicomp,
volume = {18},
year = {1989},
pages = {499--532}
}
@article{Ata92,
author = {A. Atanasiu},
title = {A class of coders based on gsm},
journal = {Acta Informatica},
volume = {29},
year = {1992},
pages = {779--791}
}
@article{AuMi70,
author = {G. Auguston and J. Minker},
title = {An analysis of some graph-theoretical clustering techniques},
journal = jacm,
volume = {17},
number = {4},
year = {1970},
pages = {571--588}
}
@article{ABK92,
author = {A. Averbuch and N. Bshouty and M. Kaminski},
title = {A classification of algorithms for multiplying polynomials of
small degree over finite fields},
journal = {J. Algorithms},
volume = {13},
year = {1992},
pages = {577--588}
}
@INPROCEEDINGS{Bab85,
AUTHOR = {L. Babai},
TITLE = {Trading group theory for randomness},
BOOKTITLE = proc17 # stoc,
YEAR = {1985},
PAGES = {421--429}
}
@ARTICLE{Bab87,
AUTHOR = {L. Babai},
TITLE = {Random oracles separate {PSPACE} from the polynomial-time
hierarchy},
JOURNAL = ipl,
YEAR = {1987},
VOLUME = {26},
PAGES = {51--53}
}
@ARTICLE{BaMo88,
AUTHOR = {L. Babai and S. Moran},
TITLE = {Arthur-{M}erlin Games: A randomized proof system, and
a hierarchy of complexity classes},
JOURNAL = jcss,
VOLUME = {36},
YEAR = {1988},
PAGES = {254--276}
}
@inproceedings{BNS89,
author = {L. Babai and N. Nisan and M. Szegedy},
title = {Multiparty protocols and logspace-hard pseudorandom
sequences},
booktitle = proc21 # stoc,
year = {1989},
pages = {1--11}
}
@inproceedings{BaFo90,
author = {L. Babai and L. Fortnow},
title = {A characterization of {\#P} by arithmetic straight-line
programs},
booktitle = proc31 # focs,
year = {1990},
pages = {26--34}
}
@inproceedings{BFLS91,
author = {L. Babai and L. Fortnow and L. Levin and M. Szegedy},
title = {Checking computations in polylogarithmic time},
booktitle = proc23 # stoc,
year = {1991},
pages = {21--31}
}
@Article{BFL91,
author = "L. Babai and L. Fortnow and C. Lund",
title = "Nondeterministic Exponential Time has Two-Prover Interactive
Protocols",
journal = compcomp,
volume = "1",
pages = "3--40",
year = "1991",
note = {Addendum in vol.\ 2 of same journal}
}
@inproceedings{Bab93,
author = {L. Babai},
title = {Transparent (holographic) proofs},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {525--534}
}
@Article{BFNW93,
author = "L. Babai and L. Fortnow and N. Nisan and A. Wigderson",
title = "{BPP} Has Subexponential Time Simulations Unless
{EXPTIME} Has Publishable Proofs",
journal = compcomp,
volume = "3",
year = "1993",
pages = "307--318",
}
@InProceedings{Bab97,
title = "The growth rate of vertex-transitive planar graphs",
author = "L. Babai",
pages = "564--573",
booktitle = "Proceedings of the Eighth Annual {ACM}-{SIAM}
Symposium on Discrete Algorithms",
month = "5--7 " # jan,
year = "1997",
address = "New Orleans, Louisiana",
}
@techreport{BGI91,
author = {E. Bach and M. Giesbrecht and J. McInnes},
title = {The complexity of number theoretic problems},
institution = {University of Toronto, Department of Computer Science},
number = {247/91},
year = {1991}
}
@article{BDS93,
author = {E. Bach and J. Driscoll and J. Shallit},
title = {Factor refinement},
journal = jalg,
volume = {15},
year = {1993},
pages = {199--222}
}
@InProceedings{Bac17,
author = {M. Backens},
title = {A New Holant Dichotomy Inspired by Quantum Computation},
booktitle = proc44 # icalp,
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
year = {2017},
}
@InProceedings{Bac18,
author = {M. Backens},
title = {A Complete Dichotomy for Complex-Valued {H}olant{${}^c$}},
booktitle = proc45 # icalp,
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
year = {2018},
volume = {107},
}
@misc{BvDR08,
author = {D. Bacon and W. van Dam and A. Russell},
title = {Analyzing algebraic quantum circuits using exponential sums},
year = {2008},
month = {November},
howpublished = {http://www.cs.ucsb.edu/~vandam/LeastAction.pdf}
}
@article{Bak79,
author = {T. Baker},
title = {On `provable' analogs of {P} and {NP}},
journal = mst,
volume = {12},
year = {1979},
pages = {213--218}
}
@article{BGS75,
author = {T. Baker and J. Gill and R. Solovay},
title = {relativizations of the {P=NP?} question},
journal = sicomp,
volume = {4},
year = {1975},
pages = {431--442}
}
@article{BaYu86,
author = {E. Balas and C. Yu},
title = {Finding a maximum clique in an arbitrary graph},
journal = sicomp,
volume = {15},
year = {1986}
}
@article{BaSc85,
author = {J. Balc{\'a}zar and U. Sch{\"o}ning},
title = {Bi-immune sets for complexity classes},
journal = mst,
volume = {18},
year = {1985},
pages = {1--10}
}
@article{BBS86a,
author = {J. Balc{\'a}zar and R. Book and U. Sch{\"o}ning},
title = {Sparse sets, lowness, and highness},
journal = sicomp,
volume = {15},
year = {1986},
pages = {739--747}
}
@article{BBS86b,
author = {J. Balc{\'a}zar and R. Book and U. Sch{\"o}ning},
title = {The polynomial-time hierarchy and sparse oracles},
journal = jacm,
volume = {33},
year = {1986},
pages = {603--617}
}
@inproceedings{Bal88,
author = {J. Balc{\'a}zar},
title = {Logspace self-reducibility (extended abstract)},
booktitle = proc3 # structures,
year = {1988},
pages = {40--46}
}
@BOOK{BDG88,
AUTHOR = {J. Balc{\'a}zar and J. D{\'\i}az and J. Gabarr{\'o}},
TITLE = {Structural Complexity I},
PUBLISHER = springer,
YEAR = {1988}
}
@book{BDG90,
AUTHOR = {J. Balc{\'a}zar and J. D{\'\i}az and J. Gabarr{\'o}},
TITLE = {Structural Complexity II},
PUBLISHER = springer,
YEAR = {1990}
}
@book{BDG,
AUTHOR = {J. Balc{\'a}zar and J. D{\'\i}az and J. Gabarr{\'o}},
TITLE = {Structural Complexity I,II},
PUBLISHER = springer,
YEAR = {1990},
note = {Part I published in 1988}
}
@article{Bal90,
author = "J. Balc\'{a}zar",
title = "Self-Reducibility Structures and solutions of
{N}{P} problems",
year = "1990",
month = "Dec.",
journal = "Rivesta Matematica",
volume = "4",
number = "4",
pages = "175-184"
}
@article{Bal90sr,
author = {J. Balc{\'a}zar},
title = {Self-Reducibility},
journal = jcss,
volume = {41},
year = {1990},
pages = {367--388}
}
@techreport{BGS93,
author = {J. Balc\'{a}zar and R. Gavald{\'a} and H. Siegelmann},
title = {Computational power of neural networks: a {K}olmogorov
complexity characterization},
institution = {Dpto. LSI, Universitat Polit{\'e}cnica de Catalunya,
Barcelona},
number = {nnn},
month = {December},
year = {1993}
}
@misc{BaSh92,
author = {G. Baliga and A. Shende},
title = {All acceptable programming systems provide good control
structures},
year = {1992}
}
@misc{BaSh93,
author = {G. Baliga and A. Shende},
title = {On space-bounded server algorithms},
year = {1993}
}
@misc{BaSh93b,
author = {G. Baliga and A. Shende},
title = {How far do finitary recursion theorems go?},
year = {1993}
}
@techreport{BaRa94,
author = {D. Ballard and R. Rao},
title = {Seeing behind occlusions},
institution = {Computer Science, University of Rochester},
number = {487},
month = {February},
year = {1994}
}
@inproceedings{BGLMNR10,
author = {Nikhil Bansal and Anupam Gupta and Jian Li and Juli{\'a} Mestre and Viswanath Nagarajan and Atri Rudra},
title = {When LP Is the Cure for Your Matching Woes: Improved Bounds
for Stochastic Matchings - (Extended Abstract)},
booktitle = {ESA (2)},
year = {2010},
pages = {218-229},
ee = {http://dx.doi.org/10.1007/978-3-642-15781-3_19},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@INPROCEEDINGS{BJK04,
author="Z. Bar-Yossef and T. S. Jayram and I. Kerenidis",
title = "Exponential separation of quantum and classical one-way communication complexity",
booktitle = "36th ACM STOC",
year = "2004",
pages = "128-137",
note = "[STOC:1007352.1007379, ECCC:TR04-036]"
}
@ARTICLE{BDEJ95,
author = "A. Barenco and D. Deutsch and A. Ekert and R. Jozsa",
title = "Conditional quantum dynamics and logic gates",
journal = "Physical Review Letters",
volume = "74(20)",
year = "1995",
pages = "4083-4086"
}
@ARTICLE{BBCDMSSSW95,
author = "A. Barenco and C.H. Bennett and R. Cleve and D.P. DiVincenzo and N. Margolus and P.W. Shor and T. Sleator and J.A. Smolin and H. Weinfurter",
title = "Elementary gates for quantum computation",
journal = "Phys. Rev. A",
volume = "52(5)",
year = "1995",
pages = "3457-3467"
}
@article{BEST96,
author = {A. Barenco and A. Ekert and K.-A. Suominen and P. T{\"o}rm{\"a}},
title = {Approximate quantum {F}ourier transform and decoherence},
journal = {Phys. Rev. A},
volume = {54},
year = {1996},
pages = {139--146}
}
@book{Bar84,
author = {H. Barendregt},
title = {The Lambda Calculus: Its Syntax and Semantics},
publisher = {North Holland Publishing Co., Amsterdam},
year = {1984}
}
@incollection{Bar94,
author = {H. Barendregt},
title = {Functional programming and lambda calculus},
booktitle = {Handbook of Theoretical Computer Science},
volume = {B},
editor = {J.~van Leeuwen},
publisher = {Elsevier and MIT Press},
year = {1994},
pages = {320--363}
}
@article{BCEMR94,
author = {B. Barkee and D.-C. Can and J. Ecks and T. Moriarty
and R. Ree},
title = {Why you cannot even hope to use {Gr{\"o}bner} bases
in public key cryptography: An open letter to a scientist who failed
and a challenge to those who have not yet failed},
journal = {Journal of Symbolic Computation},
volume = {18},
year = {1994},
pages = {497--501}
}
@inproceedings{BaRu91,
author = {G. Barnes and W. Ruzzo},
title = {Determinitsic algorithms for undirected s-t connectivity
using polynomial time and sublinear space},
booktitle = proc23 # stoc,
year = {1991},
pages = {43--53}
}
@misc{BBRS94,
author = {G. Barnes and J. Buss and W. Ruzzo and B. Schieber},
title = {A sublinear space, polynomial time algorithm for
directed {$s$-$t$} connectivity},
month = {May},
year = {1994}
}
@inproceedings{Bar86,
author = {D. Mix Barrington},
title = {Bounded-width polynomial-size branching programs
recognize exactly those languages in {NC$^1$}},
booktitle = proc18 # stoc,
year = {1986},
pages = {1--5}
}
@article{Bar89,
author = {D. Mix Barrington},
title = {Bounded-width polynomial-size branching programs
recognize exactly those languages in {NC$^1$}},
journal = jcss,
volume = {38},
year = {1989},
pages = {150--164}
}
@article{Bar90,
author = {D. Mix Barrington},
title = {Extensions of an idea of {McNaughton}},
journal = mst,
volume = {23},
year = {1990},
pages = {147--164}
}
@INPROCEEDINGS{BIS88,
AUTHOR = {D. Mix Barrington and N. Immerman and H. Straubing},
TITLE = {On uniformity within {NC$^1$}},
BOOKTITLE = proc3 # structures,
YEAR = {1988},
PAGES = {47--59}
}
@article{BIS90,
AUTHOR = {D. Mix Barrington and N. Immerman and H. Straubing},
TITLE = {On uniformity within {NC$^1$}},
journal = jcss,
volume = {41},
year = {1990},
pages = {274--306}
}
@article{BST90,
author = {D. Mix Barrington and H. Straubing and D. Th{\'e}rien},
title = {Non-uniform automata over groups},
journal = infcomp,
volume = {89},
year = {1990},
pages = {109--132}
}
@article{BaTh88,
author = {D. Mix Barrington and D. Th{\'e}rien},
title = {Finite monoids and the fine structure of {NC$^1$}},
journal = jacm,
volume = {35},
year = {1988},
pages = {941--952}
}
@article{BaCo89,
author = {D. Mix Barrington and J. Corbett},
title = {On the relative complexity of some languages in {NC$^1$}},
journal = ipl,
volume = {32},
year = {1989},
pages = {251--256}
}
@article{BaCo91,
author = {D. Mix Barrington and J. Corbett},
title = {A note on some languages in uniform {ACC$^0$}},
journal = tcs,
volume = {78},
year = {1991},
pages = {357--362}
}
@article{BaMcK91,
author = {D. Mix Barrington and P. McKenzie},
title = {Oracle branching programs and {L}ogspace versus {P}},
journal = infcon,
volume = {95},
year = {1991},
pages = {96--115}
}
@inproceedings{BaSt91,
author = {D. Mix Barrington and H. Straubing},
title = {Superlinear lower bounds for bounded-width branching
programs},
booktitle = proc6 # structures,
year = {1991},
pages = {305--313}
}
@techreport{BaSt91b,
author = {D. Mix Barrington and H. Straubing},
title = {Complex polynomials and circuit lower bounds for
modular counting},
institution = {Boston College, Computer Science Dept.},
number = {BCCS-91-5},
month = {June},
year = {1991}
}
@article{BCST92,
author = {D. Mix Barrington and K. Compton and H. Straubing and
D. Th{\'e}rien},
title = {Regular languages in {NC$^1$}},
journal = jcss,
volume = {44},
year = {1992},
pages = {478--499}
}
@incollection{Bar92,
author = {D. Mix Barrington},
title = {Some problems involving {R}azborov-{S}molensky polynomials},
booktitle = {Boolean Function Complexity},
editor = {M. Paterson},
series = {LMS Lecture Note Series},
volume = {169},
publisher = lms,
year = {1992},
note = {Proceedings of an LMS Symposium in Durham, July 1990},
pages = {109--128}
}
@inproceedings{Bar92q,
author = {D. Mix Barrington},
title = {Quasipolynomial size circuit classes},
booktitle = proc7 # structures,
year = {1992},
pages = {86--93}
}
@inproceedings{BBR92,
author = {D. Mix Barrington and R. Beigel and S. Rudich},
title = {Representing {B}oolean functions as polynomials modulo
composite numbers},
booktitle = proc24 # stoc,
year = {1992},
pages = {455-461}
}
@article{BBR94,
author = {D. Mix Barrington and R. Beigel and S. Rudich},
title = {Representing {B}oolean functions as polynomials modulo
composite numbers},
journal = compcomp,
volume = {4},
year = {1994},
pages = {367--382}
}
@inproceedings{BaIm94,
author = {D. Mix Barrington and N. Immerman},
title = {Time, hardware, and uniformity},
booktitle = proc9 # structures,
year = {1994},
pages = {176--185},
note = {Final version to appear in L.~Hemaspaandra and
A.~Selman, eds., {\it Complexity Theory Retrospective II\/},
Springer Verlag, 1996}
}
@article{BaSt94,
author = {D. Mix Barrington and H. Straubing},
title = {Complex polynomials and circuit lower bounds for
modular counting},
journal = compcomp,
volume = {4},
year = {1994},
pages = {325--338}
}
@article{BaSt95,
author = {D. Mix Barrington and H. Straubing},
title = {Superlinear lower bounds for bounded-width branching
programs},
journal = jcss,
volume = {50},
year = {1995},
pages = {374--381}
}
@incollection{BaIm96,
author = {D. Mix Barrington and N. Immerman},
title = {Time, hardware, and uniformity},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
note = {In press}
}
@incollection{BaIm97,
author = {D. Mix Barrington and N. Immerman},
title = {Time, hardware, and uniformity},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
note = {In press}
}
@article{BaEt89,
author = "J. Barwise and J. Etchemendy",
title = "Creating Courseware",
journal = "Notices of the American Mathematical
Society",
volume = "36",
year = "1989",
}
@article{BCKO93,
author = {R. Bar-Yehuda and B. Chor and E. Kushilevitz and
A. Orlitsky},
title = {Privacy, additional information, and communication},
journal = itit,
volume = {39},
year = {1993},
pages = {1930--1943}
}
@inproceedings{BaMa93,
author = {D. Basin and S. Matthews},
title = {A conservative extension of first-order logic
and its applications to theorem proving},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {151--160}
}
@article{BaSt82,
author = {W. Baur and V. Strassen},
title = {The complexity of partial derivatives},
journal = tcs,
volume = {22},
year = {1982},
pages = {317--330}
}
@article{BaSt88,
author = {D. Bayer and M. Stillman},
title = {On the complexity of copmputing syzygies},
journal = {Journal of Symbolic Computation},
volume = {6},
year = {1988},
pages = {135--147}
}
@incollection{BaMu93,
author = {D. Bayer and D. Mumford},
title = {What can be computed in algebraic geometry?},
booktitle = {Computational Algebraic Geometry and Commutative Algebra,
Cortona, 1991},
editor = {D. Eisenbud and L. Robbiano},
publisher = {Cambriddge University Press},
year = {1993},
pages = {1--48}
}
@article{BCH86,
author = {P. Beame and S. Cook and H. Hoover},
title = {Log depth circuits for divison and related problems},
journal = sicomp,
volume = {15},
year = {1986},
pages = {994--1003}
}
@inproceedings{Bea89,
author = {P. Beame},
title = {A general sequential time-space tradeoff for finding
unique elements},
booktitle = proc21 # stoc,
year = {1989},
pages = {197--203}
}
@article{Bea91,
author = {P. Beame},
title = {A general sequential time-space tradeoff for finding
unique elements},
journal = sicomp,
volume = {20},
year = {1991},
pages = {270--277}
}
@article{BBL92,
author = {P. Beame and E. Brisson and R. Ladner},
title = {The complexity of computing symmetric functions using
threshold circuits},
journal = tcs,
volume = {100},
year = {1992},
pages = {253--265}
}
@inproceedings{BIKPP94,
author = {P. Beame and R. Impagliazzo and J. Krajicek and
T. Pitassi and P. Pudlak},
title = {Lower bounds on {H}ilbert's {N}ullstellensatz
and propositional proofs},
booktitle = proc35 # focs,
year = {1994},
pages = {794--806}
}
@techreport{BST98,
author = {P. Beame and M. Saks and J. Thathatchar},
title = {Time-space tradeoffs for branching programs},
institution = eccc,
number = {ECCC TR98-053},
month = {September},
year = {1998},
note = {Corrected version. Also appeared in the proceedings
of the 40th IEEE FOCS, 1998, pages 254--263}
}
@techreport{BSSV00,
author = {P. Beame and M. Saks and X. Sun and E. Vee},
title = {Super-linear time-space tradeoff lower bounds for
randomized computation},
institution = eccc,
number = {ECCC TR00-025},
month = {May},
year = {2000}
}
@inproceedings{Bea87,
author = {M. Beaudry},
title = {Testing membership in commutative transformation semigroups},
booktitle = proc14 # icalp,
series = lncs,
publisher = springer,
volume = {nnn},
year = {1987},
pages = {nnn--nnn}
}
@article{Bea88,
author = {M. Beaudry},
title = {Testing membership in commutative transformation semigroups},
journal = {infcon},
volume = {79},
year = {1988},
pages = {nnn--nnn}
}
@inproceedings{BKP93,
author = {M. Beaudry and P. McKenzie and P. P{\'e}ladeau},
title = {Circuits with monoidal gates},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {555--565}
}
@article{BeMcK95,
author = {M. Beaudry and P. McKenzie},
title = {Circuits, matrices, and non-associative computation},
journal = jcss,
volume = {50},
year = {1995},
pages = {441--455}
}
@ARTICLE{Bea03,
author = {S. Beauregard},
title = {Circuit for Shor's algorithm using 2n+3 qubits},
journal = {Quantum Information and Computation},
volume = {3},
pages = {175},
url = {http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/0205095},
year = {2003}
}
@book{BW93,
author = {T. Becker and V. Weispfenning},
title = {Gr{\"o}bner Bases: A Computational Approach to
Commutative Algebra},
publisher = springer,
series = gtm,
volume = {141},
year = {1993}
}
@article{BCDP96,
author = {D. Beckman and A.N. Chari and S. Devabhaktuni and J. Preskill},
title = {Efficient networks for quantum factoring},
journal = {Phys. Rev. A},
volume = {54},
year = {1996},
pages = {1034--1063}
}
@article{BLM93,
author = {F. B{\'e}dard and F. Lemieux and P McKenzie},
title = {Extensions to {B}arrington's {M}-program model},
journal = tcs,
volume = {107},
year = {1993},
pages = {31--61}
}
@article{BCLT08,
author = {E. Beggs and J. Costa and B. Loff, and J.V. Tucker},
title = {Computational complexity with experiments as oracles},
journal = {Proc. Royal Soc. A},
volume = {464},
number = {2098},
year = {2008}
}
@inproceedings{Bei87,
author = {R. Beigel},
title = {A structural theorem that depends quantitatively
on the complexity of {SAT}},
booktitle = proc2 # structures,
year = {1987},
pages = {28--32}
}
@phdthesis{Bei87t,
author = {R. Beigel},
title = {Query-limited reducibilities},
school = {Stanford University},
year = {1987}
}
@article{BGH89,
author = {R. Beigel and W. Gasarch and L. Hay},
title = {Bounded query classes and the difference hierarchy},
journal = {Archive for Mathematical Logic},
volume = {29},
year = {1989},
pages = {69--84}
}
@article{Bei91,
author = {R. Beigel},
title = {Bounded queries to {SAT} and the {B}oolean hierarchy},
journal = tcs,
volume = {83},
year = {1991},
pages = {199--223}
}
@inproceedings{BBFG91,
author = {R. Beigel and M. Bellare and J. Feigenbaum and
S. Goldwasser},
title = {Languages that are easier than their proofs},
booktitle = proc32 # focs,
year = {1991},
pages = {19--28}
}
@inproceedings{BeigelBellareFeigenbaumGoldwasser91,
author = {R. Beigel and M. Bellare and J. Feigenbaum and
S. Goldwasser},
title = {Languages that are easier than their proofs},
booktitle = proc32 # focs,
year = {1991},
pages = {19--28}
}
@techreport{Bei92,
author = {R. Beigel},
title = {Communicating with low-diffraction lasers and mirrors},
institution = {ICSI, Berkeley},
number = {TR-92-024},
year = {1992}
}
@inproceedings{Bei92b,
author = {R. Beigel},
title = {When do extra majority gates help? {P}olylog($n$)
majority gates are equivalent to one},
booktitle = proc24 # stoc,
year = {1992},
pages = {450--454}
}
@book{BF93,
author = {R. Beigel and R. Floyd},
title = {Machines, Languages, and Computation},
publisher = {Pitman},
year = {1993}
}
@inproceedings{BeTa91,
author = {R. Beigel and J. Tarui},
title = {On {ACC}},
booktitle = proc32 # focs,
year = {1991},
pages = {783--792}
}
@inproceedings{BRS91,
author = {R. Beigel and N. Reingold and D. Spielman},
title = {The perceptron strikes back},
booktitle = proc6 # structures,
year = {1991},
pages = {286--291}
}
@inproceedings{BRS91b,
author = {R. Beigel and N. Reingold and D. Spielman},
title = {{PP} is closed under intersection},
booktitle = proc23 # stoc,
year = {1991},
pages = {1--9}
}
@inproceedings{BTT92,
author = {R. Beigel and J. Tarui and S. Toda},
title = {On probabilistic {ACC} circuits with an exact threshold gate},
booktitle = proc3 # "Annual International Symposium on Algorithms and Computation",
publisher = springer,
series = lncs,
volume = {650},
year = {1992},
pages = {420--429}
}
@article{BeFe92,
author = {R. Beigel and J. Feigenbaum},
title = {On being incoherent without being very hard},
journal = {Computational Complexity},
volume = {2},
year = {1992},
pages = {1--17}
}
@article{BeGi92,
author = {R. Beigel and J. Gill},
title = {Counting classes: thresholds, parity, modes, and fewness},
journal = tcs,
volume = {103},
year = {1993},
pages = {293--310}
}
@inproceedings{Bei93,
author = {R. Beigel},
title = {The polynomial method in circuit complexity},
booktitle = proc8 # structures,
year = {1993},
pages = {82--95},
note = {Revised version, 1995}
}
@article{BCO93,
author = {R. Beigel and R. Chang and M. Ogiwara},
title = {A relationship between difference hierarchies and
relativized polynomial hierarchies},
journal = mst,
volume = {26},
year = {1993},
pages = {150--164}
}
@article{BGGO93,
author = {R. Beigel and W. Gasarch and J. Gill and C. Owings},
title = {Terse, superterse, and verbose sets},
journal = infcomp,
volume = {103},
year = {1993},
pages = {68--85}
}
@inproceedings{BKS92,
author = {R. Beigel and M. Kummer and F. Stephan},
title = {Quantifying the amount of verboseness},
booktitle = {Logical Foundations of Computer Science---Tver '92},
series = lncs,
volume = {620},
publisher = springer,
year = {1992},
pages = {21--32}
}
@unpublished{BKS93,
author = "R. Beigel and M. Kummer and F. Stephan",
title = "Approximable sets",
year = "1993",
note = "manuscript",
annote = "",
key = ""
}
@inproceedings{BKS94,
author = {R. Beigel and M. Kummer and F. Stephan},
title = {Approximable sets},
booktitle = proc9 # structures,
year = {1994},
pages = {12--23}
}
@article{Bei94a,
author = {R. Beigel},
title = {Perceptrons, {PP}, and the polynomial hierarchy},
journal = compcomp,
volume = {4},
year = {1994},
pages = {339--349}
}
@article{Bei94b,
author = {R. Beigel},
title = {When do extra majority gates help? polylog(n) majority
gates are equivalent to one},
journal = compcomp,
volume = {4},
year = {1994},
pages = {314--324}
}
@inproceedings{BeGo94,
author = {R. Beigel and J. Goldsmith},
title = {Downward separation fails catastrophically for
limited nondeterminism classes},
booktitle = proc9 # structures,
year = {1994},
pages = {134--138}
}
@article{BeTa94,
author = {R. Beigel and J. Tarui},
title = {On {ACC}},
journal = compcomp,
volume = {4},
year = {1994},
pages = {350--366}
}
@article{BRS95,
author = {R. Beigel and N. Reingold and D. Spielman},
title = {{PP} is closed under intersection},
journal = jcss,
volume = {50},
year = {1995},
pages = {191--202}
}
@techreport{BBF97,
author = {R. Beigel and H. Buhrman and L. Fortnow},
title = {{NP} might not be as easy as detecting unique solutions},
institution = {Department of Computer Science, University of Chicago},
number = {CS 79-02},
year = {1997}
}
@techreport{BPW96,
author = {J. Belanger and A. Pavan and J. Wang},
title = {Reductions do not preserve fast convergence rates in
average time},
institution = {Department of Computer Science, University at Buffalo},
number = {TR 96-21},
month = {November},
year = {1996}
}
@inproceedings{BGS95,
author = {M. Bellare and O. Goldreich and M. Sudan},
title = {Free bits, {PCP}s, and non-approximability---towards
tight results},
booktitle = proc36 # focs,
year = {1995},
pages = {422--431}
}
@book{BM77,
author = {J. Bell and M. Machover},
title = {A First Course in Mathematical Logic},
publisher = {North-Holland},
address = {Amsterdam},
year = {1977}
}
@inproceedings{BeGo92,
author = {M. Bellare and O. Goldreich},
title = {On defining proofs of knowledge},
booktitle = {Proceedings, CRYPTO'92},
year = {1992},
pages = {390--420}
}
@inproceedings{BGLR93,
author = {M. Bellare and S. Goldwasser and C. Lund and A. Russell},
title = {Efficient probabilistically checkable proofs and
applications to approximation},
booktitle = proc25 # stoc,
year = {1993},
pages = {294--304}
}
@inproceedings{BeSu94,
author = {M. Bellare and M. Sudan},
title = {Improved non-approximability results},
booktitle = proc26 # stoc,
year = {1994},
pages = {184--193}
}
@article{Bel91,
author = {S. Bellantoni},
title = {Parallel random access machines with bounded
memory wordsize},
journal = infcomp,
volume = {91},
year = {1991},
pages = {259--273}
}
@inproceedings{BeGa88,
author = {A. {Ben-Amram} and Z. Galil},
totle = {On pointers versus addresses},
booktitle = proc29 # focs,
year = {1988},
pages = {532--538}
}
@inproceedings{BeGa91,
author = {A. {Ben-Amram} and Z. Galil},
title = {Lower bounds for data structure problems on {RAMs}},
booktitle = proc32 # focs,
year = {1991},
pages = {622--631}
}
@article{BeGa92,
author = {A. {Ben-Amram} and Z. Galil},
title = {On pointers versus addresses},
journal = jacm,
volume = {39},
year = {1992},
pages = {617--648}
}
@inproceedings{BCGL89,
author = {S. {Ben-David} and B. Chor and O. Goldreich and M. Luby},
title = {On the theory of average-case complexity},
booktitle = proc21 # stoc,
year = {1989},
pages = {204--216}
}
@misc{BeHa91,
author = {S. {Ben-David} and S. Halevi},
title = {On the independence of {P} and {NP}},
institution = {Computer Science, Technion, Haifa},
year = {1991}
}
@Article{BCGL92,
title = "On the Theory of Average Case Complexity",
author = "S. Ben-David and B. Chor and O. Goldreich and
M. Luby",
pages = "193--219",
journal = jcss,
year = "1992",
volume = "44",
}
@article{Ben82,
author = {P. Benioff},
title = {Quantum mechanical hamiltonian models of {T}uring
machines},
journal = {Journal of Statistical Physics},
volume = {29},
year = {1982},
pages = {515--546}
}
@ARTICLE{Ben82b,
author = "P. Benioff",
title = "Quantum mechanical models of Turing machines that dissipate no energy",
journal = "Physical Review Letters",
volume = "48(23)",
year = "1982",
pages = "1581-1585"
}
@ARTICLE{BG81,
AUTHOR = {C. Bennett and J. Gill},
TITLE = {Relative to a random oracle {$A$},
{$\P^A \neq \NP^A \neq \coNP^A$} with probability 1},
JOURNAL = sicomp,
YEAR = {1981},
VOLUME = {10},
PAGES = {96--113}
}
@ARTICLE{BeGi81,
AUTHOR = {C. Bennett and J. Gill},
TITLE = {Relative to a random oracle {$A$},
{$\P^A \neq \NP^A \neq \coNP^A$} with probability 1},
JOURNAL = sicomp,
YEAR = {1981},
VOLUME = {10},
PAGES = {96--113}
}
@INPROCEEDINGS{BBBW82,
author = "C. H. Bennett and G. Brassard and S. Breidbart and S. Wiesner",
title = "Quantum cryptography, or unforgetable subway tokens",
booktitle = "Advances in Cryptology: Proceedings of Crypto 82",
publisher = "Plenum Press",
month = "August",
year = "1982",
pages = "267-275"
}
@unpublished{BBB82,
author = "C. H. Bennett and G. Brassard and S. Breidbart",
title = "Quantum cryptography II: How to re- use a one-time pad safely even if P = N P",
month = "November",
year = "1982",
note = "Unpublished Manuscript"
}
@INPROCEEDINGS{BeBr83,
author = "C. H. Bennett and G. Brassard",
title = "Quantum cryptography and its application to provably secure key expansion, public-key distribution, and coin-tossing",
booktitle = "IEEE International Symposium on Information Theory",
month = "September",
year = "1983",
pages = "91"
}
@ARTICLE{BBBW84,
author = "C. H. Bennett and G. Brassard and S. Breidbart and S. Wiesner",
title = "Eavesdrop-detecting quantum communications channel",
journal = "IBM Technical Disclosure Bulletin",
month = "January",
year = "1984",
volume= "26(8)",
pages = "4363-4366"
}
@INPROCEEDINGS{BeBr84,
author = "C. H. Bennett and G. Brassard",
title = "Quantum cryptography: Public-key distribution and coin tossing",
booktitle = "Proceedings of IEEE International Conference on Computers, Systems and Signal Processing",
month = "December",
year = "1984",
pages = "175-179"
}
@ARTICLE{BeBr85,
author = "C. H. Bennett and G. Brassard",
title = "Quantum public key distribution system",
journal = "IBM Technical Disclosure Bulletin",
month = "December",
year = "1985",
volume= "28(7)",
pages = "3153-3163"
}
@ARTICLE{BeBr87,
author = "C. H. Bennett and G. Brassard",
title = "Quantum public key distribution reinvented",
journal = "Sigact News",
year = "1987",
volume= "18(4)",
pages = "51-53"
}
@ARTICLE{BeBr89,
author = "C. H. Bennett and G. Brassard",
title = "The dawn of a new era for quantum cryptography: The experimental prototype is working!",
journal = "Sigact News",
year = "1989",
volume= "20(4)",
pages = "78-82"
}
@article{Ben89,
author = {C. Bennett},
title = {Time-space tradeoffs for reversible computation},
journal = sicomp,
volume = {18},
year = {1989},
pages = {766--776}
}
@ARTICLE{BBM92,
author = "C. H. Bennett and G. Brassard and N. D. Mermin",
title = "Quantum cryptography with-out Bell's theoremn",
journal = "[ D / P / G ] Physical Review Letters",
volume = "68(5)",
month = "Februrary",
year = "1992",
pages = "557-559"
}
@ARTICLE{BBCJPW93,
author = "C. H. Bennett and G. Brassard and C. Crepeau and R. Jozsa and A. Peres and W. Wootters",
title = "Teleporting an unknown quantum state by dual classical and EPR channels",
journal = "Physical Review Letters",
volume = "70",
year = "1993",
pages = "1895-1898",
note = "[PRL:10.1103/PhysRevLett.70.1895]"
}
@ARTICLE{BBBV97,
author = "C. H. Bennett and E. Bernstein and G. Brassard and U. Vazirani",
title = "Strengths and weaknesses of quantum computing",
journal = "SIAM Journal of Computing",
volume = "26(5)",
year = "1997",
pages = "1510-1523",
note = "[SICOMP:30093, arXiv:quant-ph/9701001]"
}
@inproceedings{BenOr83,
author = {M. {Ben-Or}},
title = {Lower bounds for algebraic computation trees},
booktitle = proc15 # stoc,
year = {1983},
pages = {80--86}
}
@inproceedings{BCS83,
author = {M. {Ben-Or}, and B. Chor and A. Shamir},
title = {On the cryptographic security of single RSA bits},
booktitle = proc15 # stoc,
year = {1983},
pages = {421--430}
}
@inproceedings{BeCl88,
author = {M. {Ben-Or} and R. Cleve},
title = {Computing algebraic formulas using a constant number of
registers},
booktitle = proc20 # stoc,
year = {1988},
pages = {254--257}
}
@techreport{Ben83,
author = {D. Benson},
title = {Counting paths: Nondeterminism as linear algebra},
institution = {University of Edinburgh, Department of Computer Science},
number = {CSR-134-83},
year = {1983}
}
@inproceedings{BFGH09,
author = {D. Bera and S. Fenner and F. Green and S. Homer},
title = {Efficient Universal Quantum Circuits},
booktitle = proc15 # cocoon,
series = lncs,
publisher = springer,
volume = {5609},
year = {2009},
pages = {418--428}
}
@article{BeFr94,
author = {D. Berend and C. Frougny},
title = {Computability by finite automata and {P}isot bases},
journal = mst,
volume = {27},
year = {1994},
pages = {275--282}
}
@techreport{BeHa97,
author = {C. Berg and J. Hastad},
title = {On the {BPP} hierarchy problem},
institution = {NADA, KTH (Royal Institute of Technology)},
address = {Stockholm},
number = {TRITA-NA-9702},
year = {1997}
}
@article{Ber84,
author = {S. Berkowitz},
title = {On computing the determinant in small parallel time using a
small number of processors},
journal = ipl,
volume = {18},
year = {1984},
pages = {147--150}
}
@article{Ber70,
author="Elwyn Berlekamp",
title="Factoring polynomials over large finite fields",
journal="Mathematics of Computation",
volume=24,
year=1970,
pages="713--735"
}
@article{BeHa77,
author = {L. Berman and J. Hartmanis},
title = {On isomorphisms and density of {NP} and other complete sets},
journal = sicomp,
volume = {6},
year = {1977},
pages = {305--321}
}
@Article{BeEg99,
author = "A. Bernasconi and L. Egidi",
title = "Hilbert Function and Complexity Lower Bounds for
Symmetric Boolean Functions",
journal = infcomp,
volume = "153",
year = "1999",
}
@ARTICLE{BeVa97,
author = "E. Bernstein and U. Vazirani",
title = "Quantum complexity theory",
journal = "SIAM Journal of Computing",
volume = "26(5)",
year = "1997",
pages = "1411-1473"
}
@incollection{Ber97,
author = {A. Berthiaume},
title = {Quantum Computation},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
pages = {23--51}
}
@book{Bha97,
author = {R. Bhatia},
title = {Matrix Analysis},
publisher = springer,
year = {1997}
}
@article{BGL06,
author = {N. Bhatnagar and P. Gopalan and R. Lipton},
title = {Summetric polynomials over {$Z_m$} and simultaneous
communication protocols},
journal = jcss,
volume = {72},
year = {2006},
pages = {252--285}
}
@inproceedings{BhNa93,
author = {P. Bhattacharyya and G. Nagaraja},
title = {Learning classes of regular and linear languages
in {V}aliant's learnability framework},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {444--453}
}
@incollection{Big90,
author = {N. Biggs},
title = {Some heuristics for graph colouring},
booktitle = {Graph Colourings},
editor = {R. Nelson and R. Wilson},
series = {Research Notes in Mathematics},
volume = {218},
publisher = {Pitman},
year = {1990},
pages = {87--96}
}
@article{BiPr89,
author = {G. Bilardi and F. Preparata},
title = {Size-time complexity of Boolean networks for prefix
computation},
journal = jacm,
volume = {36},
year = {1989},
pages = {362--382}
}
@article{BiPr90,
author = {G. Bilardi and F. Preparata},
title = {Characterization of associative operations with
prefix circuits of constant depth and linear size},
journal = sicomp,
volume = {19},
year = {1990},
pages = {246--255}
}
@article{BSGG92,
author = {G. Bilbro and W. Snyder and S. Garnier and J. Gault},
title = {Mean-{Field Annealing}: A formalism for constructing
{GNC}-like algorithms},
journal = {IEEE Transactions on Neural Networks},
volume = {3},
year = {1992},
pages = {131--138}
}
@article{Bir92,
author = {J.-C. Birget},
title = {Intersection and union of regular languages and state
complexity},
journal = ipl,
volume = {43},
year = {1992},
pages = {185--190}
}
@article{Bir85,
author = {I. Birkhoff},
title = {A direct routing algorithm for the bit-reversal permutation
on a shuffle-exchange network},
journal = ipl,
volume = {21},
year = {1985},
pages = {259--268}
}
@article{BiVe90,
author = {S. Biswas and S. Venkatesh},
title = {Codes, sparsity, and capacity in neural associative memory},
journal = itit,
volume = {nnn},
year = {nnnn},
pages = {nnn--nnn}
}
@inproceedings{BLY92,
author = {A. Bj{\"o}rner and L. Lov{\'a}sz and A. Yao},
title = {Linear decision trees: volume estimates and topological
bounds},
booktitle = proc24 # stoc,
year = {1992},
pages = {170--177}
}
@article{BlGu82,
author = {A. Blass and Y. Gurevich},
title = {On the unique satisfiability problem},
journal = infcon,
volume = {55},
year = {1982},
pages = {80--88}
}
@inproceedings{Ble87,
author = {G. Blelloch},
title = {Scans as primitive parallel operations},
booktitle = proc5 # "International Conference on Parallel Processing",
year = {1987},
pages = {355--362}
}
@book{Ble90b,
author = {G. Blelloch},
title = {Vector Models for Data-Parallel Computing},
publisher = {MIT Press},
year = {1990}
}
@techreport{Ble90,
author = {G. Blelloch},
title = {Prefix sums and their applications},
institution = {Carnegie-Mellon University, Computer Science
Department},
number = {CMU--CS--90--190},
month = {November},
year = {1990}
}
@INPROCEEDINGS{Blo92,
AUTHOR = {S. Bloch},
TITLE = {Functional characterizations of uniform log-depth and polylog-
depth circuit families},
BOOKTITLE = proc7 # structures,
YEAR = {1992},
PAGES = {193--206}
}
@techreport{Blo92b,
author = {S. Bloch},
title = {Alternating function classes within {P}},
institution = {University of Manitoba Computer Science Department},
year = {1992}
}
@techreport{BlGo92b,
author = {S. Bloch and J. Goldsmith},
title = {Sharply bounded alternation within {P}},
institution = {University of Manitoba Computer Science Department},
year = {1992}
}
@article{BBG94,
author = {S. Bloch and J. Buss and J. Goldsmith},
title = {How hard are {$n^2$}-hard problems?},
journal = sigact,
volume = {25},
number = {2},
month = {June},
year = {1994},
pages = {83--85}
}
@article{BBG97,
author = {S. Bloch and J. Buss and J. Goldsmith},
title = {Sharply bounded alternation within {P}},
journal = "Theory of Computing Systems (formerly
Mathematical Systems Theory)",
year = {1997},
note = "to appear"
}
@inproceedings{BFJKMR94,
author = {A. Blum and M. Furst and J. Jackson and M. Kearns
and Y. Mansour and S. Rudich},
title = {Weakly learning {DNF} and characterizing statistical
query learning using {F}ourier analysis},
booktitle = proc26 # stoc,
year = {1994},
pages = {253--262}
}
@ARTICLE{Blum67,
AUTHOR = {M.~Blum},
TITLE = {A machine-independent theory of the complexity of recursive
functions},
JOURNAL = jacm,
VOLUME = {14},
YEAR = {1967},
PAGES = {322--336}
}
@article{BlMi84,
author = {M. Blum and S. Micali},
title = {How to generate cryptographically secure sequences
of pseudorandom bits},
journal = sicomp,
volume = {13},
year = {1984},
pages = {850--864}
}
@inproceedings{Blum93,
author = {M. Blum},
title = {Program result checking: a new approach to making
programs more reliable},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {1--14}
}
@article{BLR93,
author = {M. Blum and M. Luby and R. Rubinfeld},
title = {Self-testing/correcting with applications to numerical problems},
journal = jcss,
year = {1993},
volume = {47},
pages = {549--595}
}
@inproceedings{BlGo92,
author = {M. Blum and O. Goldreich},
title = {Towards a computational theory of statistical tests},
booktitle = proc33 # focs,
year = {1992},
pages = {406--416}
}
@article{Blum84,
author = {N.~Blum},
title = {A {B}oolean function requiring {$3n$} network size},
journal = tcs,
volume = {28},
year = {1984},
pages = {337--345}
}
@article{BEHW87,
author = {A. Blumer and A. Ehrenfeucht and D. Haussler and
M. Warmuth},
title = {Occam's Razor},
journal = ipl,
volume = {24},
year = {1987},
pages = {377--380}
}
@article{Bod93,
author = {H. Bodl{\"a}nder},
title = {On linear-time minor tests with depth-dirst search},
journal = jalg,
volume = {15},
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{BFH94,
author = {H. Bodl{\"a}nder and M. Fellows and M. Hallett},
title = {Beyond {NP}-completeness for problems of bounded width:
hardness for the {$W$} hierarchy},
booktitle = proc26 # stoc,
year = {1994},
pages = {449--458}
}
@misc{BISBDJBMN17,
author = {S. Boixo and S. Isakov and V. Smelyansky and R. Babbush and N. Ding and Z. Jiang and M. Bremner and J. Martinis and H. Neven},
title = {Characterizing quantum supremacy in near-time devices},
year = {2017},
month = {April},
day = {5},
howpublished = {arxiv:1608.00263v3}
}
@BOOK{Bol79,
AUTHOR = {B. Bollob\'as},
TITLE = {Extremal Graph Theory},
PUBLISHER = {Academic Press},
YEAR = {1979}
}
@article{BCN81,
author = {L. Boasson and B. Courcelle and M. Nivat},
title = {The rational index: A complexity measure for languages},
journal = sicomp,
volume = {10},
number = {2},
year = {1981},
pages = {284--296}
}
@misc{BISBDJBMN16,
author = {Sergio Boixo and
Sergei V. Isakov and
Vadim N. Smelyanskiy and
Ryan Babbush and
Nan Ding and
Zhang Jiang and
Michael J. Bremner and
John M. Martinis and
Hartmut Neven},
title = {Characterizing Quantum Supremacy in Near-Term Devices},
year = {2016},
howpublished = {https://arxiv.org/pdf/1608.00263.pdf}
}
@book{Bol76,
author = {B. Bollob{\'a}s},
title = {Extremal Graph Theory},
year = {1976},
publisher = {Academic Press}
}
@article{BoEr76,
author = {B. Bollob{\'a}s and P. Erd{\H{o}}s},
title = {Cliques in random graphs},
journal = {Proc. Camb. Phil. Soc.},
volume = {80},
year = {1976},
pages = {419--427}
}
@article{BoTh85,
author = {B.~Bollob{\'a}s and A.~Thomason},
title = {Random graphs of small order},
journal = {Annals of Discrete Math},
volume = {28},
year = {1985},
pages = {47--97}
}
@article{Bol88,
author = {B.~Bollob{\'a}s},
title = {The chromatic number of random graphs},
journal = {Combinatorica},
volume = {8},
year = {1988},
pages = {49--55}
}
@inproceedings{BoLi95,
author = {D. Boneh and R. Lipton},
title = {Quantum cryptanalysis of hidden linear forms},
booktitle = "Proceedings of Crypto'95",
series = lncs,
publisher = springer,
volume = {963},
year = {1995},
pages = {424--437}
}
@inproceedings{BoLi96,
author = {D. Boneh and R. Lipton},
title = {Algorithms for black box fields and their application to cryptography},
booktitle = "Proceedings of Crypto'96",
series = lncs,
publisher = springer,
volume = {1109},
year = {1996},
pages = {283--297}
}
@article{Bon99,
author = {D. Boneh},
title = {Twenty Years of Attacks on the {RSA} Cryptosystem},
journal = "Notices of the American Mathematical Society",
volume = "46",
number = "2",
pages = "203--213",
month = feb,
year = "1999"
}
@phdthesis{Bon91,
author = {M. Bonet},
title = {The lengths of propositional proofs and the deduction rule},
school = {Univ. of California at Berkeley},
year = {1991}
}
@inproceedings{BoBu91,
author = {M. Bonet and S. Buss},
title = {On the deduction rule and the number of proof lines},
booktitle = proc6 # lics,
year = {1991},
pages = {286--297}
}
@incollection{Bon93,
author = {M. Bonet},
title = {Number of symbols in {F}rege proofs with and without the
deduction rule},
booktitle = {Arithmetic, Proof Theory, and Computational
Complexity},
editor = {P. Clote and J. Kraj{\'\i\v{c}}ek},
publisher = {Oxford University Press},
year = {1993},
pages = {61--95}
}
@article{BoBu93,
author = {M. Bonet and S. Buss},
title = {The deduction rule and linear and near-linear proof
simulations},
journal = jsl,
volume = {58},
year = {1993},
pages = {688--709}
}
@article{BoBu94,
author = {M.L. Bonet and S. Buss},
title = {Size-depth tradeoffs for {B}oolean formulae},
journal = ipl,
volume = {29},
year = {1994},
pages = {151--155}
}
@incollection{BBP95,
author = {M. Bonet and S. Buss and T. Pitassi},
title = {Are there hard examples for {F}rege systems?},
booktitle = {Feasible Mathematics {II}},
editor = {P. Clote and J. Remmel},
publisher = {Birkhauser},
year = {1995},
pages = {31--56}
}
@article{BoGr70,
author = {R. Book and S. Greibach},
title = {Quasi-realtime languages},
journal = mathsys,
volume = {4},
year = {1970},
pages = {97--111}
}
@article{BGW70,
author = {R. Book and S. Greibach and B. Wegbreit},
title = {Time- and tape-bounded Turing acceptors and AFLs},
journal = jcss,
volume = {4},
year = {1970},
pages = {606--621}
}
@article{Book72,
author = {R. Book},
title = {On languages accepted in polynomial time},
journal = sicomp,
year = {1972},
volume = {1},
pages = {281--287}
}
@article{Book74,
author = {R. Book},
title = {Comparing complexity classes},
journal = jcss,
volume = {9},
year = {1974},
pages = {213--229}
}
@article{Book76,
author = {R. Book},
title = {Translational lemmas, polynomial time, and {$(\log n)^j$}
space},
journal = tcs,
volume = {1},
year = {1976},
pages = {215--226}
}
@misc{BoYa77,
author = {R. Book and C. Yap},
title = {On the computational power of reversal-bounded machines},
series = lncs,
volume = {52},
publisher = springer,
year = {1977},
pages = {111--119}
}
@article{BoBr80,
author = {R. Book and F.-J. Brandenburg},
title = {Equality sets and complexity classes},
journal = sicomp,
volume = {9},
year = {1980},
pages = {729--743}
}
@article{Book81,
author = {R. Book},
title = {Bounded query machines: on {NP} and {PSPACE}},
journal = tcs,
volume = {15},
year = {1981},
pages = {27--39}
}
@article{BoWr81,
author = {R. Book and C. Wrathall},
title = {Bounded query machines: on {NP()} and {NPQUERY()}},
journal = tcs,
volume = {15},
year = {1981},
pages = {41--50}
}
@article{BWM82,
author = {R. Book and C. Wilson and X. Mei-Rui},
title = {Relativizing time, space, and time-space},
journal = sicomp,
volume = {11},
year = {1982},
pages = {571--581}
}
@article{BLS84,
author = {R. Book and T. Long and A. Selman},
title = {Quantitative relativizations of complexity classes},
journal = sicomp,
volume = {13},
year = {1984},
pages = {461--487}
}
@article{BLS85,
author = {R. Book and T. Long and A. Selman},
title = {Qualitative relativizations of complexity classes},
journal = jcss,
volume = {30},
year = {1985},
pages = {395--413}
}
@article{BoDu87,
author = {R. Book and D.-Z. Du},
title = {The existence and density of generalized
complexity cores},
journal = jacm,
volume = {34},
year = {1987},
pages = {718--730}
}
@inproceedings{BoKo87,
author = {R. Book and K. Ko},
title = {On sets reducible to sparse sets},
booktitle = proc2 # structures,
year = {1987},
pages = {147--154}
}
@inproceedings{BLM94,
author = {R. Book and J. Lutz and K. Wagner},
title = {The global power of additional queries to
random oracles},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {403--414}
}
@article{BLW94,
author = {R. Book and J. Lutz and K. Wagner},
title = {An observation on probability versus randomness with
applications to complexity classes},
journal = mst,
volume = {27},
year = {1994},
pages = {201--210}
}
@book{BJ74,
author = {G. Boolos and R. Jeffrey},
title = {Computability and Logic},
publisher = {Cambridge University Press},
year = {1974}
}
@incollection{BoHi89,
author = {R. Boppana and R. Hirschfeld},
title = {Pseudorandom generators and complexity classes},
booktitle = {Randomness and Computation},
series = {Advances in Computing Research},
volume = {5},
editor = {S. Micali},
publisher = {JAI Press},
address = {Greenwich, CT, USA},
year = {1989},
pages = {1--26}
}
@incollection{BoSi90,
author = {R. Boppana and M. Sipser},
title = {The complexity of finite functions},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {757--804}
}
@inproceedings{BoNa93,
author = {R. Boppana and B. Narayanan},
title = {The biased coin problem},
booktitle = proc25 # stoc,
year = {1993},
pages = {252--257}
}
@inproceedings{Bor94,
author = {B. Borchert},
title = {On the acceptance power of regular languages},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {533--542},
}
@techreport{Bor94b,
author = {B. Borchert},
title = {On the acceptance power of regular languages},
institution = {Universit{\"a}t Heidelberg, Mathematisches Institut},
number = {Bericht Nr. 6},
month = {February},
year = {1994}
}
@techreport{Bor94b,
author = {B. Borchert},
title = {Predicate classes and promise classes},
institution = {Universit{\"a}t Heidelberg, Mathematisches Institut},
number = {Bericht Nr. 7},
month = {April},
year = {1994}
}
@article{BoSt00,
author = "B. Borchert and F. Stephan",
title = "Looking for an analog of {Rice's Theorem} in
circuit complexity theory",
journal = "Mathematical Logic Quarterly, formerly" # zml,
volume = "46",
year = "2000",
}
@book{Bor91,
author = {A. Borel},
title = {Linear Algebraic Groups},
publisher = springer,
series = gtm,
volume = {126},
year = {1991}
}
@article{BPT92,
author = {R. Borie and R.G. Parker and C. Tovey},
title = {Automatic generation of linear-time algorithms from
predicate calculus descriptions of problems on recursively constructed
graph families},
journal = {Algorithmica},
volume = {7},
year = {1992},
pages = {555--581}
}
@article{Bor72,
author = {A. Borodin},
title = {Computational complexity and the existence of complexity
gaps},
journal = jacm,
volume = {19},
year = {1972},
pages = {158--174}
}
@techreport{BoDe76,
author = {A. Borodin and A. Demers},
title = {Some comments on functional self-reducibility and the
{NP} hierarchy},
institution = {Cornell Univ. Comp. Sci. Dept.},
number = {76-284},
year = {1976}
}
@techreport{BorodinDemers76,
author = {A. Borodin and A. Demers},
title = {Some comments on functional self-reducibility and the
{NP} hierarchy},
institution = {Cornell Univ. Comp. Sci. Dept.},
number = {TR 76-284},
year = {1976}
}
@article{Bor77,
author = {A. Borodin},
title = {On relating time and space to size and depth},
journal = sicomp,
volume = {6},
year = {1977},
pages = {733--744}
}
@ARTICLE{BFKLT81,
AUTHOR = {A. Borodin and M. Fischer and D. Kirkpatrick and N. Lynch and
M. Tompa},
TITLE = {A time-space tradeoff for sorting on non-oblivious machines},
JOURNAL = jcss,
VOLUME = {22},
YEAR = {1981},
PAGES = {351--364}
}
@article{BoCo82,
author = {A. Borodin and S. Cook},
title = {A time-space tradeoff for sorting on a general
sequential model of computation},
journal = sicomp,
volume = {11},
year = {1982},
pages = {287--297}
}
@article{BCP83,
author = {A. Borodin and S. Cook and N. Pippenger},
title = {Parallel computation for well-endowed rings, and
space-bounded probabilistic machines},
journal = infcon,
volume = {58},
year = {1983},
pages = {113--136}
}
@article{BoHo85,
author = {A. Borodin and J. Hopcroft},
title = {Routing, merging, and sorting on parallel models of
computation},
journal = jcss,
volume = {30},
year = {1985},
pages = {130--145}
}
@article{BFMUW87,
author = {A. Borodin and M. Fischer and F. {Meyer auf der Heide}
and E. Upfal and A. Wigderson},
title = {A time-space tradeoff for element distinctness},
journal = sicomp,
volume = {16},
year = {1987},
pages = {97--99}
}
@article{BCDRT89,
author = {A. Borodin and S. Cook and P. Dymond and W. Ruzzo and
M. Tompa},
title = {Two applications of inductive counting for complementation
problems},
journal = sicomp,
volume = {18},
year = {1989},
pages = {559--578}
}
@article{BRS93,
author = {A. Borodin and A. Razborov and R. Smolensky},
title = {On lower bounds for read-{$k$}-times branching programs},
journal = compcomp,
volume = {3},
year = {1993},
pages = {1--18}
}
@article{BNR03,
author = {A. Borodin and M. Nielsen and C. Rackoff},
title = {{(Incremental)} Priority Algorithms},
journal = {Algorithmica},
volume = {37},
year = {2003},
pages = {295--326}
}
@inproceedings{BoGa93,
author = {E. Borowsky and E. Gafni},
title = {Generalized {FLP} impossibility result for {$t$}-resilient
asynchronous computations},
booktitle = proc25 # stoc,
year = {1993},
pages = {91--100}
}
@book{BCRW06,
author = {P. Borwein and S. Choi and B. Rooney and A. Weirathmueller},
title = {The Riemann Hypothesis},
publisher = springer,
year = {2006}
}
@article{BoRC60,
author = {R. Bose and D. Ray-Chaudhuri},
title = {On a class of error correcting binary group codes},
journal = infcon,
volume = {3},
year = {1960},
pages = {68--79}
}
@ARTICLE{BPMEWZ97,
author = "D. Bouwmeester and J.-W. Pan and K. Mattle and M. Eibl and H. Weinfurter and A. Zeilinger",
title = "Experimental quantum teleportation",
journal = "Nature",
volume = "390",
year = "1997",
pages = "575-579"
}
@book{BoCr94,
author = {D. Bovet and P. Crescenzi},
title = {Introduction to the Theory of Complexity},
publisher = {Prentice Hall International (UK) Limited},
address = {Hertfordshire, U.K.},
year = {1994}
}
@inproceedings{BBP91,
author = {J. Boyar and G. Brassard and R. Peralta},
title = {Subquadratic zero-knowledge},
booktitle = proc32 # focs,
year = {1991},
pages = {69--78}
}
@article{BFS92,
author = {J. Boyar and G. Frandsen and C. Sturtivant},
title = {An arithmetic model of computation equivalent to
threshold circuits},
journal = tcs,
volume = {93},
year = {1992},
pages = {303--319}
}
@ARTICLE{BoMo77,
AUTHOR = {R. Boyer and J. Moore},
TITLE = {A fast string-searching algorithm},
JOURNAL = cacm,
VOLUME = {20},
YEAR = {1977},
PAGES = {762--772}
}
@article{Bra86,
author = {U. Brandt},
title = {The position of index sets of identifiable sets in the
arithmetical hierarchy},
journal = infcon,
volume = {68},
year = {1986},
pages = {185--195}
}
@article{Bra88,
author = {U. Brandt},
title = {Index sets in the arithmetical hierarchy},
journal = {Ann. Pure Appl. Logic},
volume = {37},
year = {1988},
pages = {101--110}
}
@inproceedings{vBr93,
author = {B. von Braunm{\"u}hl},
title = {Alternation for two-way machines with sublogarithmic space},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {5--15}
}
@INBOOK{Bra88,
author = "G. Brassard",
title = "Modern Cryptology",
publisher = "Springer-Verlag",
chapter = "6",
year = "1988",
volume = "325",
note = "Lecture Notes in Computer Science"
}
@INPROCEEDINGS{BrCr90,
author = "G. Brassard and C. Crepeau",
title = "Quantum bit commitment and coin tossing protocols",
booktitle = "[ D / P / G ] Advances in Cryptology | Crypto '90 Proceedings",
publisher = "Springer-Verlag",
month = "August",
year = "1990",
pages = "49-61"
}
@ARTICLE{Bra93,
author = "G. Brassard",
title = "Cryptology column - quantum cryptography: A bibliography",
journal = "Sigact News",
year = "1993",
volume= "24(3)",
pages = "16-20"
}
@ARTICLE{BrCr93,
author = "G. Brassard and C. Crepeau",
title = "Cryptology column - 25 years of quantum cryptography",
journal = "Sigact News",
year = "1993",
volume= "27(3)",
pages = "13-24"
}
@article{BrGo16,
author = {S. Bravyi and D. Gosset},
title = {Improved Classical Simulation of Quantum Circuits Dominated by {C}lifford Gates},
journal = {Physical Review Letters},
volume = {116},
year = {2016}
}
@article{Bre74,
author = {R. Brent},
title = {The parallel evaluation of general arithmetic expressions},
journal = jacm,
volume = {21},
year = {1974},
pages = {201--206}
}
@article{Bre76,
author = {R. Brent},
title = {Fast multiple-precision evaluation of elementary functions},
journal = jacm,
volume = {23},
year = {1976},
pages = {242--251}
}
@article{Bre78,
author = {S. Breidtbart},
title = {On splitting recursive sets},
journal = jcss,
volume = {17},
year = {1978},
pages = {56--64}
}
@misc{BrSh93,
author = {Y. Breitbart and J. Shallit},
title = {Automaticity: Properties of a measure of descriptional
complexity},
month = {November},
year = {1993},
note = {Long version of STACS'94 paper}
}
@misc{BJS10,
author = {M. Bremner and R. Jozsa and D. Shepherd},
title = {Classical simulation of commuting quantum computations
implies collapse of the polynomial hierarchy},
year = {2010},
month = {May},
howpublished = {http://arxiv.org/abs/1005.1407}
}
@incollection{Bre75,
author = {R.P. Brent},
title = {Multiple-precision zero-finding methods and the complexity of elementary
function evaluation},
booktitle = {Analytic Computational Complexity},
editor = {J.F. Traub},
publisher = {Academic Press, New York},
year = {1975},
pages = {59--73}
}
@incollection{Bre76a,
author = {R.P. Brent},
title = {The complexity of multiple-precision arithmetic},
booktitle = {The Complexity of Computational Problem Solving},
editor = {R. S. Anderssen and R. P. Brent},
publisher = {University of Queensland Press, Brisbane},
year = {1976},
pages = {126--165},
note = {Retyped and postscript added 1999. arXiv:1004.3608v1}
}
@article{Bre76b,
author = {R.P. Brent},
title = {Fast multiple-precision evaluation of elementary functions},
journal = jacm,
volume = {23},
year = {1976},
pages = {242--251}
}
@article{BrKu82,
author = {R. Brent and H. Kung},
title = {A regular layout for parallel adders},
journal = {IEEE Transactions on Computers},
volume = {C-31},
year = {1982},
pages = {260--264}
}
@article{BrMe99,
author = {D.C. Brody and B. Meister},
title = {Discrete Uncertainty Relations},
journal = "J. Phys. A: Math. Gen.",
volume = {32},
year = {1999},
pages = {4921--4930}
}
@article{Bro72,
author = {Edgar H Brown},
title = {Generalizations of the {K}ervaire invariant},
journal = {Annals of Mathematics},
volume = {95},
year = {1972},
pages = {368--383}
}
@article{BrTa80,
author = {M. Brown and R. Tarjan},
title = {Design and analysis of a data structure for representing
sorted lists},
journal = sicomp,
volume = {9},
year = {1980},
pages = {594--614}
}
@article{Bro87,
author = {W. Dale Brownawell},
title = {Bounds for degrees in the {Nullstellensatz}},
journal = {Ann. of Math.},
volume = {126},
year = {1987},
pages = {577--591}
}
@misc{Brown10,
author = {H. Brown},
title = {What's a ``locally determined graph property?''},
howpublished = "http://harrisonbrown.wordpress.com/2010/01/01/whats-a-locally-determined-graph-property/",
year = {2010}
}
@article{BrBl89,
author = {J. Bruck and M. Blaum},
title = {Neural networks, error-correcting codes, and polynomials
over the binary {$n$-cube}},
journal = itit,
volume = {35},
year = {1989},
pages = {976--987}
}
@article{BrSm92,
author = {J. Bruck and R. Smolensky},
title = {Polynomial threshold functions, {$\AC^0$} functions,
and spectral norms},
journal = sicomp,
volume = {21},
year = {1992},
pages = {33--42}
}
@book{BV88,
author = {W. Bruns and U. Vetter},
title = {Determinantal Rings},
series = lnm,
volume = {1327},
publisher = springer,
year = {1988}
}
@article{BsKa90,
author = {N. Bshouty and M. Kaminski},
title = {Multiplication of polynomials over finite fields},
journal = sicomp,
volume = {19},
year = {1990},
pages = {452--456}
}
@article{BsSe90,
author = {N. Bshouty and G. Seroussi},
title = {Generalizations of the normal basis theorem of
finite fields},
journal = sjdm,
volume = {3},
year = {1990},
pages = {330--337}
}
@inproceedings{BCE91,
author = {N. Bshouty and R. Cleve and W. Eberly},
title = {Size-Depth Tradeoffs for Algebraic Formulae},
booktitle = proc32 # focs,
year = {1991},
pages = {334-341}
}
@inproceedings{Bsh93,
author = {N. Bshouty},
title = {Exact learning via the monotone theory},
booktitle = proc34 # focs,
year = {1993},
pages = {302--311}
}
@inproceedings{BsBs94,
author = {K. Bshouty and N. Bshouty},
title = {On learning arithmetic read-once formulas with exponentiation},
booktitle = proc7 # colt,
year = {1994}
}
@misc{BuKo18,
author = {K. Bu and D. koh},
title = {Classical simulation of quantum circuits by half {G}auss sums},
year = {2018},
month = {December},
howpublished = {https://arxiv.org/abs/1812.00224}
}
@phdthesis{Buc65,
author = {B. Buchberger},
title = {Ein Algorithmus zum Auffinden der basiselemente des
Restklassenrings nach einem nulldimensionalen Polynomideal},
school = {University of Innsbruck, Department of Mathematics},
year = {1995}
}
@incollection{Buc85,
author = {B. Buchberger},
title = {{Gr{\"o}bner} bases: An algorithmic method in polynomial
ideal theory},
booktitle = {Multidimensional Systems Theory},
editor = {N.K. Bose},
publisher = {Reidel},
year = {1985},
pages = {184--232}
}
@incollection{BuSi90,
author = {W. Buchholz and W. Sieg},
title = {A note on polynomial time computable arithmetic},
booktitle = {Contemporary Mathematics},
number = {106},
year = {1990},
pages = {51--55}
}
@article{Buc60,
author = {J. B{\"u}chi},
title = {Weak second-order arithmetic and finite automata},
journal = zml,
volume = {6},
year = {1960},
pages = {66--92}
}
@inproceedings{BuSh91,
author = {J. Buchmann and V. Shoup},
title = {Constructing nonresidues in finite fields and the
extended {R}iemann hypothesis},
booktitle = proc23 # stoc,
year = {1991},
pages = {72--79}
}
@article{BuAn82,
author = {T. Budd and D. Angluin},
title = {Two notions of correctness and their relation to testing},
journal = {Acta Informatica},
volume = {18},
year = {1982},
pages = {31--45}
}
@book{BCS97,
author = {P. B{\"u}rgisser and M. Claussen and M.A.
Shokrollahi},
title = {Algebraic Complexity Theory},
publisher = springer,
year = {1997}
}
@inproceedings{BST91,
author = {H. Buhrman and E. Spaan and L. Torenvliet},
title = {Bounded reductions},
booktitle = proc8 # stacs,
series = lncs,
volume = {480},
publisher = springer},
year = {1991},
pages = {410--421}
}
@article{BST93,
author = {H. Buhrman and E. Spaan and L. Torenvliet},
title = {The relative power of logspace and polynomial-time
reductions},
journal = compcomp,
volume = {3},
year = {1993},
pages = {231--244}
}
@inproceedings{BvHT93,
author = {H. Buhrman and P. van Helden and L. Torenvliet},
title = {P-selective self-reducible sets: A new characterization
of P},
booktitle = proc8 # structures,
year = {1993},
pages = {44--51}
}
@inproceedings{BuTo94,
author = {H. Buhrman and L. Torenvliet},
title = {On the cutting edge of relativization: the resource-bounded
injury method},
booktitle = proc21 # icalp,
series = lncs,
publisher = springer,
volume = {820},
year = {1994},
pages = {263--273}
}
@inproceedings{BuTo94b,
author = {H. Buhrman and L. Torenvliet},
title = {On the structure of complete sets},
booktitle = proc9 # structures,
year = {1994},
pages = {118--133}
}
@INPROCEEDINGS{BVW07,
author = {H. Buhrman and N. Vereshchagin and R. de Wolf},
title = {On computation and communication with small bias},
booktitle = {In Proc. of the 22nd Conf. on Computational Complexity (CCC},
year = {2007},
pages = {24--32}
}
@InProceedings{BFT95,
title = "Using Autoreducibility to Separate Complexity
Classes",
author = "Harry Buhrman and Lance Fortnow and Leen Torenvliet",
pages = "520--527",
booktitle = "36th Annual Symposium on Foundations of Computer
Science",
month = "23--25 " # oct,
year = "1995",
address = "Milwaukee, Wisconsin",
organization = "IEEE",
}
@InProceedings{BuLo96,
title = "Compressibility and Resource Bounded Measure",
author = "Harry Buhrman and Luc Longpr{\'e}",
booktitle = "13th Annual Symposium on Theoretical Aspects of
Computer Science",
address = "Grenoble, France",
month = "22--24~" # feb,
year = "1996",
series = "lncs",
volume = "1046",
publisher = "Springer",
pages = "13--24",
}
@misc{BuMe97,
author = {H. Buhrman and D. van Melkebeek},
note = {=: this paper}
}
@ARTICLE{BBCMW01,
author = "R. Beals and H. Buhrman and R. Cleve and M. Mosca and R. de Wolf",
title = "Quantum lower bounds by polynomials",
journal = " J. ACM",
volume = "48(4)",
year = "2001",
pages = "778-797",
note = " Earlier version in 39th IEEE FOCS, 1998, pp. 352-361. [JACM:502090.502097, arXiv:quant-ph/9802049]"
}
@ARTICLE{BCWW01,
author = "H. Buhrman and R. Cleve and J. Watrous and R. de Wolf",
title = "Quantum fingerprinting",
journal = " Phys. Rev. Lett.",
volume = "87(16)",
year = "2001",
note = "4 pages. [PRL:10.1103/PhysRevLett.87.167902, arXiv:quant-ph/0102001]"
}
@ARTICLE{BuWo02,
author = "H. Buhrman and R. de Wolf",
title = "Complexity measures and decision tree complexity: a survey",
journal = "Theoretical Computer Sci.",
volume = "288",
year = "2002",
pages = "21-43",
note = "[TCS:10.1016/S0304-3975(01)00144-X]"
}
@article{BuGr05,
author = {A. Bulatov and M. Grohe},
title = {The complexity of partition functions},
journal = tcs,
volume = {348},
year = {2005},
pages = {148--186}
}
@inproceedings{BuLo02,
author = {P. B{\"u}rgisser and M. Lotz},
title = {Lower bounds on the bounded coefficient complexity
of bilinear maps},
booktitle = proc43 # focs,
year = {2002},
pages = {659--668}
}
@article{BuLo03,
author = {P. B{\"u}rgisser and M. Lotz},
title = {Lower bounds on the bounded coefficient complexity
of bilinear maps},
journal = jacm,
year = {2003},
note = {to appear; also at arXiv.org/cs/0301016.}
}
@article{BuLo04,
author = {P. B{\"u}rgisser and M. Lotz},
title = {Lower bounds on the bounded coefficient complexity
of bilinear maps},
journal = jacm,
year = {2004},
volume = {51},
pages = {464--482}
}
@misc{BMRSS97,
author = {H. Buhrman and {D. van} Melkebeek and K. Regan and
D. Sivakumar and M. Strauss},
title = {A generalization of resource-bounded measure, with an
application},
year = {1997},
note = "To appear in the proceedings of STACS'98"
}
@inproceedings{BMRSS98,
author = {H. Buhrman and {D. van} Melkebeek and K. Regan and
D. Sivakumar and M. Strauss},
title = {A generalization of resource-bounded measure, with an
application},
booktitle = proc15 # stacs,
series = lncs,
publisher = springer,
volume = {1373},
year = {1998},
pages = {161--171}
}
@article{BMRSS01,
author = {H. Buhrman and {D. van} Melkebeek and K. Regan and
D. Sivakumar and M. Strauss},
title = {A generalization of resource-bounded measure, with application
to the {BPP} vs. {EXP} problem},
journal = sicomp,
volume = {30},
year = {2001},
pages = {576--610}
}
@inproceedings{BFT98,
author = {H. Buhrman and L. Fortnow and T. Thierauf},
title = {Nonrelativizing separations},
year = {1998},
booktitle = proc13 # ccc,
pages = {8--12},
}
@techreport{BFvMT98,
author = "H. Buhrman and L. Fortnow and D. van Melkebeek and L. Torenvliet",
title = "Separating Complexity Classes Using Autoreducibility",
institution = "Fields Institute",
year = "1998",
number = "FI-CXT1998-002",
note = "This is the journal version of \cite{BFT95}, and is to
appear in " # sicomp
}
@inproceedings{BuMe98,
author = {H. Buhrman and D. van Melkebeek},
title = {Hard Sets are Hard to Find},
booktitle = proc13 # ccc,
year = {1998},
pages = {170--181}
}
@article{BuHe90,
author = {M. Bull and A. Hemmerling},
title = {Finite embedded trees and simply connected mazes
cannot be searched by halting finite automata},
journal = {J. Inform. Process. Cybern.},
volume = {EIK 26},
year = {1990},
pages = {65--73}
}
@article{BuHo74,
author = {J. Bunch and J. Hopcroft},
title = {Triangular factorization and inversion by fast matrix multiplication},
journal = {Mathematics of Computation},
volume = {28},
year = {1974},
pages = {231--236}
}
@article{BODI10,
author = {J. Buresh-Oppenheim and S. Davis and R. Impagliazzo},
title = {A Stronger Model of Dynamic Programming Algorithms},
journal = {Algorithmica},
volume = {5x},
year = {2010},
pages = {to appear}
}
@InProceedings{Bur98,
title = "On the Structure of {Valiant's} Complexity Classes",
author = "Peter B{\"u}rgisser",
booktitle = "15th Annual Symposium on Theoretical Aspects of
Computer Science",
address = "Paris France",
month = "25--27~" # feb,
year = "1998",
series = "lncs",
volume = "1373",
publisher = "Springer",
pages = "194--204",
}
@article{Bur00,
author = {Peter B{\"u}rgisser},
title = {Cook's versus {V}aliant's hypothesis},
journal = tcs,
volume = {235},
year = {2000},
pages = {71--88}
}
@misc{BLMW09,
author = {P. B{\"u}rgisser and J. Landsberg and L. Manivel and
J. Weyman},
title = {An overview of mathematical issues arising in the
`{G}eometric {C}omplexity {T}heory' approach to {VP} vs.\ {VNP}},
year = {2009},
month = {July},
note = {arxiv:09072850}
}
@article{BuGo93,
author = {J. Buss and J. Goldsmith},
title = {Nondeterminism within {P}},
journal = sicomp,
volume = {22},
year = {1993},
pages = {560--572}
}
@inproceedings{Buss86,
author = {S. Buss},
title = {The polynomial hierarchy and intuitionistic bounded
arithmetic},
booktitle = proc1 # structures,
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {77--103}
}
@inproceedings{Buss87,
author = {S. Buss},
title = {The Boolean formula value problem is in {ALOGTIME}},
booktitle = proc19 # stoc,
year = {1987},
pages = {123--131}
}
@article{Buss87b,
author = {S. Buss},
title = {Polynomial-size proofs of the propositional pigeonhole
principle},
journal = jsl,
volume = {52},
year = {1987},
pages = {916--927}
}
@article{BuTu88,
author = {S. Buss and G. Tur{\'a}n},
title = {Resolution proofs of generalized pigeonhole principles},
journal = tcs,
volume = {62},
year = {1988},
pages = {311--317}
}
@article{BuHa91,
author = {S. Buss and L. Hay},
title = {On truth-table reducibility to {SAT}},
journal = infcomp,
volume = {91},
year = {1991},
pages = {86--102}
}
@article{Buss92,
author = {S. Buss},
title = {The graph of multiplication is equivalent to counting},
journal = ipl,
volume = {41},
year = {1992},
pages = {199--201}
}
@incollection{Buss92b,
author = {S. Buss},
title = {A note on bootstrapping intuitionistic bounded
arithmetic},
booktitle = {Proof theory},
editor = {P. Aczel and S. Wainer},
publisher = {Cambridge Univ. Press},
year = {1992},
pages = {149--169}
}
@ARTICLE{BCGR92,
AUTHOR = {S. Buss and S. Cook and A. Gupta and V. Ramachandran},
title = {An optimal parallel algorithm for formula evaluation},
journal = sicomp,
volume = {21},
year = {1992},
pages = {755--780}
}
@incollection{Buss92I,
author = {S. Buss},
title = {On {G\"o}del's theorems on lengths of proofs {I}: Number
of lines and speedup for arithmetics},
booktitle = {Logical Methods in Mathematics and Computer Science:
A Symposium in Honor of Anil Nerode on the Occasion of His Sixtieth Birthday},
year = {1992},
note = "To appear in the " # jsl
}
@incollection{Buss93,
author = {S. Buss},
title = {Algorithms for {B}oolean formula evaluation and for
tree contraction},
booktitle = {Arithmetic, Proof Theory, and Computational
Complexity},
editor = {P. Clote and J. Kraj{\'\i\v{c}}ek},
publisher = {Oxford University Press},
year = {1993},
pages = {96--115}
}
@article{Buss94I,
title = {On {G\"o}del's theorems on lengths of proofs {I}: Number
of lines and speedup for arithmetics},
journal = jsl,
volume = {39},
year = {1994},
pages = {737--756}
}
@incollection{Buss94II,
author = {S. Buss},
title = {On {G\"o}del's theorems on lengths of proofs {II}: Lower
bounds for recognizing $k$ symbol provability},
booktitle = {Feasible Mathematics {II}},
editor = {P. Clote and J. Remmel},
publisher = {Birkhauser},
year = {1995},
pages = {57--90}
}
@article{BuKr94,
author = {S. Buss and J. Kraj{\'\i\v{c}}ek},
title = {An application of {B}oolean complexity to separation
problems in bounded arithmetic},
journal = {Proc. London Math. Soc.},
volume = {69},
year = {1994},
pages = {1--21}
}
@misc{Buss95,
author = {S. Buss},
title = {Some remarks on lengths of propositional proofs},
year = {1995},
note = {Submitted to {\it Archiv f{\"u}r Mathematische Logik\/}}
}
@misc{Buss09,
author = {S. Buss},
title = {Towards {NP-P} via proof complexity and search},
year = {2009},
url = {http://math.ucsd.edu/~sbuss/ResearchWeb/lfcsSurvey/}
}
@misc{BuWe03,
author = {B. Butscher and H. Weimer},
title = {Simulation eines {Q}uantencomputers},
year = {2003},
howpublished = {http://www.libquantum.de/files/libquantum.pdf}
}
@ARTICLE{Cai89,
AUTHOR = {J.-Y. Cai},
TITLE = {With probability one, a random oracle separates
{$\PSPACE$} from the polynomial-time hierarchy},
JOURNAL = jcss,
YEAR = {1989},
VOLUME = {38},
PAGES = {68--85}
}
@article{CaHe89,
author = {J.-Y. Cai and L. Hemachandra},
title = {Enumerative counting is hard},
journal = infcomp,
volume = {92},
year = {1989},
pages = {34--44}
}
@inproceedings{CaHe89b,
author = {J.-Y. Cai and L. Hemachandra},
title = {On the power of parity},
booktitle = proc9 # stacs,
series = lncs,
volume = {349},
publisher = springer,
year = {1989},
pages = {229--240}
}
@article{Cai90,
author = {J.-Y. Cai},
title = {A note on the determinant and permanent problem},
journal = infcomp,
volume = {84},
year = {1990},
pages = {119--127}
}
@article{CaHe91,
author = {J.-Y. Cai and L. Hemachandra},
title = {A note on enumerative counting},
journal = ipl,
volume = {38},
year = {1991},
pages = {215--219}
}
@article{CFI92,
author = {J.-Y. Cai and M. F{\"u}rer and N. Immerman},
title = {An optimal lower bound on the number of variables
for graph identification},
journal = {Combinatorica},
volume = {12},
year = {1992},
pages = {389--410}
}
@misc{CGT93,
author = {J.-Y. Cai and F. Green and T. Thierauf},
title = {On the correlation of symmetric functions},
year = {1993}
}
@InCollection{CHV93,
author = "J.-Y. Cai and L. Hemachandra and J. Vyskoc",
title = "Promise Problems and Guarded Access to Unambiguous
Computation",
booktitle = "Complexity Theory: Current Research, Edited by Klaus
Ambos-Spies, Steven Homer, and Uwe Sch{\"o}ning, Cambridge
University Press",
publisher = springer,
year = "1993",
}
@techreport{CaCh94,
author = {J.-Y. Cai and S. Chari},
title = {On the impossibility of amplifying the independence
of random variables},
institution = {Department of Computer Science, University
at Buffalo},
number = {UB-CS TR 94-15},
month = {April},
year = {1994}
}
@article{CaLi94,
author = {J.-Y. Cai and R. Lipton},
title = {Subquadratic simulations of balanced formulae by branching
programs},
journal = sicomp,
volume = {23},
year = {1994},
pages = {563--572}
}
@inproceedings{CaSi95,
author = {J. Cai and D. Sivakumar},
title = {The resolution of a {H}artmanis conjecture},
booktitle = proc36 # focs,
year = {1995},
pages = {362--371},
note = {To appear in the {\it J.~Comp. Sys. Sci.\/} ``Special Issue
for FOCS '95''}
}
@inproceedings{CNS96,
author = {J. Cai and A. Naik and D. Sivakumar},
title = {On the Existence of Hard Sparse
Sets under Weak Reductions},
booktitle = proc13 # stacs,
year = {1996},
publisher = springer,
series = lncs,
volume = {1046},
pages = {307--318}
}
@inproceedings{CaSe96,
author = {J.-Y. Cai and A. Selman},
title = {Fine separation of average time complexity classes},
booktitle = proc13 # stacs,
year = {1996},
publisher = springer,
series = lncs,
volume = {1046}
}
@misc{CaNe97,
author = {J.-Y. Cai and A. Nerurkar},
title = {An improved worst-case to average-case
connection for lattice problems},
year = {1997},
note = {Draft paper, submitted}
}
@incollection{CaOg97,
author = {J.-Y. Cai and M. Ogihara},
title = {Sparse hard sets},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
pages = {53--80}
}
@inproceedings{CaSi97,
author = {J.-Y. Cai and D. Sivakumar},
title = {Resolution of {H}artmanis' conjecture for {NL}-hard
sparse sets},
booktitle = proc3 # "COCOON",
year = {1997},
note = {Winner of the Hao Wang Award}
}
@inproceedings{CSS97,
author = {J.-Y. Cai and D. Sivakumar and M. Strauss},
title = {Constant depth circuits and the {Lutz} hypothesis},
booktitle = proc38 # focs,
year = {1997},
note = {to appear}
}
@inproceedings{CaCh93,
author = {L. Cai and J. Chen},
title = {Fixed-parameter tractability and approximation of
{NP}-hard optimization problems},
booktitle = {Proc.\ 2nd Israel Symp.\ on Theory of Computing and
Systems},
year = {1993},
pages = {118--126}
}
@inproceedings{CCDF94,
author = {L. Cai and J. Chen and R. Downey and M. Fellows},
title = {On the structure of parametrized problems in {NP}},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {509--520}
}
@article{CCDF95,
author = {L. Cai and J. Chen and R. Downey and M. Fellows},
title = {On the Parameterized Complexity of Problems in {NP}},
journal = infcomp,
volume = {123},
year = {1995},
pages = {38--49}
}
@article{CaCh95,
author = {L. Cai and J. Chen},
title = {On input read-modes of alternating {T}uring machines},
journal = tcs,
volume = {148},
year = {1995},
pages = {33--55}
}
@misc{CCH95,
author = {L. Cai and J. Chen and J. H{\aa}stad},
title = {Circuit bottom fan-in and computational power},
year = {1995},
note = "Accepted to " # sicomp
}
@inproceedings{CCH97,
author = {L. Cai and J. Chen and J. H{\aa}stad},
title = {Circuit bottom fan-in and computational power},
booktitle = proc12 # ccc,
year = {1997},
pages = {158--164}
}
@inproceedings{CaiLu07,
author = {J-Y. Cai and P. Lu},
title = {Holographic algorithms: from art to science},
booktitle = proc39 # stoc,
year = {2007},
pages = {401--410}
}
@article{CaiLu08,
author = {J-Y. Cai and P. Lu},
title = {Basis Collapse in Holographic Algorithms},
journal = compcomp,
volume = {17},
pages = {254--281},
year = {2008}
}
@article{CaiLu09,
author = {J.-Y. Cai and P. Lu},
title = {Holographic Algorithms: The Power of Dimensionality
Resolved},
journal = tcs,
volume = {410},
pages = {1618--1628},
year = {2009}
}
@article{CCL10,
author = {J.-Y. Cai and X. Chen and D. Li},
title = {A quadratic lower bound for the permanent and
determinant problem over any characteristic not equal to 2},
journal = compcomp,
year = {2010},
volume = {19},
pages = {37--56}
}
@inproceedings{CLX10,
author = {J.-Y. Cai and P. Lu and M. Xia},
title = {Holographic Algorithms with Matchgates Capture
Precisely Tractable Planar {\#CSP}},
booktitle = proc51 # focs,
year = {2010},
pages = {427--436}
}
@inproceedings{CCLL10,
author = {J.-Y. Cai and X. Chen and R. Lipton and P. Lu},
title = {On Tractable Exponential Sums},
booktitle = "Proceedings of the 2010 Frontiers in Algorithms Workshop",
series = lncs,
publisher = springer,
volume = {6213},
year = {2010},
pages = {48--59}
}
@misc{CCL11,
author = {J.-Y. Cai and X. Chen and P. Lu},
title = {Graph homomorphisms with complex values: A dichotomy theorem},
year = {2011},
howpublished = {http://arxiv.org/abs/0903.4728},
note = {v2, 2011}
}
@article{CLX11,
author = {J.-Y. Cai and P. Lu and M. Xia},
title = {Computational complexity of holant problems},
journal = sicomp,
year = {2011},
volume = {40},
pages = {1101--1132}
}
@inproceedings{Cai13,
author = {J.-Y. Cai},
title = {Complexity Dichotomy for Counting Problems},
booktitle = {Proceedings of LATA 2013},
series = lncs,
volume = {7810},
year = {2013},
publisher = springer,
pages = {1--11}
}
@misc{CCL13,
author = {J.-Y. Cai and X. Chen and P. Lu},
title = {Graph homomorphisms with complex values: A dichotomy theorem},
journal = sicomp,
volume = {42},
year = {2013},
pages = {924--1029}
}
@article{CLX14,
author = {J.-Y. Cai and P. Lu and M. Xia},
title = {The complexity of complex weighted {B}oolean {\#}{C}{S}{P}},
journal = jcss,
volume = {80},
year = {2014},
pages = {217--236}
}
@ARTICLE{CaSh96,
author = "A.R. Calderbank and P.W. Shor",
title = "Good quantum error-correcting codes exist",
journal = "Physical Review Letters",
volume = "54(2)",
year = "1996",
pages = "1098-1105"
}
@techreport{CRT04,
author = {E.J. Cand{\`e}s and J. Romberg and T. Tao},
title = {Robust uncertainty principles: Exact signal reconstruction
from highly incomplete frequency information},
institution = {California Institute of Technology},
year = {2004},
note = {arXiv.math.CA}
}
@techreport{CaTa04,
author = {E.J. Cand{\`e}s and T. Tao},
title = {Near optimal signal recovery from random projections and
universal encoding strategies},
institution = {California Institute of Technology},
year = {2004},
note = {arXiv.math.CA/0410542 v1}
}
@article{CaGo93,
author = {R. Canetti and O. Goldreich},
title = {Bounds on tradeoffs between randomness and communication
complexity},
journal = compcomp,
volume = {3},
year = {1993},
pages = {141--167}
}
@article{CGG90,
author = {L. Caniglia and J.A. Guccione and J.J. Guccione},
title = {Ideals of generic minors},
journal = {Commutative Algebra},
volume = {18},
year = {1990},
pages = {2633--2640}
}
@article{CaZa81,
author = {D Cantor and H. Zassenhaus},
title = {A new algorithm for factoring polynomials over finite fields},
journal = {Mathematics of Computation},
volume = {36},
year = {1981},
pages = {587--592}
}
@misc{CCL14,
author = {Zhengjun Cao and Zhenfu Cao and Lihua Liu},
title = {Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of {S}hor's Algorithm},
year = {2014},
howpublished = {https://arxiv.org/abs/1408.6252}
}
@inproceedings{CLM76,
author = {E. Cardoza and R. Lipton and A. Meyer},
title = {Exponential space complete problems for {P}etri nets
and commutative semigroups},
booktitle = proc8 # stoc,
year = {1976},
pages = {50--54}
}
@article{Car92,
author = {I. Carlstrom},
title = {Foreground automata},
journal = jcss,
volume = {45},
year = {1992},
pages = {367--384}
}
@article{CaWe79,
author = {J. Carter and M. Wegman},
title = {Universal classes of hash functions},
journal = jcss,
volume = {18},
year = {1979},
pages = {143--154}
}
@techreport{CaRo86,
author = {J. Case and J. Royer},
title = {Progressions of relatively succinct programs in
subrecursive hierarchies},
institution = {Computer Science Department, The University of
Chicago},
number = {86-007},
year = {1986}
}
@article{Cau89,
author = {H.J. Caulfield},
title = {Computing with light},
journal = {Byte},
volume = {14},
year = {1989},
month = {October},
pages = {231--237}
}
@article{CMTV98,
author = {H. Caussinus and P. McKenzie and D. Th{\'e}rien and
H. Vollmer},
title = {Nondeterministic {NC$^1$} computation},
journal = jcss,
volume = {57},
year = {1998},
pages = {200--212}
}
@article{CHW87,
author = {M. Chams and A. Hertz and D. deWerra},
title = {Some experiments with simulated annealing for
coloring graphs},
journal = {European J. Oper. Research},
volume = {32},
year = {1987},
pages = {260--266}
}
@article{ChXu84,
author = {C. Chamzas and W.Y. Xu},
title = {On the periodic discrete prolate spheroidal sequences},
journal = sjam,
volume = {44},
year = {1984},
pages = {1210--1217}
}
@ARTICLE{CKS81,
AUTHOR = {A. Chandra and D. Kozen and L. Stockmeyer},
TITLE = {Alternation},
JOURNAL = jacm,
VOLUME = {28},
YEAR = {1981},
PAGES = {114--133}
}
@article{ChHa82,
author = {A. Chandra and D. Harel},
title = {Structure and complexity of relational queries},
journal = jcss,
volume = {25},
year = {1982},
pages = {99--128}
}
@article{CSV84,
author = {A. Chandra and L. Stockmeyer and U. Vishkin},
title = {Constant-depth reducibility},
journal = sicomp,
volume = {13},
year = {1984},
pages = {423--439}
}
@article{CFL85,
author = {A. Chandra and S. Fortune and R. Lipton},
title = {Unbounded fan-in circuits and associative functions},
journal = jcss,
volume = {30},
year = {1985},
pages = {222--234}
}
@article{CIV88,
author = {J. Chang and O. Ibarra and A. Vergis},
title = {On the power of one-way communication},
journal = jacm,
volume = {35},
year = {1988},
pages = {697--726}
}
@article{CIP89,
author = {J. Chang and O. Ibarra and M. Palis},
title = {Efficient simulations of simple models of parallel
computation by time-bounded {ATMs} and space-bounded {TM}s},
journal = tcs,
volume = {68},
year = {1989},
pages = {19--36}
}
@article{ChRa89,
author = {J. Chang and B. Ravikumar},
title = {Strong nondeterministic {T}uring reduction--a technique
for proving intractability},
journal = jcss,
volume = {39},
year = {1989},
pages = {nnn--nnn}
}
@inproceedings{ChKR91,
author = {R. Chang and J. Kadin and P. Rohatgi},
title = {Connections between the complexity of unique satisfiability
and the threshold behavior of randomized reductions},
booktitle = proc6 # structures,
year = {1991},
pages = {255--269},
note = jcss # ", to appear"
}
@inproceedings{CRS93,
author = {S.~Chari and P.~Rohatgi and A.~Srinivasan},
title = {Randomness-optimal unique element isolation, with
applications to perfect matching and related problems},
booktitle = proc25 # stoc,
year = {1993},
pages = {458--467}
}
@inproceedings{ChRo93,
author = {S. Chari and P. Rohatgi},
title = {On completeness under random reductions},
booktitle = proc8 # structures,
year = {1993},
pages = {176--184}
}
@phdthesis{Cha94,
author = {S. Chari},
title = {Randomness as a Computational Resource: Issues in
Efficient Computation},
school = {Cornell University, Computer Science Dept.},
year = {1994},
note = {Available as Cornell CS-TR-94-1449, August 31, 1994}
}
@inproceedings{CRS94,
author = {S.~Chari and P.~Rohatgi and A.~Srinivasan},
title = {Improved algorithms via approximations of probability
distributions},
booktitle = proc26 # stoc,
year = {1994},
pages = {584--592}
}
@misc{ChRe04,
author = {D.X. Charles and K.W. Regan},
title = {On arithmetical formulas whose {J}acobians
are {G}r{\"o}bner bases},
year = {2004},
note = {Accepted subject to revisions to the
{\it Journal of Symbolic Computation}}
}
@inproceedings{ChWi09,
author = {A. Chattopadhyay and A. Wigderson},
title = {Linear systems over composite moduli},
booktitle = proc50 # focs,
year = {2009},
pages = {43--52}
}
@inproceedings{ChRa92,
author = {S. Chaudhuri and J. Radhakrishnan},
title = {The complexity of parallel prefix problems on small
domains},
booktitle = proc33 # focs,
year = {1992},
pages = {638--647}
}
@inproceedings{CHLT93,
author = {S. Chaudhuri and M. Herlihy and N. Lynch and M. Tuttle},
title = {A tight lower bound for {$k$}-set agreement},
booktitle = proc34 # focs,
year = {1993},
pages = {206--215}
}
@article{ChMo85,
author = {B. Chazelle and L. Monier},
title = {A model of computation for {VLSI} with related complexity
results},
journal = jacm,
volume = {32},
year = {1985},
pages = {573--588}
}
@article{Cha98,
author = {B. Chazelle},
title = {A spectral approach to lower bounds, with application
to geometric searching},
journal = sicomp,
volume = {27},
year = {1998},
pages = {545--556}
}
@ARTICLE{ChYa91,
AUTHOR = {J. Chen and C. Yap},
TITLE = {Reversal complexity},
JOURNAL = sicomp,
VOLUME ={20},
YEAR = {1991},
PAGES = {622--638}
}
@article{ChHo92,
author = {R.-J. Chen and Y.-S. Hou},
title = {Non-associative parallel prefix computation},
journal = ipl,
volume = {44},
year = {1992},
pages = {91--94}
}
@article{ChFa91,
author = {W.-T. Chen and M.-Y. Fang},
title = {An efficient procedure for theorem proving in
propositional logic on vector computers},
journal = {Parallel Computing},
volume = {17},
year = {1991},
pages = {983--995}
}
@article{ChTo91,
author = {Z.-Z. Chen and S. Toda},
title = {On the complexity of computing optimal solutions},
journal = ijfcs,
volume = {2},
year = {1991},
pages = {207--220}
}
@article{Chen95,
author = {Z.-Z. Chen},
title = {The Maximal f-Dependent Set Problem for Planar Graphs
Is in {NC}},
journal = tcs,
volume = {143},
year = {1995},
pages = {309--318}
}
@article{ChTo95,
author = {Z.-Z. Chen and S. Toda},
title = {The complexity of selecting maximal solutions},
journal = infcon,
volume = {119},
year = {1995},
pages = {231--239}
}
@inproceedings{ChKa97,
author = {Z-Z.~ Chen and M.-Y.~Kao},
title = {Reducing Randomness via Irrational Numbers},
booktitle = proc29 # stoc,
year = {1997},
pages = {200--209}
}
@article{ChSa92,
author = {L. Cheng and A. Sawchuk},
title = {Three-dimensional {O}mega networks for optical
implementation},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5468--5479}
}
@article{CKL13,
author = {H.Y. Cheung and T.C. Kwok and L.C. Lau},
title = {Fast matrix rank algorithms and applications},
journal = jacm,
volume = {60},
year = {2013},
pages = {1--25}
}
@ARTICLE{ChMa81,
AUTHOR = {P. Chew and M. Machtey},
TITLE = {A note on structure and looking-back applied to the
relative complexity of computable functions},
JOURNAL = jcss,
YEAR = {1981},
VOLUME = {22},
PAGES = {53--59}
}
@article{ChNi85,
author = {N. Chiba and T. Nishizeki},
title = {Arboricity and subgraph listing algorithms},
journal = sicomp,
volume = {14},
year = {1985},
pages = {210--223}
}
@ARTICLE{Cho77,
AUTHOR = {C. Choffrut},
TITLE ={Une caract\'erisation des fonctions s\'equentielles et des
fonctions sous-s\'equentielles en tant des relations rationelles},
JOURNAL = tcs,
VOLUME = {5},
YEAR = {1977},
PAGES = {325--337}
}
@ARTICLE{ChCu83,
AUTHOR = {C. Choffrut and K. Culik},
TITLE = {Properties of finite and pushdown transducers},
JOURNAL = sicomp,
YEAR = {1983},
PAGES = {300--315}
}
@inproceedings{ChGo85,
author = {B. Chor and O. Goldreich},
title = {Unbiased bits from sources of weak randomness and
probabilistic communication complexity},
booktitle = proc26 # focs,
year = {1985},
pages = {230--261}
}
@article{ChGo88,
author = {B. Chor and O. Goldreich},
title = {Unbiased bits from sources of weak randomness and
probabilistic communication complexity},
journal = sicomp,
volume = {17},
year = {1988},
pages = {230--261}
}
@article{Chr86,
author = {M. Chrobak},
title = {Hierarchies of one-way multihead automata languages},
journal = tcs,
volume = {48},
year = {1986},
pages = {153--181}
}
@article{CKR91,
author = {M. Chrobak and H. Karloff and T. Razdik},
title = {Connectivity vs. reachability},
journal = infcomp,
volume = {91},
year = {1991},
pages = {177--188}
}
%! Useful for "query computing with partial information queries".
@ARTICLE{CGK98,
author = "I.L. Chuang and N. Gershenfeld and M. Kubinec",
title = "Experimental implementation of fast quantum searching",
journal = "Physical Review Letters",
volume = "80(15)",
year = "1998",
pages = "3408-3411"
}
@ARTICLE{CVZLL98,
author = "I.L. Chuang and L.M.K. Vandersypen and X. Zhou and D.W. Leung and S. Lloyd",
title = "Experimental realization of a quantum algorithm",
journal = "Nature",
volume = "393",
year = "1998",
pages = "143-146"
}
@article{ChEr72,
author = {V. Chv{\'a}tal and P. Erd{\H{o}}s},
title = {A note on {H}amiltonian paths},
journal = {Discrete Mathematics},
volume = {2},
year = {1972},
pages = {111--113}
}
@article{Chu89,
author = {F.R.K. Chung},
title = {Diameters and eigenvalues},
journal = jams,
volume = {2},
year = {1989},
pages = {187--196}
}
@inproceedings{CEI96,
author = {M. Clegg and J. Edmonds and R. Impagliazzo},
title = {Using the Groebner Basis
Algorithm to Find Proofs of Unsatisfiability},
booktitle = proc28 # stoc,
year = {1996},
pages = {174--183}
}
@inproceedings{Chl07,
author = {E. Chlamtac},
title = {Approximation algorithms using hierarchies of semidefinite programming relaxations},
booktitle = proc48 # focs,
year = {2007},
pages = {691--701}
}
@misc{Cla10,
author = {P. Clark},
title = {The {C}hevalley-{W}arning theorem (featuring...the {E}rd{\H{o}}s-{G}insburg-{Z}iv theorem)},
howpublished = {http://math.uga.edu/~pete/4400ChevalleyWarning.pdf},
year = {2010}
}
@article{CJL08,
author = {S. Clark and R. Jozsa and N. Linden},
title = {Generalized {C}lifford groups and simulation of associated quantum circuits},
journal = {Quantum Information and Computation},
volume = {8},
year = {2008},
pages = {106--126}
}
@article{Cle91,
author = {R. Cleve},
title = {Towards optimal simulations of formulas by bounded-width
programs},
journal = {Computational Complexity},
volume = {1},
year = {1991},
pages = {91--105}
}
@article{CEMM98,
author = {R. Cleve and A. Ekert and C. Macchiavello and M. Mosca},
title = {Quantum algorithms revisited},
journal = {Proc. Royal Soc. Lon. A},
volume = {400},
year = {1998},
pages = {339--354}
}
@inproceedings{ClWa00,
author = {R. Cleve and J. Watrous},
title = {Fast parallel circuits for the quantum {F}ourier transform},
booktitle = proc41 # focs,
year = {2000},
pages = {526--536}
}
@INCOLLECTION{Clo90,
AUTHOR = {P. Clote},
TITLE = {Sequential, machine-independent characterizations of the
parallel complexity classes {ALOGTIME, NC$^1$, AC$^0$, and NC}},
BOOKTITLE = {Feasible Mathematics},
EDITOR = {S. Buss and P. Scott},
PUBLISHER = {Birkh{\"a}user},
YEAR = {1990},
PAGES = {49--70}
}
@inproceedings{Clo90b,
author = {P. Clote},
title = {Bounded arithmetic and computational complexity},
booktitle = proc5 # structures,
year = {1990},
pages = {186--199}
}
@incollection{Clo90c,
author = {P. Clote},
title = {A smash-based hierarchy between {PTIME} and {PSPACE}},
booktitle = {Contemporary Mathematics},
publisher = {American Mathematical Society},
volume = {108},
year = {1990},
pages = {85--100}
}
@misc{Clo91,
author = {P. Clote},
title = {Stack-register machines, non-determinism, the linear time
hierarchy, and uniform boolean circuit classes},
year = {1991}
}
@article{ClTa92,
author = {P. Clote and G. Takeuti},
title = {Bounded arithmetic for {NC, ALogTIME, L, and NL}},
journal = {Annals of Pure and Applied Logic},
volume = {56},
year = {1992},
pages = {73--117}
}
@incollection{ClKr93,
author = {P. Clote and J. Kraj{\'\i\v{c}}ek},
title = {Some open problems in arithmetic, proof theory, and
computational complexity},
booktitle = {Arithmetic, Proof Theory, and Computational
Complexity},
editor = {P. Clote and J. Kraj{\'\i\v{c}}ek},
publisher = {Oxford University Press},
year = {1993},
pages = {2--19}
}
@inproceedings{Cob64,
author = {A. Cobham},
title = {The intrinsic computational difficulty of functions},
booktitle = {Proc.\ 1964 Congress for Logic, Mathematics,
and Philosophy of Science},
year = {1964},
pages = {24--30}
}
@article{CoGo90,
author = {J. Coffey and R. Goodman},
title = {Any code of which we cannot think is good},
journal = itit,
volume = {36},
year = {1990},
pages = {1453--1461}
}
@book{Coh91,
author = {D. Cohen},
title = {Introduction to Computer Theory (revised edition)},
publisher = {Wiley},
address = {New York},
year = {1991}
}
@inproceedings{CHZ94,
author = {G. Cohen and L. Huguet and G. Z{\'e}mor},
title = {Bounds on generalized weights},
booktitle = {Algebraic Coding---First French-Israeli Workshop,
Paris, July 1993},
series = lncs,
volume = {781},
publisher = springer,
year = {1994},
pages = {270--277}
}
@misc{CoSh10,
author = {G. Cohen and A. Shpilka},
title = {On the degree of symmetric functions on the
{B}oolean cube},
year = {2010}
}
@article{Cole77,
author = {R. Cole},
title = {Slowing down sorting networks to obtain faster sorting
algorithms},
journal = jacm,
volume = {34},
year = {1987},
pages = {200--208}
}
@article{Cole88,
author = {R. Cole},
title = {Parallel merge sort},
journal = sicomp,
volume = {17},
year = {1988},
pages = {770--785},
note = {Corrigendum in vol. 22, 1993, p1349}
}
@article{CoVi86,
author = {R. Cole and U. Vishkin},
title = {Deterministic coin tossing with applications to optimal
parallel list ranking},
journal = infcon,
volume = {70},
year = {1986},
pages = {32--53}
}
@article{CoVi88,
author = {R. Cole and U. Vishkin},
title = {Approximate parallel scheduling. Part {I}:
The basic technique with applications to optimal parallel list ranking in
logarithmic time},
journal = sicomp,
volume = {17},
year = {1988},
pages = {128--142}
}
@article{CoVi88b,
author = {R. Cole and U. Vishkin},
title = {The accelerated centroid decomposition technique for
optimal parallel tree evaluation in logarithmic time},
journal = {Algorithmica},
volume = {3},
year = {1988},
pages = {329--346}
}
@article{CoVi89,
author = {R.~Cole and U.~Vishkin},
title = {Faster optimal parallel prefix sums and list ranking},
journal = infcomp,
volume = {81},
year = {1989},
pages = {334--352}
}
@article{Cole69,
author = {S. Cole},
title = {Real-time computation by {$n$}-dimensional iterative
arrays of finite-state machines},
journal = {IEEE Transactions on Computing},
volume = {C--18},
year = {1969},
pages = {346--365}
}
@article{Cole71,
author = {S.~Cole},
title = {Deterministic pushdown store machines and realtime
computations},
journal = jacm,
volume = {18},
year = {1971},
pages = {306--328}
}
@ARTICLE{CoLF90,
AUTHOR = {K. Compton and C. LaFlamme},
TITLE = {An algebra and a logic for {NC$^1$}},
JOURNAL = infcomp,
VOLUME = {87},
YEAR = {1990},
PAGES = {241--263}
}
@article{Con93,
author = {A. Condon},
title = {The complexity of the {M}ax {W}ord problem and the
power of one-way interactive proof systems},
journal = compcomp,
volume = {3},
year = {1993},
pages = {292--305}
}
@Article{Con94,
author = "Condon",
title = "A Theory of Strict {P}-Completeness",
journal = "CMPCMPL: Computational Complexity",
volume = "4",
year = "1994",
pages = {nnn--nnn}
}
@inproceedings{CHPW94,
author = {A. Condon and L. Hellerstein and S. Pottle and
A. Wigderson},
title = {On the power of finite automata with both nondeterministic
and probabilistic states},
booktitle = proc26 # stoc,
year = {1994},
pages = {676--685}
}
@article{Con90,
author = {M. Conner},
title = {Sequential machines realized by group representations},
journal = infcomp,
volume = {85},
year = {1990},
pages = {183--201}
}
@book{Nuprl86,
author = {R.L. Constable and S.F. Allen and H.M. Bromley and
W.R. Cleaveland and J.F. Cremer and R.W. Harper and D.J. Howe and
T.B. Knoblock and N.P. Mendler and P. Panangaden and J.T. Sasaki and
S.F. Smith},
title = {Implementing Mathematics with the Nuprl Proof
Development System},
publisher = {Prentice-Hall},
address = {Englewood Cliffs, NJ},
year = {1986}
}
@article{CoAa69,
author = {S. Cook and S. Aanderaa},
title = {On the minimum computation time of functions},
journal = trans-ams,
volume = {142},
year = {1969},
pages = {294--314}
}
@INPROCEEDINGS{Cook71c,
AUTHOR = {S. Cook},
TITLE = {Linear time simulation of deterministic two-way pushdown
automata},
BOOKTITLE = {Proceedings, IFIP '71},
PUBLISHER = {North--Holland},
YEAR = {1971},
PAGES = {75--80}
}
@article{Cook71b,
author = {S. Cook},
title = {Characterizations of pushdown machines in terms of
time-bounded computers},
journal = jacm,
volume = {18},
year = {1971},
pages = {4--18}
}
@inproceedings{Cook71,
author = {S. Cook},
title = {The complexity of theorem-proving procedures},
booktitle = proc3 # stoc,
year = {1971},
pages = {151--158}
}
@ARTICLE{CoRe73,
AUTHOR = {S. Cook and R. Reckhow},
TITLE = {Time bounded random access machines},
JOURNAL = jcss,
VOLUME = {7},
YEAR = {1973},
PAGES = {354--375}
}
@article{Cook74,
author = {S. Cook},
title = {An observation on time-storage trade off},
journal = jcss,
volume = {9},
year = {1974},
pages = {308--316}
}
@inproceedings{Cook75,
author = {S. Cook},
title = {Feasibly constructive proofs and the propositional
calculus},
booktile = proc7 # stoc,
year = {1975},
pages = {87--93}
}
@article{CoRe79,
author = {S. Cook and R. Reckhow},
title = {The relative efficiency of propositional proof systems},
journal = jsl,
volume = {44},
year = {1979},
pages = {36--50}
}
@article{Cook85,
author = {S.~Cook},
title = {A taxonomy of problems with fast parallel algorithms},
journal = infcon,
volume = {64},
year = {1985},
pages = {2--22}
}
@article{CoMcK87,
author = {S. Cook and P. McKenzie},
title = {Problems complete for deterministic logarithmic space},
journal = {Journal of Algorithms},
volume = {8},
year = {1987},
pages = {385--394}
}
@article{CoUr93,
author = {S. Cook and A. Urquhart},
title = {Functional interpretations of feasibly constructive
arithmetic},
journal = {Annals of Pure and Applied Logic},
volume = {63},
year = {1993}
}
@article{Cook04,
author = {Matthew Cook},
title = {Universality in Elementary Cellular Automata},
journal = {Complex Systems},
volume = {15},
year = {2004},
pages = {1--40}
}
@article{CCT87,
author = {W. Cook and C. Coullard and G. Tur{\'a}n},
title = {On the complexity of cutting-plane proofs},
journal = {Discrete Applied Mathematics},
volume = {18},
year = {1987},
pages = {25--38}
}
@article{CoTu65,
author = {J.W. Cooley and J.W. Tukey},
title = {An algorithm for the machine calculation of complex
{F}ourier series},
journal = {Math.\ Comp.},
volume = {19},
year = {1965},
pages = {297--301}
}
@article{CoWi90,
author = {D. Coppersmith and S. Winograd},
title = {Matrix multiplication via arithmetical progressions},
journal = {J. Symbolic Computation},
volume = {9},
year = {1990},
pages = {251--280}
}
@article{Cor90,
author = {J. Corcoran},
title = {Categoricity},
journal = {History of Philosophy and Logic},
volume = {1},
year = {1980},
pages = {187--207}
}
@book{CLR90,
author = {T. Cormen and C. Leiserson and R. Rivest},
title = {Introduction to Algorithms},
publisher = {MIT Press},
year = {1990}
}
@book{CLO92,
author = {D. Cox and J. Little and D. O'Shea},
title = {Ideals, Varieties, and Algorithms},
publisher = springer,
year = {1992}
}
@book{CLO96,
author = {D. Cox and J. Little and D. O'Shea},
title = {Ideals, Varieties, and Algorithms, Second Edition},
series = {Undergraduate Texts in Mathematics},
publisher = springer,
year = {1996}
}
@misc{Cra96,
author = {K. Crary},
title = {A unifoed framework for modules and objects and its
application to software design (extended abstract)},
month = {September},
year = {1996}
}
@inproceedings{Cra97,
author = {K. Crary},
title = {Foundations for the Implementation of Higher-Order Subtyping},
booktitle = {Proceedings, 1997 International Conference on
Functional Programming},
year = {1997},
pages = {nnn--nnn}
}
@inproceedings{CGRS04,
author = {M. Crasmaru and C. Glasser and K. Regan and S. Sengupta},
title = {A protocol for serializing unique strategies},
booktitle = proc29 # mfcs,
series = lncs,
volume = {3153},
publisher = springer,
year = {2004},
pages = {660--672}
}
@inproceedings{Cre93,
author = {N. Creignou},
title = {The class of problems that are linearly equivalent to
{S}atisfiability, or a uniform method for proving {NP}-completeness},
booktitle = proc6 # csl,
series = lncs,
volume = {702},
publisher = springer,
year = {1993},
pages = {115--133}
}
@article{Cre95,
author = {N. Creignou},
title = {The class of problems that are linearly equivalent to
{S}atisfiability, or a uniform method for proving {NP}-completeness},
journal = tcs,
volume = {145},
year = {1995},
pages = {111--145}
}
@INPROCEEDINGS{CrKi88,
author="C. Crepeau and J. Kilian",
title = "Achieving oblivious transfer using weakened security assumptions",
booktitle = "[ D / P / G ] Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science",
year = "1988",
month = "October",
pages = "42-52"
}
@PHDTHESIS{Cre90,
author="C. Crepeau",
title = "Correct and Private Reductions among Oblivious Transfers",
school = "[ D / P / G ] Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology",
year = "1990",
month = "February"
}
@ARTICLE{Cre94,
author = "C. Crepeau",
title = "Quantum oblivious transfer",
journal = "[ D / P / G ] Journal of Modern Optics",
volume = "41(12)",
month = "December",
year = "1994",
pages = "2445-2454"
}
@article{CrSi93,
author = {P. Crescenzi and R. Silvestri},
title = {Average measure, descriptive complexity, and approximation
of maximization problems},
journal = ijfcs,
volume = {4},
year = {1993},
pages = {15--30}
}
@ARTICLE{CrPe91,
AUTHOR = {M. Crochemore and D. Perrin},
TITLE = {Two-way string matching},
JOURNAL = jacm,
VOLUME = {38},
YEAR = {1991},
PAGES = {651--675}
}
@article{CrRy91,
author = {M. Crochemore and W. Rytter},
title = {Usefulness of the {Karp-Miller-Rosenberg} algorithm
in parallel computations on strings and arrays},
journal = tcs,
volume = {88},
year = {1991},
pages = {59--82}
}
@techreport{CrSh93a,
author = {J. Crossley and J. Shepherdson},
title = {Extracting programs from proofs by an extension of the
{C}urry-{H}oward process: {Part I}},
institution = {Department of Mathematics, Monash University},
address = {Clayton, Victoria, Australia 3168},
number = {79a},
month = {March},
year = {1993}
}
@techreport{CrSh93b,
author = {J. Crossley and J. Shepherdson},
title = {Extracting programs from proofs by an extension of the
{C}urry-{H}oward process: {Part II}},
institution = {Department of Mathematics, Monash University},
address = {Clayton, Victoria, Australia 3168},
number = {79b},
month = {March},
year = {1993}
}
@inproceedings{CuRo93,
author = {F. Cucker and F. Rossell{\'o}},
title = {Recursiveness over the complex numbers is time-bounded},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {260--267}
}
@article{CGS84,
author = {K. Culik and J. Gruska and A. Salomaa},
title = {Systolic trellis automata},
journal = {Internat. J. Comput. Math.},
volume = {16},
year = {1984},
pages = {3--22}
}
@article{CuKa94,
author = {K. {Culik II} and J. Karhum{\"a}ki},
title = {Finite automata computing real functions},
journal = sicomp,
volume = {23},
year = {1994},
pages = {789--814}
}
@inproceedings{CKetal93,
author = {D. Culler and R. Karp and D. Patterson and A. Sahay
and K.E. Schauser and E. Santos and R. Subramonian and T. von Eicken},
title = {Log{P}: Towards a realistic model of parallel computation},
booktitle = proc4 # "ACM SIGPLAN",
year = {1993},
pages = {nnn--nnn}
}
@book{Cut80,
author = {N. Cutland},
title = {Computability},
publisher = {Cambridge University Press},
year = {1980}
}
@inproceedings{Damm90,
author = {C. Damm},
title = {The complexity of symmetric functions in parity normal forms},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {232--238}
}
@article{Damm90b,
author = {C. Damm},
title = {On problems complete for {$\oplus$L}},
journal = ipl,
volume = {36},
year = {1990},
pages = {247--250}
}
@article{DaMe92,
author = {C. Damm and C. Meinel},
title = {Separating complexity classes related to
{$\Omega$}-decision trees},
journal = tcs,
volume = {106},
year = {1992},
pages = {351--360}
}
@article{DFH92,
author = {N. Davidson and A. Friesem and E. Hasman},
title = {On the limits of optical interconnects},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5426--5430}
}
@article{Dav81,
author = {M. Davio},
title = {Kronecker products and shuffle algebra},
journal = {IEEE Transactions on Computers},
volume = {C-30},
month = {February},
year = {1981},
pages = {116--125}
}
@article{DaIm07,
author = {S. Davis and R. Impagliazzo},
title = {Models of Greedy Algorithms for Graph Problems },
journal = {Algorithmica},
volume = {54},
year = {2007},
pages = {269--317}
}
@article{DHHMNO04,
author = {C. Dawson and H. Haselgrove and A. Hines and
D. Mortimer and M. Nielsen and T. Osborne},
title = {Quantum computing and polynomial equations over the finite
field {$Z_2$}},
journal = {Quantum Information and Computation},
volume = {5},
year = {2004},
pages = {102--112}
}
@article{DeDM03,
author = {J. Dehaene and B.L.R. De Moor},
title = {The {C}lifford group, stabilizer states, and linear and quadratic operations over {GF}(2)},
journal = {Phys. Rev. A},
volume = {68},
year = {2003},
pages = {042318}
}
@article{DeLu92,
author = {B. DeIaco and F. Luccio},
title = {Finding all the palindromes in a binary tree in
linear time and space},
journal = ipl,
volume = {44},
year = {1992},
pages = {73--77}
}
@article{DeLi78,
author = {R. DeMillo and R. Lipton},
title = {A Probabilistic Remark on Algebraic Program Testing},
journal = ipl,
year = {1978},
volume = {7},
pages = {193--195}
}
@inproceedings{DeLi79,
author = {R. DeMillo and R. Lipton},
title = {Some connections between mathematical logic and complexity
theory},
booktitle = proc11 # stoc,
year = {1979},
pages = {45--57}
}
@inproceedings{DeLi80,
author = {R. DeMillo and R. Lipton},
title = {The consistency of {``P=NP''} and related problems
with fragments of number theory},
booktitle = proc12 # stoc,
year = {1980},
pages = {45--57}
}
@inproceedings{DTGR11,
author = {Murat Demirbas and
Serafettin Tasci and
Hanifi Gunes and
Atri Rudra},
title = {Singlehop Collaborative Feedback Primitives for Threshold
Querying in Wireless Sensor Networks},
booktitle = {Proceedings of the 25th IEEE International Symposium on Parallel and Distributed
Processing},
year = {2011},
pages = {322-333},
ee = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2011.39},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{DGS86,
author = {L. Denenberg and Y. Gurevich and S. Shelah},
title = {Definability by constant-depth polynomial-size circuits},
journal = infcon,
volume = {70},
year = {1986},
pages = {216--240}
}
@inproceedings{DePe92,
author = {A. De Santis and G. Persiano},
title = {Zero-knowledge proofs of knowledge without interaction},
booktitle = proc32 # focs,
year = {1992},
pages = {427--436}
}
@article{Deu85,
author = {D. Deutsch},
title = {Quantum theory, the {C}hurch-{T}uring principle,
and the universal quantum computer},
journal = {Proceedings of the Royal Society},
address = {London},
volume = {A400},
year = {1985},
pages = {97--117}
}
@INPROCEEDINGS{DeJo92,
author="D. Deutsch and R. Jozsa",
title = "Rapid solution of problems by quantum computation",
booktitle = "Proceedings of the Royal Society of London",
year = "1992",
volume = "438(1907)",
series = "Series A",
pages = "553-558"
}
@INPROCEEDINGS{Deu89,
author="D. Deutsch",
title = "Quantum computational networks",
booktitle = "Proceedings of the Royal Society of London",
year = "1989",
volume = "425(1868)",
series = "Series A",
pages = "73-90"
}
@techreport{Dew81,
author = {A.K. Dewdney},
title = {Fast {T}uring reductions between problems in {NP}},
institution = {Department of Computer Science, University
of Western Ontario},
address = {London, Ontario, Canada N6A 5B9},
year = {1981},
note = {Reports \#68--\#76, subtitled as chapters 1--9,
the last four in 1982--1984}
}
@article{Dew82,
author = {A.K. Dewdney},
title = {Linear time transformations between combinatorial
problems},
journal = ijcm,
volume = {11},
year = {1982},
pages = {91--110}
}
@inproceedings{Dew89,
author = {A.K. Dewdney},
title = {Fast {T}uring reductions of combinatorial problems
and their algorithms},
booktitle = {Combinatorial Mathematics: Proceedings of the
Third International Conference},
editor = {G. Bloom and R. Graham and J. Malkevitch},
series = {Annals of the New York Academy of Sciences},
volume = {555},
year = {1989},
pages = {171--180}
}
@article{DiTo90,
author = {J. D{\'i}az and J. Tor{\'a}n},
title = {Classes of bounded nondeterminism},
journal = mst,
volume = {23},
year = {1990},
pages = {21--32}
}
@article{DFGS91,
author = {A. Dickenstein and N. Fitchas and M. Giusti and C. Sessa},
title = {The membership problem for unmixed polynomial ideals is
solvable in single exponential time},
journal = {Discrete Applied Mathematics},
volume = {33},
year = {1991},
pages = {73--94}
}
@techreport{DSZ93,
author = {P. Dietz and J. Seiferas and J. Zhang},
title = {A tight lower bound for on-line monotonic list labeling},
institution = {Computer Science, University of Rochester},
number = {478},
month = {November},
year = {1993}
}
@techreport{DMS93,
author = {P. Dietz and I. Macarie and J. Seiferas},
title = {Bits and relative order from residues,
space efficiently},
institution = {Computer Science, University of Rochester},
number = {464},
month = {October},
year = {1993}
}
@ARTICLE{DMS91,
AUTHOR = {M. Dietzfelbinger and W. Maass and G. Schnitger},
TITLE = {The complexity of matrix transposition on one-tape off-line
{Turing} machines},
JOURNAL = tcs,
VOLUME = {82},
YEAR = {1991},
PAGES = {113--129}
}
@inproceedings{DGMP92,
author = {M. Dietzfelbinger and J. Gil and Y. Matias and
N. Pippenger},
title = {Polynomial hash functions are reliable},
booktitle = proc19 # icalp,
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {623},
YEAR = {1992},
PAGES = {235--246}
}
@article{DiMa93,
author = {M. Dietzfelbinger and W. Maass},
title = {The complexity of matrix transposition on one-tape off-line
Turing machines with output tape},
journal = tcs,
volume = {108},
year = {1993},
pages = {271--290}
}
@inproceedings{Die93,
author = {M. Dietzfelbinger},
title = {Simulations between different models of parallel computers},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {16--30}
}
@article{DiHe76,
author = {W. Diffie and M. Hellman},
title = {New directions in cryptography},
journal = itit,
volume = {22},
year = {1976},
pages = {664--654}
}
@article{Din07,
author = {Irit Dinur},
title = {The {PCP T}heorem by gap amplification},
journal = jacm,
volume = {54},
year = {2007},
pages = {12}
}
@ARTICLE{DiVin95,
author = "D.P. DiVincenzo",
title = "Two-bit gates are universal for quantum computation",
journal = "Physical Review A",
volume = "51(2)",
year = "1995",
pages = "1015-1022"
}
@article{DiViTe04,
author = {D. DiVicenzo and B. Terhal},
title = {Adaptive quantum computation, constant-depth circuits, and {A}rthur-{M}erlin games},
journal = {Quant. Inf. Comp.},
volume = {4},
year = {2004},
pages = {134--145}
}
@article{DiPa04,
author="John D. Dixon and Daniel Panario",
title="The Degree of the Splitting Field of a Random Polynomial over a Finite Field",
journal="The Electronic Journal of Combinatorics",
volume="11",
number="1",
year="2004",
url="http://www.combinatorics.org/Volume_11/Abstracts/v11i1r70.html"
}
@misc{Dob17,
author = {James Dobler},
title = {{TETRIS}: a {\#SAT} Solver},
year = {2017}
}
@misc{DoRu17,
author = {J. Dobler and A. Rudra},
title = {Implementation of {T}etris as a model counter},
year = {2017},
howpublished = {https://arxiv.org/abs/1701.07473}
}
@article{DoHo09,
author = {C. Dohotaru and P. Hoyer},
title = {Exact quantum lower bound for {G}rover's problem},
journal = {Quantum Information and Computation},
year = {2009},
volume = {9},
pages = {533--540}
}
@inproceedings{DDPW83,
author = {D. Dolev and C. Dwork and N. Pippenger and A. Wigderson},
title = {Superconcentrators, generalizers, and generalized connectors
(preliminary version)},
booktitle = proc15 # stoc,
year = {1983},
pages = {42--51}
}
@article{DoFe92,
author = {D. Dolev and T. Feder},
title = {Determinism vs. nondeterminism in multiparty communication
complexity},
journal = sicomp,
volume = {21},
year = {1992},
pages = {889--895}
}
@ARTICLE{DRBH95,
author = "P. Domokosa and J.M. Raymond and M. Brune and S. Haroche",
title = "Simple cavity-QED two-bit universal quantum logic gate: The principle and expected performances",
journal = "Physical Review Letters",
volume = "52",
year = "1996",
pages = "3554"
}
@article{DoSt89,
author = {D.L. Donoho and P.B. Stark},
title = {Uncertainty principles and signal recovery},
journal = {SIAM J.\ Appl.\ Math.},
volume = {49},
pages = {906--931},
year = {1989}
}
@book{Doob91,
author = {J. Doob},
title = {Measure Theory},
publisher = springer,
address = {New York},
year = {1991}
}
@unpublished{Dowd85,
author = {M. Dowd},
title = {Model-theoretic aspects of {$\P \neq \NP$}},
year = {1985},
note = {Typewritten manuscript}
}
@misc{Dowd86,
author = {M. Dowd},
title = {Notes on log space representation},
year = {1986},
note = "Typewritten manuscript"
}
@inproceedings{DoFe92a,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter intractability (extended abstract)},
booktitle = proc7 # structures,
year = {1992},
pages = {36--49},
note = sicomp # ", to appear"
}
@misc{DoLa06,
author = {T. Downarowicz and Y. Lacroix},
title = {The law of series},
year = {2006},
note = {arXiv.org math/0601166}
}
@misc{DoFeII,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {II}:
On completeness for {W[1]}},
year = {1992},
note = tcs # ", to appear"
}
@misc{DoFe92II,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {II}:
On completeness for {W[1]}},
year = {1992},
note = tcs # ", to appear"
}
@incollection{DoFe93III,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {III}:
{S}ome structural aspects of the {$W$} hierarchy},
booktitle = {Complexity Theory: Current Research},
editor = {K. A{mbos-Spies} and S. Homer and U. Sch{\"o}ning},
publisher = {Cambridge Univ. Press},
year = {1993},
pages = {191--226}
}
@inproceedings{DEF93,
author = {R. Downey and P. Evans and M. Fellows},
title = {Parameterized learning complexity},
booktitle = proc6 # colt,
year = {1993},
pages = {51--57}
}
@inproceedings{DFKHW94,
author = {R. Downey and M. Fellows and B. Kapron and
M. Hallett and H. Wareham},
title = {The parameterized complexity of some problems in
logic and linguistics},
booktitle = proc3 # lfcs,
series = lncs,
publisher = springer,
year = {1994},
note = "to appear"
}
@incollection{DoFe94,
author = {R. Downey and M. Fellows},
title = {Parameterized computational feasibility},
booktitle = {Feasible Mathematics II},
publisher = {Birkh{\"a}user},
year = {1994},
note = "to appear"
}
@article{DoFe95,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {I}: Basic
theory},
journal = sicomp,
year = {1995},
volume = {24},
pages = {873--921}
}
@article{DoFe95II,
author = {R. Downey and M. Fellows},
title = {Fixed-Parameter Tractability and Completeness {II}:
Completeness for {W[1]}},
journal = tcsa,
volume = {141},
year = {1995},
pages = {109--131}
}
@misc{DoFe96,
author = {R. Downey and M. Fellows},
title = {Threshold dominating sets and an improved characterization
of {W[2]}},
year = {1996},
note = {Draft paper}
}
@misc{DFK96,
author = {R. Downey and M. Fellows and N. Koblitz},
title = {Techniques for exponential parameterized reductions
in vertex-set problems (incomplete draft)},
year = {1996},
month = {February}
}
@inproceedings{DFT96,
author = {R. Downey and M. Fellows and U. Taylor},
title = {The complexity of relational database queries and an
improved characterization of {W[1]}},
booktitle = {Proceedings of DMTCS'96},
publisher = springer,
year = {1996},
note = {to appear}
}
@article{DFS98,
author = {R. Downey and M. Fellows and U. Stege},
title = {Parameterized Complexity: A framework for
systematically confronting computational intractability},
journal = {ACM Journal on Experimental Algorithms},
year = {1998},
note = {to appear}
}
@article{Dube90,
author = {T. Dub{\'e}},
title = {The structure of polynomial ideals and
{Gr{\"o}bner} bases},
journal = sicomp,
volume = {19},
year = {1990},
pages = {750--773}
}
@inproceedings{DMRT93,
author = {D. Dubhashi and K. Mehlhorn and D. Ranjan and C. Thiel},
title = {Searching, sorting, and randomised algorithms for
central elements and ideal counting in posets},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {436--443}
}
@inproceedings{DuZw92,
author = {M. Dubiner and U. Zwick},
title = {Amplification and percolation},
booktitle = proc33 # focs,
year = {1990},
pages = {258--267}
}
@inproceedings{DPS15,
author = {J.-G. Dumas and C. Pernet and Z. Sultan},
title = {Computing the rank profile matrix},
booktitle = proc40 # issac,
year = {2015},
pages = {149--156},
note = {Also https://arxiv.org/abs/1501.05239}
}
@article{DPS17,
author = {J.-G. Dumas and C. Pernet and Z. Sultan},
title = {Fast computation of the rank profile matrix and the generalized {B}ruhat decomposition},
journal = {J. Symb. Comp.},
volume = {83},
year = {2017},
pages = {187--210}
}
@inproceedings{DuPe18,
author ={J.-G. Dumas and C. Pernet},
title = {Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix},
booktitle = proc43 # issac,
year = {2018},
pages = {151--158},
note = {Also https://arxiv.org/abs/1802.10453}
}
@book{Dun88,
author = {P. Dunne},
title = {The Complexity of Boolean Networks},
publisher = {Academic Press},
address = {San Diego},
year = {1988}
}
@INPROCEEDINGS{DGPR83,
AUTHOR = {P. D{\=u}ri{\=s} and Z. Galil and W. Paul and R. Reischuk},
TITLE = {Two nonlinear lower bounds},
BOOKTITLE = proc15 # stoc,
YEAR = {1983},
PAGES = {127--132}
}
@article{DGPR84,
author = {P. D{\=u}ri{\=s} and Z. Galil and W. Paul and R. Reischuk},
title = {Two nonlinear lower bounds for on-line computations},
journal = infcon,
volume = {60},
year = {1984},
pages = {1--11}
}
@ARTICLE{DuGa84,
AUTHOR = {P. D{\=u}ris and Z. Galil},
TITLE = {A time--space tradeoff for language recognition},
JOURNAL = mathsys,
VOLUME = {17},
YEAR = {1984},
PAGES = {3--17}
}
@techreport{DSY07,
author = {Z. Dvir and A. Shpilka and A. Yehudayoff},
title = {Hardness-randomness tradeoffs for bounded depth arithmetic
circuits},
institution = eccc,
number = {ECCC TR07-121},
year = {2007}
}
@article{Dyer80,
author = {C. Dyer},
title = {One-way bounded cellular automata},
journal = infcon,
volume = {44},
year = {1980},
pages = {261--281},
}
@article{Dym87,
author = {P. Dymond},
title = {Input-driven languages are in {$\log n$} depth},
journal = ipl,
volume = {26},
year = {1987/88},
pages = {247--250}
}
@article{DyTo85,
author = {P. Dymond and M. Tompa},
title = {Speedups of deterministic machines by synchronous parallel
machines},
journal = jcss,
volume = {30},
year = {1985},
pages = {149--161}
}
@article{DyCo89,
author = {P. Dymond and S. Cook},
title = {Complexity theory of parallel time and hardware},
journal = infcomp,
volume = {80},
year = {1989},
pages = {205--226}
}
@article{Ebe89,
author = {W. Eberly},
title = {Very fast parallel polynomial arithmetic},
journal = sicomp,
volume = {18},
year = {1989},
pages = {955--976}
}
@article{EMS99,
author = {A. Edelman, P. McCorquodale and S. Toledo},
title = {The future fast {F}ourier transform?},
journal = "SIAM J. Sci. Comput.",
volume = {20},
number = 3,
year = {1999},
pages = {1094--1114}
}
@techreport{EdEl81,
author = {C. Edwards and C. Elphick},
title = {Lower bounds for the clique and chromatic numbers of a graph},
institution = {Dept. of Engineering Production, Univ. of Birmingham},
year = {1981}
}
@inproceedings{EWD13,
author = {S. Eggersgl{\"u\ss} and R. Wille and R. Drechsler},
title = {Improved {SAT}-based {ATPG}: More Constraints, Better Compaction},
booktitle = {Proceedings of the 2013 International Conference on Computer-Aided Design, San Jos{\'e}, CA USA},
year = {2013},
pages = {85--90}
}
@techreport{EhKa90,
author = {A. Ehrenfeucht and M. Karpinski},
title = {The Computational Complexity of {(XOR, AND)}-Counting Problems},
number = {TR-90-032},
institution = {Mathematical Sciences Research Institute, University of California at Berkeley},
year = {1990}
}
@book{Eil76,
author = {S. Eilenberg},
title = {Automata, Languages, and Machines, Vols. A-B},
publisher = {Academic Press},
address = {New York},
year = {1976}
}
@ARTICLE{EkJo96,
author = "A. K. Ekert and R. Jozsa",
title = "Quantum computation and Shor's factoring algorithm",
journal = "Review of Modern Physics",
volume = "68(3)",
year = "1996",
pages = "733-753"
}
@MISC{Eke91,
author = "A. K. Ekert",
title = "Correlations in Quantum Optics",
year = "1991",
note = "Thesis submitted for the Degree of Doctor of Philosophy at the University of Oxford, Wolfson College, Oxford University."
}
@MISC{Eke92,
author = "A. K. Ekert",
title = "Quantum cryptography and Bell's theorem",
note = "In Quantum Measurement in Optics (P. Tombesi and D. Walls, eds), Plenum Press, New York, pages 413-418",
year = "1992"
}
@inproceedings{ElGOr84,
author = {A. {El Gamal} and A. Orlitsky},
title = {Interactive data compression},
booktitle = proc25 # focs,
year = {1984},
pages = {100--108}
}
@article{ElRo64,
author = {C. Elgot and A. Robinson},
title = {Random-access stored-program machines},
journal = jacm,
volume = {11},
year = {1964},
pages = {365--399}
}
@book{End72,
author = {H.B. Enderton},
title = {A mathematical introduction to logic},
publisher = {Academic Press},
address = {New York},
year = {1972}
}
@article{EnSk76,
author = {J. Engelfriet and S. Skyum},
title = {Copying theorems},
journal = ipl,
volume = {4},
year = {1976},
pages = {157--161}
}
@article{EnSk82,
author = {J. Engelfriet and S. Skyum},
title = {The copying power of one-state tree transducers},
journal = jcss,
volume = {25},
year = {1982},
pages = {418--435}
}
@article{Eng89,
author = {J. Engelfriet},
title = {The power of two-way deterministic checking stack
automata},
journal = infcomp,
volume = {80},
year = {1989},
pages = {114--120}
}
@article{Epp90,
author = {D. Eppstein},
title = {Reset sequences for monotonic automata},
journal = sicomp,
volume = {19},
year = {1990},
pages = {500--510}
}
@article{ErRa60,
author = {P. Erd{\H{o}}s and R. Rado},
title = {Intersection theorems for systems of sets},
journal = {J. London Math. Soc.},
volume = {35},
year = {1960},
pages = {85--90}
}
@inproceedings{Ete95,
author = {K. Etessami},
title = {Counting quantifiers, successor relations, and
logarithmic space},
booktitle = proc10 # structures,
year = {1995},
pages = {2--11}
}
@inproceedings{EvSc93,
author = {W. Evans and L. Schulman},
title = {Signal propagation, with application to a lower bound
on the depth of noisy formulas},
booktitle = proc34 # focs,
year = {1993},
pages = {594--603}
}
@article{ELY82,
author = {S. Even and T. Long and Y. Yacobi},
title = {A note on deterministic and nondeterministic time complexity},
journal = infcon,
volume = {55},
year = {1982},
pages = {117--124}
}
@article{ESY84,
author = {S. Even and A. Selman and Y. Yacobi},
title = {The complexity of promise problems, with applications
to public-key cryptography},
journal = infcon,
volume = {61},
year = {1984},
pages = {159--173}
}
@article{EvLi94,
author = {S. Even and A. Litman},
title = {On the capabilities of systolic systems},
journal = mathsys,
volume = {27},
year = {1994},
pages = {3--28}
}
@article{FSRS91,
author = {E. Fachini and A. Maggiolo Schettini and G. Resta and
D. Sangiorgio},
title = {Nonacceptability criteria and closure properties for
the class of languages accepted by binary systolic tree automata},
journal = tcs,
volume = {83},
year = {1991},
pages = {249--260}
}
@incollection{Fag74,
author = {R. Fagin},
title = {Generalized first-order spectra and polynomial-time
recognizable sets},
booktitle = {Complexity of Computation: Proceedings of a
Symposium in Applied Mathematics of the American Mathematical Society
and the Society for Industrial and Applied Mathematics, Vol.\ VII},
editor = {R. Karp},
publisher = {SIAM-AMS},
year = {1974},
pages = {43--73}
}
@article{Fag75,
author = {R. Fagin},
title = {Monadic generalized spectra},
journal = zml,
volume = {21},
year = {1975},
pages = {89--96}
}
@techreport{FKPS83,
author = {R. Fagin and M. Klawe and N. Pippenger and L. Stockmeyer},
title = {Bounded depth, polynomial size circuits for symmetric
functions},
institution = {IBM Research Division},
number = {RJ 4040 (45198)},
address = {San Jos\'e, California},
year = {1983}
}
@article{Fag93,
author = {R. Fagin},
title = {Finite model theory---a personal perspective},
journal = tcs,
volume = {116},
year = {1993},
pages = {3--31}
}
@inproceedings{FSV93,
author = {R. Fagin and L. Stockmeyer and M. Vardi},
title = {On monadic {NP} vs. monadic co-{NP}},
booktitle = proc8 # structures,
year = {1993},
pages = {19--30}
}
@InProceedings{FaOg05,
title = "Separating the Notions of Self- and Autoreducibility",
author = "Piotr Faliszewski and Mitsunori Ogihara",
bibdate = "2005-09-23",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/mfcs/mfcs2005.html#FaliszewskiO05",
booktitle = "Mathematical Foundations of Computer Science 2005,
30th International Symposium, {MFCS} 2005, Gdansk,
Poland, August 29 - September 2, 2005, Proceedings",
publisher = "Springer",
year = "2005",
volume = "3618",
editor = "Joanna Jedrzejowicz and Andrzej Szepietowski",
ISBN = "3-540-28702-7",
pages = "308--315",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11549345_27",
}
@TechReport{FaOg07,
author = "P. Faliszewski and M. Ogihara",
title = "On the Autoreducibility of Functions",
institution = "University of Rochester, Computer Science Department",
number = "TR912",
month = jan,
year = "2007",
keywords = "autoreducibility; length-decreasing self-reducibility;
reductions; function classes; complete functions",
URL = "ftp://ftp.cs.rochester.edu/pub/papers/theory/07.tr912.On_the_autoreducibility_of_functions.pdf",
note = "Tue, 23 Jan 07 16:02:48 GMT",
}
@article{FFGHZ06,
author = {M. Fang and S. Fenner and F. Green and S. Homer and Y. Zhang},
title = {Quantum lower bounds for fanout},
journal = {Quantum Information and Computation},
volume = {6},
year = {2006},
pages = {46--57}
}
@misc{Farr85,
author = {G. Farr},
title = {On problems with short certificates},
year = {1985}
}
@article{Farr93c,
author = {G. Farr},
title = {A correlation inequality involving stable set and
chromatic polynomials},
journal = {Journal of Combinatorial Theory, Ser. B},
volume = {58},
year = {1993},
pages = {14--21}
}
@article{Farr93g,
author = {G. Farr},
title = {A generalization of the {W}hitney rank generating function},
journal = {Math. Proc. Camb. Phil. Soc.},
volume = {113},
year = {1993},
pages = {267--280}
}
@article{Fed89,
author = {T. Feder},
title = {reliable computation by networks in the presence of noise},
journal = itit,
volume = {35},
year = {1989},
pages = {569--571}
}
@article{FMG91,
author = {M. Feder and N. Merhav and M. Gutman},
title = {Universal prediction of individual sequences},
journal = itit,
volume = {38},
year = {1991},
pages = {1258--1270}
}
@article{Fef60,
author = {S. Feferman},
title = {Arithmetization of metamathematics in a general setting},
journal = {Fundamenta Mathematicae},
volume = {49},
year = {1960},
pages = {35--92}
}
@misc{FeUm10,
author = {B. Fefferman and C. Umans},
title = {Pseudorandom generators and the {BQP} vs. {PH} problem},
year = {2010},
month = {November},
howpublished = {http://arxiv.org/abs/1007.0305},
note = {To appear in the proceedings of QIP 2011}
}
@inproceedings{FGLSS91,
author = {U. Feige and S. Goldwasser and L. Lov{\'a}sz and S, Safra
and M. Szegedy},
title = {Approximating clique is almost {NP}-complete},
booktitle = proc32 # focs,
year = {1991},
pages = {2--12}
}
@article{FGLSS96,
author = {U. Feige and S. Goldwasser and L. Lov{\'a}sz and S, Safra
and M. Szegedy},
title = {Interactive proofs and the hardness of approximating
cliques},
journal = {Journal of the ACM},
volume = {43},
year = {1996},
pages = {268--292}
}
@article{Fei92,
author = {U. Feige},
title = {On the complexity of finite random functions},
journal = ipl,
volume = {44},
year = {1992},
pages = {295--296}
}
@article{FeFo93,
author = {J. Feigenbaum and L. Fortnow},
title = {Random-self-reducibility of complete sets},
journal = sicomp,
volume = {22},
year = {1993},
pages = {994--1005}
}
@book{Fei88,
author = {D. Feitelson},
title = {Optical Computing},
publisher = {MIT Press},
year = {1988}
}
@article{FeSh92,
author = {Y. Feldman and E. Shapiro},
title = {Spatial machines: A more-realistic approach to
parallel computation},
journal = cacm,
volume = {35},
year = {1992},
month = {October},
pages = {60--73}
}
@inproceedings{FeKo92,
author = {M. Fellows and N. Koblitz},
title = {Self-witnessing polynomial-time complexity and prime
factorization},
booktitle = proc7 # structures,
year = {1992},
pages = {107--109}
}
@article{FeLa88,
author = {M. Fellows and M. Langston},
title = {Nonconstructive tools for proving polynomial-time
decidability},
journal = jacm,
volume = {35},
year = {1988},
pages = {727--739}
}
@inproceedings{FeLa89,
author = {M. Fellows and M. Langston},
title = {On search, decision, and the efficiency of polynomial-time
algorithms},
booktitle = proc21 # stoc,
year = {1989},
pages = {501--512},
note = {Final version to appear in {\it J. Comput. Sys. Sci.}}
}
@inproceedings{FeLa89b,
author = {M. Fellows and M. Langston},
title = {An analogue of the {Myhill-Nerode} theorem and its use in
computing finite basis characterizations},
booktitle = proc30 # focs,
year = {1989},
pages = {520--525}
}
@inproceedings{FeLa92,
author = {M. Fellows and M. Langston},
title = {On well-partial-order theory and its application to
combinatorial problems of {VLSI} design},
journal = {SIAM Journal on Discrete Mathematics},
volume = {5},
year = {1992},
pages = {117--126}
}
@article{FeRa93,
author = {G.-L. Feng and T.R.N. Rao},
title = {Decoding algebraic=geometric codes up to the
designed minimum distance},
journal = itit,
volume = {39},
number = {1},
year = {1993},
month = {January},
pages = {37--45}
}
@inproceedings{FKR89,
author = {S. Fenner and S. Kurtz and J. Royer},
title = {Every polynomial-time 1-degree collapses iff
{P = PSPACE}},
booktitle = proc30 # focs,
year = {1989},
pages = {624--689}
}
@inproceedings{FFK91,
author = {S. Fenner and L. Fortnow and S. Kurtz},
title = {Gap-definable counting classes},
booktitle = proc6 # structures,
year = {1991},
pages = {30--42}
}
@inproceedings{FFK92,
author = {S. Fenner and L. Fortnow and S. Kurtz},
title = {The {I}somorphism {C}onjecture holds relative to
an oracle},
booktitle = proc33 # focs,
year = {1992},
pages = {30--39},
}
@inproceedings{FFL93,
author = {S. Fenner and L. Fortnow and L. Li},
title = {Gap-definability as a closure property},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {484--493}
}
@inproceedings{FHOS93,
author = {S. Fenner and S. Homer and M. Ogiwara and A. Selman},
title = {On using oracles that compute values},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {398--407}
}
@techreport{Fen94,
author = {S. Fenner},
title = {On inverting the {T}uring jump in complexity theory},
institution = {Department of Computer Science, University of
Southern Maine},
number = {94-3-11},
month = {March},
year = {1994}
}
@article{FFK94,
author = {S. Fenner and L. Fortnow and S. Kurtz},
title = {Gap-definable counting classes},
journal = jcss,
volume = {48},
year = {1994},
pages = {116--148}
}
@article{FFK96,
author = {S. Fenner and L. Fortnow and S. Kurtz},
title = {The {I}somorphism {C}onjecture holds relative to
an oracle},
journal = sicomp,
volume = {25},
year = {1996},
pages = {193--206}
}
@article{FFL96,
author = {S. Fenner and L. Fortnow and L. Li},
title = {Gap-definability as a closure property},
journal = infcomp,
volume = {130},
year = {1996},
pages = {1--17}
}
@article{FHOS97,
author = {S. Fenner and S. Homer and M. Ogiwara and A. Selman},
title = {On using oracles that compute values},
journal = sicomp,
volume = {26},
year = {1997},
note = {in press}
}
@article{FFKL03,
author = {S. Fenner and L. Fortnow and S. Kurtz and L. Li},
title = {An oracle-builder's toolkit},
journal = infcomp,
volume = {182},
year = {2003},
pages = {95--136}
}
@inproceedings{FGHZ05,
author = {S. Fenner and F. Green and S. Homer and Y. Zhang},
title = {Bounds on the power of constant-depth quantum circuits},
booktitle = "Proceedings of FCT 2005",
publisher = springer,
series = lncs,
volume = {3623},
year = {2005},
pages = {44--55}
}
@misc{FeGr11,
author = {S. Fenner and F. Green},
title = {Personal communications},
year = {2011},
month = {September}
}
@inproceedings{Ferreira99,
author = {P. J. S. G. Ferreira},
title={Superresolution, the recovery of missing samples, and
{V}andermonde matrices on the unit circle},
booktitle = {Proc. Workshop on Sampling Theory and App.},
year = {1999},
pages = {216--220}
}
@article{Fey82,
author = {R. Feynmann},
title = {Simulating physics with computers},
journal = {International Journal of Theoretical Physics},
volume = {21},
year = {1982},
pages = {467--488}
}
@article{Fey86,
author = {R. Feynmann},
title = {Quantum mechanical computers},
journal = {Foundation of Physics},
volume = {16},
year = {1986},
pages = {507--531}
}
@inproceedings{Fich83,
author = {F. Fich},
title = {New bounds for parallel prefix circuits},
booktitle = proc15 # stoc,
year = {1983},
pages = {100--109}
}
@inproceedings{FIKKK93,
author = {F. Fich and R. Impagliazzo and B. Kapron and V. King and M. Kutylowski},
title = {Limits on the power of parallel random access machines
with weak froms of write conflict resolution},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {386--397}
}
@incollection{Fich93,
author = {F. Fich},
title = {The complexity of computation on the parallel random access
machine},
booktitle = {Synthesis of Parallel Algorithms},
editor = {J. Reif},
publisher = {Morgan Kaufman},
year = {1993}
}
@article{Fis65,
author = {P. Fischer},
title = {Theory of provably recursive functions},
journal = trans-ams,
volume = {117},
year = {1965},
pages = {494--520}
}
@INPROCEEDINGS{FiRo68,
AUTHOR = {M. Fischer and A. Rosenberg},
TITLE = {Limited random access {Turing} machines},
BOOKTITLE = proc9 # "Annual IEEE Symposium on Switching and Automata Theory (now FOCS)",
YEAR = {1968},
PAGES = {356--367}
}
@article{FMR70,
AUTHOR = {P. Fischer and A. Meyer and A. Rosenberg},
TITLE = {Time-restricted sequence generation},
journal = jcss,
volume = {4},
year = {1970},
pages = {50--73}
}
@ARTICLE{FMR72,
AUTHOR = {P. Fischer and A. Meyer and A. Rosenberg},
TITLE = {Real-time simulations of multihead tape units},
JOURNAL = jacm,
VOLUME = {19},
YEAR = {1972},
PAGES = {590--607}
}
@incollection{FiPa74,
author = {M. Fischer and M. Paterson},
title = {String matching and other products},
booktitle = {Complexity of Computation},
editor = {R. Karp},
series = {SIAM-AMS Proceedings},
publisher = {Amer. Math. Soc.},
volume = {7},
year = {1974},
pages = {113--125}
}
@techreport{Fis80,
author = {M. Fischer},
title = {On developing a theory of distributed
computing:\ summary of current research},
institution = {Dept.\ of Computer Science, Univ.\ of
Washington, Seattle, WA},
number = {80-09-03},
year = {1980}
}
@article{Fis88,
author = {D. Fisher},
title = {Your favorite parallel algorithms might not be as fast
as you think},
journal = {IEEE Transactions on Computers},
volume = {37},
number = {2},
year = {1988},
pages = {211--213}
}
@article{FlKn90,
author = {R. Floyd and D. Knuth},
title = {Addition machines},
journal = sicomp,
volume = {19},
year = {1990},
pages = {329--340}
}
@book{For66,
author = {G. Forney},
title = {Concatenated Codes},
publisher = {MIT Press},
year = {1966}
}
@inproceedings{For87,
author = {L. Fortnow},
title = {The complexity of perfect zero-knowledge},
booktitle = proc19 # stoc,
year = {1987},
pages = {204--209}
}
@article{FoSi88,
author = {L. Fortnow and M. Sipser},
title = {Are there interactive protocols for {co-NP} languages?},
journal = ipl,
volume = {28},
year = {1988},
pages = {249--251}
}
@article{FRS88,
author = {L. Fortnow and J. Rompel and M. Sipser},
title = {On the power of multi-prover interactive protocols},
booktitle = proc3 # structures,
year = {1988},
pages = {156--161}
}
@inproceedings{FoSi89,
author = {L. Fortnow and M. Sipser},
title = {Probabilistic computation and linear time},
booktitle = proc21 # stoc,
year = {1989},
pages = {148--156}
}
@inproceedings{FoLu91,
author = {L. Fortnow and C. Lund},
title = {Interactive proof systems and alternating time-space
complexity},
booktitle = proc8 # stacs,
series = lncs,
volume = {480},
publisher = springer,
year = {1991},
pages = {263--274}
}
@inproceedings{FoRe91,
author = {L. Fortnow and N. Reingold},
title = {{PP} is closed under truth-table reductions},
booktitle = proc6 # structures,
year = {1991},
pages = {13--15}
}
@article{FoSz92,
author = {L. Fortnow and M. Szegedy},
title = {On the power of two-local random reductions},
journal = ipl,
volume = {44},
year = {1992},
pages = {303--306}
}
@techreport{FoRo93,
author = {L. Fortnow and J. Rogers},
title = {Separability and one-way functions},
institution = {University of Chicago},
number = {CS93-14},
month = {August},
year = {1993}
}
@article{For94,
author = {L. Fortnow},
title = {The role of relativization in complexity theory},
journal = beatcs,
volume = {52},
year = {1994},
pages = {229--244}
}
@inproceedings{FoWh94,
author = {L. Fortnow and D. Whang},
title = {Optimality and domination in repeated games with
bounded players},
booktitle = proc26 # stoc,
year = {1994},
pages = {741--749}
}
@inproceedings{For97,
author = {L. Fortnow},
title = {Nondeterministic polynomial time versus nondeterministic
logarithmic space: Time-space tradeoffs for satisfiability},
booktitle = {Proceedings, 12th IEEE Conference on Computational
Complexity (formerly Structure in Complexity Theory), Ulm, Germany,
June},
publisher = {IEEE},
address = {New York},
year = {1997},
pages = {52--60}
}
@inproceedings{FoSi97,
author = {L. Fortnow and M. Sipser},
title = {Retraction of ``{P}robabilistic computation and
linear time''},
booktitle = proc29 # stoc,
year = {1997},
pages = {750}
}
@inproceedings{FoRo98,
author = {L. Fortnow and J. Rogers},
title = {Complexity limitations on quantum computation},
booktitle = proc13 # ccc,
year = {1998},
pages = {202--206}
}
@article{FoRo99,
author = {L. Fortnow and J. Rogers},
title = {Complexity limitations on quantum computation},
journal = jcss,
volume = {59},
year = {1999},
pages = {140--152}
}
@article{For03,
author = {L. Fortnow},
title = {One complexity theorist's view of quantum computing},
journal = tcs,
volume = {292},
year = {2003},
pages = {597--610}
}
@article{For09,
author = {L. Fortnow},
title = {The status of the {P} versus {NP} problem},
journal = cacm,
volume = {52},
year = {2009},
pages = {78--86}
}
@article{FLO83,
author = {S. Fortune and M. O{'Donnell} and D. Leivant},
title = {The expressiveness of simple and second-order
type structures},
journal = jacm,
volume = {30},
year = {1983},
pages = {151--185}
}
@article{Fra84,
author = {J. Franco},
title = {Sensitivity of probabilistic results on algorithms for
{NP}-complete problems to input distributions},
journal = sigact,
volume = {17},
number = {1},
year = {1984},
pages = {40--59}
}
@article{FVB94,
author = {G. Frandsen and M. Valence and D. Mix Barrington},
title = {Some results on uniform arithmetic circuit complexity},
journal = mst,
volume = {27},
year = {1994},
pages = {105--124}
}
@inproceedings{Fre92,
author = {E. Fredkin},
title = {A new cosmogony},
booktitle = {Physics and Computation, 1992 Workshop},
year = {1992},
pages = {116--121},
url = {http://www.digitalphilosophy.org/new_cosmogony.htm}
}
@inproceedings{Fre92b,
author = {E. Fredkin},
title = {Finite nature},
booktitle = {Proceedings of the XXVIIth Rencontre de Moriond},
year = {1992},
url = {http://www.digitalphilosophy.org/finite_nature.htm}
}
@article{Fre04,
author = {E. Fredkin},
title = {Five big questions with pretty simple answers},
journal = {IBM Journal of Research and Development},
volume = {48},
year = {2004},
pages = {31--45},
url = {http://www.research.ibm.com/journal/rd/481/fredkin.html}
}
@InProceedings{Fre05,
title = "A computing architecture for physics",
author = "Edward Fredkin",
bibdate = "2006-02-15",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/cf/cf2005.html#Fredkin05",
booktitle = "Conf. Computing Frontiers",
booktitle = "Proceedings of the Second Conference on Computing
Frontiers, 2005, Ischia, Italy, May 4-6, 2005",
publisher = "ACM",
year = "2005",
editor = "Nader Bagherzadeh and Mateo Valero and Alex
Ram{\'i}rez",
ISBN = "1-59593-018-3",
pages = "273--279",
URL = "http://doi.acm.org/10.1145/1062261.1062307",
}
@inproceedings{FrWi90,
author = {M. Fredman and D. Willard},
title = {{BLASTING} through the information theoretic barrier with
FUSION TREES},
booktitle = proc22 # stoc,
year = {1990},
pages = {1--7}
}
@article{FrWi93,
author = {M. Fredman and D. Willard},
title = {Surpassing the information theoretic bound with
fusion trees},
journal = jcss,
volume = {47},
year = {1993},
pages = {nnn--nnn}
}
@incollection{Fre12,
author = {R. Freivalds},
title = {Hartmanis-{S}tearns Conjecture on Real Time and Transcendence},
booktitle = {Computation, Physics and Beyond},
series = lncs,
publisher = springer,
volume = {7160},
year = {2012},
pages = {105--119}
}
@INPROCEEDINGS{FS95,
AUTHOR = "K. Friedl and M. Sudan",
TITLE = "Some improvements to total degree tests",
BOOKTITLE = "Proceedings of the 3rd Annual Israel symposium on Theory of Computing and Systems",
YEAR = "1995",
pages = "190-198",
note = "Corrected version available at http://theory.lcs.mit.edu/$\sim$madhu/papers/friedl.ps",
file = F
}
@article{Fri75,
author = {H. Friedman},
title = {The disjunction property implies the numeric
existence property},
journal = {Proc. Nat. Acad. Sci.},
volume = {72},
year = {1975},
pages = {1277--1278}
}
@incollection{Fri78,
author = {H. Friedman},
title = {Classically and intuitionistically provably recursive
functions},
booktitle = {Higher Set Theory},
editor = {G. Muller and D. Scott},
series = lnm,
volume = {669},
publisher = springer,
year = {1978},
pages = {21--28}
}
@inproceedings{FKS89,
author = {J. Friedman and J. Kahn and E. Szemer{\'e}di},
title = {On the second eigenvalue in random regular graphs},
booktitle = proc21 # stoc,
year = {1989},
pages = {587--598}
}
@article{Fro91,
author = {C. Frougny},
title = {Fibonacci representations and finite automata},
journal = itit,
volume = {37},
number = {2},
month = {March},
year = {1991},
pages = {393--399}
}
@inproceedings{FrSa91,
author = {C. Frougny and J. Sakarovitch},
title = {Rational relations with bounded delay},
booktitle = proc8 # stacs,
series = lncs,
volume = {480},
publisher = springer,
year = {1991},
pages = {50--63}
}
@article{Fro92,
author = {C. Frougny},
title = {Confluent linear numeration systems},
journal = tcs,
volume = {106},
year = {1992},
pages = {183--219}
}
@INPROCEEDINGS{Fur82,
AUTHOR = {M. F{\"u}rer},
TITLE = {The tight deterministic time hierarchy},
BOOKTITLE = proc14 # stoc,
YEAR = {1982},
PAGES = {8--16}
}
@article{Fur84,
author = {M. F{\"u}rer},
title = {Data structures for distributed counting},
journal = jcss,
volume = {29},
year = {1984},
pages = {231--243}
}
@article{Fur09,
author = {M. F{\"u}rer},
title = {Faster integer multiplication},
journal = sicomp,
volume = {39},
year = {2009},
pages = {979--1005}
}
@inproceedings{FHL80,
author = {M. Furst and J. Hopcroft and E. Luks},
title = {Polynomial-time algorithms for permutation groups},
booktitle = proc21 # focs,
year = {1980},
pages = {36--41}
}
@inproceedings{FSS81,
author = {M. Furst and J. Saxe and M. Sipser},
title = {Parity, circuits, and the polynomial-time hierarchy},
booktitle = proc22 # focs,
year = {1981},
pages = {260--270}
}
@article{FSS84,
author = {M. Furst and J. Saxe and M. Sipser},
title = {Parity, circuits, and the polynomial-time hierarchy},
journal = mathsys,
volume = {17},
year = {1984},
pages = {13--27}
}
@inproceedings{GaDi82,
author = {H. Gaifman and M. Dimitricopoulos},
title = {Fragments of {P}eano's {A}rithmetic and the {MRDP} theorem},
booktitle = {Logic and Algorithmic: An International Symposium
Held in Honour of Ernst Specker, L'Enseignement Mathematique, University
of Geneva},
year = {1982}
}
@ARTICLE{Gal76,
AUTHOR = {Z. Galil},
TITLE = {Two fast simulations which imply some fast string matching and
palindrome-recognition algorithms},
JOURNAL = ipl,
VOLUME = {4},
NUMBER = {4},
YEAR = {1976},
PAGES = {85--87}
}
@inproceedings{Gal91,
author = {A. G{\'a}l},
title = {Lower bounds for the complexity of reliable {B}oolean circuits
with noisy gates},
booktitle = proc32 # focs,
year = {1991},
pages = {594--601}
}
@article{Gal76b,
author = {Z. Galil},
title = {Hierarchies of complete problems},
journal = {Acta Informatica},
volume = {6},
year = {1976},
pages = {77--88}
}
@ARTICLE{Gal77,
AUTHOR = {Z. Galil},
TITLE = {Some open problems in the theory of computation as questions
about two--way deterministic pushdown automaton languages},
JOURNAL = mathsys,
VOLUME = {10},
YEAR = {1977},
PAGES = {211--228}
}
@ARTICLE{GaSe78,
AUTHOR = {Z. Galil and J. Seiferas},
TITLE = {A linear-time on--line algorithm for `Palstar'},
JOURNAL = jacm,
VOLUME = {25},
YEAR = {1978},
PAGES = {102--110}
}
@ARTICLE{GaSe83,
AUTHOR = {Z. Galil and J. Seiferas},
TITLE = {Time-space optimal string matching},
JOURNAL = jcss,
VOLUME = {26},
YEAR = {1983},
PAGES = {280--294}
}
@article{GaIt91,
author = {Z. Galil and G. Italiano},
title = {Data structures and algorithms for disjoint set
union problems},
journal = {ACM Computing Surveys},
volume = {nnn},
year = {1991},
pages = {319--344}
}
@article{GaHa69,
author = {H. Gallaire and M. Harrison},
title = {Decompositions of linear sequential machines},
journal = mst,
volume = {3},
year = {1969},
pages = {246--287}
}
@article{GaWi83,
author = {H. Galperin and A. Wigderson},
title = {Succinct representations of graphs},
journal = infcon,
volume = {56},
year = {1983},
pages = {183--198}
}
@inproceedings{Gan92,
author = {K. Ganesan},
title = {One-way functions and the isomorphism conjecture},
booktitle = proc12 # fsttcs,
year = {1992},
pages = {nnn--nnn}
}
@inproceedings{GaMa13,
author = {H. García and I.L. Markov},
title = {Quipu: High-performance simulation of quantum circuits using stabilizer frames},
booktitle = {Proceedings of ICCD 2013},
year = {2013},
pages = {404--410}
}
@article{GMC14,
author = {H. García and I.L. Markov and A.W. Cross},
title = {On the geometry of stabilizer states},
journal = {Quantum Information and Computation},
volume = {14},
year = {2014},
pages = {683--720}
}
@article{GaMa15,
author = {H. García and I.L. Markov},
title = {Simulation of Quantum Circuits via Stabilizer Frames},
journal = {IEEE Trans. Computers},
volume = {64},
year = {2015},
pages = {2323--2336},
note = {Updated 12/2017 at https://arxiv.org/abs/1712.03554}
}
@book{GJ79,
author = {M. Garey and D.S. Johnson},
title = {Computers and Intractability: A Guide to the Theory
of NP-Completeness},
publisher = {Freeman},
year = {1979}
}
@book{GJ88,
author = {M. Garey and D.S. Johnson},
title = {Computers and Intractability: A Guide to the Theory
of NP-Completeness},
publisher = {Freeman},
year = {1988},
note = {First edition was 1979}
}
@article{GaZa91,
author = {M. Garzon and Y. Zalcstein},
title = {On isomorphism testing of a class of 2-nilpotent groups},
journal = jcss,
volume = {42},
year = {1991},
pages = {237--248}
}
@article{vzG87,
author = {J. von zur Gathen},
title = {Feasible arithmetic computations: Valiant's hypothesis},
journal = {Journal of Symbolic Computation},
volume = {4},
year = {1987},
pages = {137--172}
}
@article{vzGGi90,
author = {J. von zur Gathen and M. Giesbrecht},
title = {Constructing normal bases in finite fields},
journal = {J. Symb. Comput.},
volume = {10},
year = {1990},
pages = {547--570}
}
@inproceedings{vzG91,
author = {J. von zur Gathen},
title = {Efficient exponentiation in finite fields},
booktitle = proc32 # focs,
year = {1991},
pages = {384--391}
}
@article{vzGSe91,
author = {J. von zur Gathen and G. Seroussi},
title = {Boolean circuits versus arithmetic circuits},
journal = infcomp,
volume = {91},
year = {1991},
pages = {142--154}
}
@article{Gautschi75,
author = {W. Gautschi},
title = {Norm estimates for inverses of {V}andermonde matrices},
journal = {Numer. Math.},
volume = {23},
year = {1975},
pages = {337--347}
}
@incollection{GMT90,
author = {H. Gazit and G. Miller and S. Teng},
title = {Optimal tree contraction in the {EREW} model},
booktitle = {Concurrent Computations},
editor = {S. Tewksbury and B. Dickinson and S. Schwartz},
publisher = {Plenum},
year = {1990},
pages = {139--156}
}
@INPROCEEDINGS{GLRSW91,
AUTHOR = "P. Gemmell and R. Lipton and R. Rubinfeld and M. Sudan and A. Wigderson",
TITLE = "Self-testing/correcting for polynomials and for approxiamte functions",
BOOKTITLE = proc21 # stoc,
YEAR = "1991",
pages = {32--42}
}
@inproceedings{GeNa93,
author = {P. Gemmell and M. Naor},
title = {Codes for interactive authentication},
booktitle = {Proceedings, EUROCRYPT '93},
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{Gen93,
author = {R. Gengler},
title = {Multicounter automata with sublogarithmic reversal bounds},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {408--417}
}
@article{GeSe06,
author = {V. Gerdt and V. Severyanov},
title = {A software package to construct polynomial sets
over {$Z_2$} for determining the output of quantum computations},
journal = {Nuclear Instruments and Methods in Physics Research A},
volume = {59},
year = {2006},
pages = {260--264}
}
@article{GeKr92,
author = {M. Ger{\'e}b-Graus and D. Krizanc},
title = {The average complexity of parallel comparison merging},
journal = sicomp,
volume = {21},
year = {1992},
pages = {43--47}
}
@techreport{GeMe92,
author = {J. Gergov and C. Meinel},
title = {Efficient analysis and manipulation of {OBDDs} can be extended
to read-once-only branching programs},
institution = {Universit\"at Trier, Mathematik/Informatik},
number = {Forschungsbericht 92--10},
year = {1992}
}
@inproceedings{GeMe93,
author = {J. Gergov and C, Meinel},
title = {Frontiers of feasible and probabilistic feasible {Boolean}
manipulation with branching programs},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {576--585}
}
@inproceedings{GGIMS02,
author = {A. Gilbert and S. Guha and P. Indyk and S. Muthukrishnan and M. Strauss},
title = {Near-optimal sparse {F}ourier representations via sampling},
booktitle = proc34 # stoc,
year = {2002},
pages = {152-161},
ee = {http://doi.acm.org/10.1145/509907.509933},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{GHT84,
author = {J. Gilbert and J. Hutchinson and R. Tarjan},
title = {A separation theorem for graphs of bounded genus},
journal = jalg,
volume = {5},
year = {1984},
pages = {391--407}
}
@article{Gill77,
author = {J. Gill},
title = {Computational complexity of probabilistic {T}uring machines},
journal = sicomp,
volume = {6},
year = {1977},
pages = {675--695}
}
@article{Gis81,
author = {J. Gischer},
title = {Shuffle languages, {P}etri nets, and context-sensitive
grammars},
journal = cacm,
volume = {24},
year = {1981},
month = {September},
pages = {597--605}
}
@inproceedings{Giu84,
author = {M. Giusti},
title = {Some effectivity problems in polynomial ideal theory},
booktitle = {Proceedings of {EUROSAM}'84},
editor = {J. Fitch},
series = lncs,
volume = {174},
publisher = springer,
year = {1984},
pages = {159--171}
}
@article{GHS93,
author = {M. Giusti and J. Heintz and J. Sabia},
title = {On the complexity of effective {Nullstellens{\"a}tze}},
journal = {Computational Complexity},
volume = {3},
year = {1993},
pages = {56--95}
}
@InProceedings{GOPSZ05,
title = "Autoreducibility, Mitoticity, and Immunity",
author = "Christian Gla{\ss}er and Mitsunori Ogihara and Aduri
Pavan and Alan L. Selman and Liyu Zhang",
bibdate = "2005-09-23",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/mfcs/mfcs2005.html#GlasserOPSZ05",
booktitle = "Mathematical Foundations of Computer Science 2005,
30th International Symposium, {MFCS} 2005, Gdansk,
Poland, August 29 - September 2, 2005, Proceedings",
publisher = "Springer",
year = "2005",
volume = "3618",
editor = "Joanna Jedrzejowicz and Andrzej Szepietowski",
ISBN = "3-540-28702-7",
pages = "387--398",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11549345_34",
}
@InProceedings{GPSZ06,
title = "Redundancy in Complete Sets",
author = "Christian Gla{\ss}er and Aduri Pavan and Alan L.
Selman and Liyu Zhang",
bibdate = "2006-03-03",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/stacs/stacs2006.html#GlasserPSZ06",
booktitle = "{STACS} 2006, 23rd Annual Symposium on Theoretical
Aspects of Computer Science, Marseille, France,
February 23-25, 2006, Proceedings",
publisher = "Springer",
year = "2006",
volume = "3884",
editor = "Bruno Durand and Wolfgang Thomas",
ISBN = "3-540-32301-5",
pages = "444--454",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11672142_36",
}
@article{GoWi94,
author = {M. Goemans and D. Williamson},
title = {New {$3/4$}-approximation algorithms for the maximum satisfiability problem},
journal = {SIAM J. Disc. Math},
volume = {7},
year = {1994},
pages = {656--666}
}
@article{GoSi91,
author = {A. Goldberg and M. Sipser},
title = {Compression and ranking},
journal = sicomp,
volume = {20},
year = {1991},
pages = {}
}
@techreport{GoJe92,
author = {L. Goldberg and M. Jerrum},
title = {A sub-logarithmic communication algorithm for the
completely connected optical communication parallel computer},
institution = {Laboratory for Foundations of Computer Science},
address = {Department of Computer Science, The University of
Edinburgh},
number = {ECS-LFCS-92-234},
month = {September},
year = {1992}
}
@article{GHR92,
author = {M. Goldmann and J. H{\aa}stad and A. Razborov},
title = {Majority gates vs.\ general weighted threshold gates},
journal = compcomp,
volume = {2},
year = {1992},
pages = {277--300}
}
@article{Got66,
author = {D.H. Gottlieb},
title = {A certain class of incidence matrices},
journal = ams,
volume = {17},
year = {1966},
pages = {1233--1237}
}
@book{GHR95,
author = {R.~Greenlaw and J.~Hoover and W.L.~Ruzzo},
title = {Limits to Parallel Computation: P-Completeness Theory},
publisher = {Oxford University Press},
year = {1995},
note = {Excerpts available at
{\tt\verb+http://web.cs.ualberta.ca:80/~hoover/P-complete/+}}
}
@misc{Gre07Q,
author = {David Greve},
title = {QDD: A quantum computer emulation library},
year = {1999--2007},
howpublished = {http://thegreves.com/david/QDD/qdd.html}
}
@inproceedings{GoKa93,
author = {M. Goldmann and M. Karpinski},
title = {...},
booktitle = proc25 # stoc,
year = {1993},
pages = {nnn--nnn}
}
@article{GGH94,
author = {M. Goldmann and P. Grape and J. H{\aa}stad},
title = {On average time hierarchies},
journal = ipl,
volume = {49},
year = {1994},
pages = {15--20}
}
@article{GGM86,
author = {O. Goldreich and S. Goldwasser and S. Micali},
title = {How to construct random functions},
journal = jacm,
volume = {33},
year = {1986},
pages = {792--807}
}
@inproceedings{GMS87,
author = {O. Goldreich and Y. Mansour and M. Sipser},
title = {Interactive proof systems: provers that never
fail and random selection},
booktitle = proc28 # focs,
year = {1987},
pages = {449--461}
}
@inproceedings{GoLe89,
author = {O. Goldreich and L. Levin},
title = {A hard-core predicate for all one-way functions},
booktitle = proc21 # stoc,
year = {1989},
pages = {25--32}
}
@article{GMW91,
author = {O. Goldreich and S. Micali and A. Wigderson},
title = {Proofs that yield nothing but their validity, or
{All} languages in {NP} have zero-knowledge proof systems},
journal = jacm,
volume = {38},
year = {1991},
pages = {691--729}
}
@article{GKL93,
author = {O. Goldreich and H. Krawczyk and M. Luby},
title = {On the existence of pseudorandom generators},
journal = sicomp,
volume = {22},
year = {1993},
pages = {1163--1175}
}
@inproceedings{GOP94,
author = {O. Goldreich and R. Ostrovsky and E. Petrank},
title = {Computational complexity and knowledge complexity},
booktitle = proc26 # stoc,
year = {1994},
pages = {534--543}
}
@inproceedings{GoWi94h,
author = {O. Goldreich and A. Wigderson},
title = {Tiny families of functions with random properties: a
quality-size tradeoff for hashing},
booktitle = proc26 # stoc,
year = {1994},
pages = {574--583}
}
@techreport{GoZu97,
author = {O. Goldreich and D. Zuckerman},
title = {Another proof that {BPP {$\subseteq$} PH} (and more)},
institution = {Electronic Colloquium on Computational
Complexity (ECCC)},
number = {TR97--045},
month = {September},
year = {1997}
}
@article{GoTr03,
author = {O. Goldreich and L. Trevisan},
title = {Three theorems regarding testing graph properties},
journal = {Random Structures and Algorithms},
volume = {23},
year = {2003},
pages = {23--57}
}
@incollection{Gol11,
author = {Goldreich, Oded},
title = {Bravely, Moderately: A Common Theme in Four Recent Works},
booktitle = {Studies in Complexity and Cryptography},
editor = {Goldreich, Oded},
publisher = springer,
year = {2011},
pages = {373--389},
note = {Also http://www.wisdom.weizmann.ac.il/{$\sim$}oded/COL/brave.pdf}
}
@techreport{Gol10,
author = {O. Goldreich},
title = {Introduction to testing graph properties},
institution = {Electronic Colloquium on Computational
Complexity (ECCC)},
number = {TR10-082},
month = {May},
year = {2010}
}
@article{Gol82,
author = {L. Goldschlager},
title = {A universal interconnection pattern for parallel
computers},
journal = jacm,
volume = {29},
year = {1982},
pages = {1073--1086}
}
@article{GoPa86,
author = {L. Goldschlager and I. Parberry},
title = {On the construction of parallel computers from various
bases of Boolean functions},
journal = tcs,
volume = {21},
year = {1986},
pages = {43--58}
}
@inproceedings{GoJo86,
author = {J. Goldsmith and D. Joseph},
title = {Three results on polynomial-time isomorphism of {NP}-complete
sets},
booktitle = proc27 # focs,
year = {1986},
pages = {390--397}
}
@article{GHK92,
author = {J. Goldsmith and L. Hemachandra and K. Kunen},
title = {Polynomial-time compression},
journal = {Computational Complexity},
volume = {2},
year = {1992},
pages = {}
}
@article{GHJY93,
author = {J. Goldsmith and L. Hemachandra and D. Joseph and P. Young},
title = {Near-testable sets},
journal = sicomp,
volume = {20},
year = {1991},
pages = {nnn--nnn}
}
@article{GJY93,
author = {J. Goldsmith and D. Joseph and P. Young},
title = {Using self-reducibilities to characterize polynomial time},
journal = infcomp,
volume = {104},
year = {1993},
pages = {nnn--nnn}
}
@article{GJY93b,
author = {J. Goldsmith and D. Joseph and P. Young},
title = {A note on bi-immunity and p-closeness of p-cheatable sets
in {P/Poly}},
journal = jcss,
volume = {46},
year = {1993},
pages = {nnn--nnn}
}
@article{GoJo93,
author = {J. Goldsmith and D. Joseph},
title = {Relativized isomorphisms of {NP}-completeness},
journal = compcomp,
volume = {3},
year = {1993},
pages = {186--205}
}
@article{GMR89,
author = {S. Goldwasser and S. Micali and C. Rackoff},
title = {The knowledge complexity of interactive proof systems},
journal = sicomp,
volume = {18},
year = {1989},
pages = {186--208}
}
@book{GoVL96,
author = {G.H. Golub and C. van Loan},
title = {Matrix Computations},
publisher = {The Johns Hopkins University Press, Baltimore},
year = {1996}
}
@article{Good71,
author = {I.J. Good},
title = {The relationship between tow fast {F}ourier transforms},
journal = ieeetc,
volume = {C-20},
year = {1971},
pages = {310--317}
}
@phdthesis{Gop06,
author = {P. Gopalan},
title = {Computing with polynomials modulo composite numbers},
school = {Georgia Institute of Technology},
year = {2006}
}
@article{Gop08,
author = {P. Gopalan},
title = {Query-efficient algorithms for polynomial interpolation
over composites},
journal = sicomp,
year = {2008},
volume = {38},
pages = {1033--1057}
}
@article{Gor79,
author = {D. Gordon},
title = {Complexity classes of provably recursive functions},
journal = jcss,
volume = {18},
year = {1979},
pages = {294--308}
}
@misc{Got98,
author = {D. Gottesman},
title = {The {H}eisenberg representation of quantum computers},
howpublished = {http://arxiv.org/abs/quant-ph/9807006},
year = {1998}
}
@inproceedings{Got93,
author = {G. Gottlob},
title = {{NP} trees and {C}arnap's Modal Logic},
booktitle = proc34 # focs,
year = {1993},
pages = {42--51}
}
@techreport{GJM94,
author = {K. Govindarajan and B. Jayaraman and S. Mantha},
title = {Preference logic programming: Optimization as inference},
institution = {Department of Computer Science, University
at Buffalo},
number = {UB-CS TR 94-12},
month = {April},
year = {1994}
}
@techreport{GoJa94,
author = {K. Govindarajan and B. Jayaraman},
title = {Intensional algorithmic debugging (perliminary version},
institution = {Department of Computer Science, University
at Buffalo},
number = {UB-CS TR 94-13},
month = {April},
year = {1994}
}
@misc{GowBlog09,
author = {T. Gowers},
title = {A conversation about complexity lower bounds},
booktitle = {Gowers's Weblog},
url = "http://gowers.wordpress.com/2009/11/10/a-conversation-about-complexity-lower-bounds-x-2/",
month = {Sep--Nov},
year = {2009}
}
@ARTICLE{Gra90,
AUTHOR = {E. Graedel},
TITLE = {On the notion of linear-time computability},
JOURNAL = ijfcs,
VOLUME = {1},
YEAR = {1990},
PAGES = {295--307}
}
@book{GKP89,
author = {R. Graham and D. Knuth and O. Patashnik},
title = {Concrete Mathematics},
publisher = {Addison-Wesley},
address = {Reading, Massachusetts},
year = {1989}
}
@article{Gran88,
author = {E. Grandjean},
title = {A natural {NP}-complete problem with a nontrivial
lower bound},
journal = sicomp,
volume = {17},
year = {1988},
pages = {786--809}
}
@article{Gran90,
author = {E. Grandjean},
title = {A nontrivial lower bound for an {NP} problem on automata},
journal = sicomp,
volume = {19},
year = {1990},
pages = {438--451}
}
@INPROCEEDINGS{GrRo91,
AUTHOR = {E. Grandjean and J. Robson},
TITLE = {R{AM} with compact memory: a robust and realistic model of
computation},
BOOKTITLE = {CSL '90: Proceedings of the 4th Annual Workshop in Computer
Science Logic},
PUBLISHER = springer,
SERIES = lncs,
volume = {533},
YEAR = {1991},
pages = {195--233}
}
@inproceedings{GrRo91s,
AUTHOR = {E. Grandjean and J. Robson},
TITLE = {R{AM} with compact memory: a robust and realistic model of
computation},
BOOKTITLE = {Proc. CSL '90, LNCS 533},
YEAR = {1991},
pages = {195--233}
}
@techreport{Gran92,
author = {E. Grandjean},
title = {Invariance properties of {RAMs} and linear time},
institution = {Laboratoire d'Informatique de l/Universit{\'e}
de Caen},
number = {92-3},
month = {February},
year = {1992}
}
@techreport{Gran93,
author = {E. Grandjean},
title = {Sorting linear time and the satisfiability problem},
institution = {Laboratoire d'Informatique de l/Universit{\'e}
de Caen},
number = {17},
month = {September},
year = {1993}
}
@article{Gran94,
author = {E. Grandjean},
title = {Linear time algorithms and {NP}-complete problems},
journal = sicomp,
volume = {23},
year = {1994},
pages = {573--597}
}
@article{Gran94b,
author = {E. Grandjean},
title = {Invariance properties of {RAMs} and linear time},
journal = compcomp,
volume = {4},
year = {1994},
pages = {62--106}
}
@article{Gran96,
author = {E. Grandjean},
title = {Sorting, linear time, and the satisfiability problem},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {16},
year = {1996},
pages = {183--236}
}
@article{Gra80,
author = {P. Grant},
title = {Some more independence results in complexity theory},
journal = tcs,
volume = {12},
year = {1980},
pages = {119--126}
}
@article{Gra92,
author = {A. Granville},
title = {Primality testing and {C}armichael numbers},
journal = {Notices of the AMS},
volume = {39},
month = {September},
year = {1992},
pages = {696--700}
}
@inproceedings{Grape90,
author = {P. Grape},
title = {Complete problems with {$\L$}-samplable distributions},
booktitle = {Proceedings, SWAT '90},
series = {Lecture Notes in Computer Science},
number = {447},
publisher = springer,
year = {1990},
pages = {360--367}
}
@article{GHI67,
author = {J. Gray and M. Harrison and O. Ibarra},
title = {Two-way pushdown automata},
journal = infcon,
volume = {1},
year = {1967},
pages = {30--70}
}
@techreport{Gray02,
author = {R.M. Gray},
title = {{T}oeplitz and Circulant matrices: A review},
year = {2002},
institution = {Stanford University}
}
@inproceedings{GKT92,
author = {F.~Green and J.~K{\"o}bler and J.~Tor{\'a}n},
title = {The power of the middle bit},
booktitle = proc7 # structures,
year = {1992},
pages = {111--117}
}
@article{Gre93,
author = {F. Green},
title = {On the power of deterministic redutions to {C$_=$P}},
journal = mst,
volume = {26},
year = {1993},
pages = {215--223}
}
@inproceedings{Gre95,
author = {F. Green},
title = {Lower Bounds for Depth-Three Circuits With Equals
and Mod-Gates},
booktitle = proc12 # stacs,
series = lncs,
publisher = springer,
volume = {900},
year = {1995}
}
@incollection{Gre07,
author = {B. Green},
title = {Long arithmetic progression of primes},
booktitle = {Analytic Number Theory: a tribute to Gauss and
Dirichlet},
editor = {T. Duke},
volume = {Clay Mathematics Proceedings 7},
year = {2007},
pages = {149--168}
}
@article{GrTa08,
author = {B. Green and T. Tao},
title = {The primes contain arbitrarily long arithmetic progressions},
journal = {Annals of Mathematics},
volume = {167},
year = {2008},
pages = {481--587}
}
@article{GrHo69,
author = {S. Greibach and J. Hopcroft},
title = {Scattered context grammars},
journal = jcss,
volume = {3},
year = {1969},
pages = {233--247}
}
@article{Gre73,
author = {S. Greibach},
title = {The hardest context-free language},
journal = sicomp,
volume = {2},
year = {1973},
pages = {304--310}
}
@inproceedings{Gre79,
author = {S. Greibach},
title = {Formal languages: Origins and directions},
booktitle = proc20 # focs,
year = {1979},
pages = {66--90}
}
@article{Gre81,
author = {S. Greibach},
title = {Formal languages: Origins and directions},
journal = {Ann. Hist. Comp.},
volume = {3},
year = {1981},
pages = {14--41}
}
@InCollection{GPS98,
author = "Greuel, G.-M. and Pfister, G. and Sch{\"o}nemann, H.",
title = {{Singular version 1.2 User Manual }},
institution = "Centre for Computer Algebra",
year = 1998,
booktitle = "Reports On Computer Algebra",
publisher = "Centre for Computer Algebra, University of Kaiserslautern",
volume = 21,
month = "June",
note = "\verb?http://www.singular.uni-kl.de/?"
}
@TechReport{GPS05,
author = {G.-M. Greuel and G. Pfister and H. Sch\"onemann},
title = {{\sc Singular} 3.0},
type = {{A Computer Algebra System for Polynomial Computations}},
institution = {Centre for Computer Algebra},
address = {University of Kaiserslautern},
year = {2005},
note = {{\tt http://www.singular.uni-kl.de}},
}
@inproceedings{ GrSh99,
author = "Frances Griffin and Igor Shparlinski",
title = "On the Linear Complexity of the Naor-Reingold Pseudo-Random Function",
booktitle = "{ICICS}",
pages = "301--308",
year = "1999",
url = "citeseer.ist.psu.edu/griffin99linear.html"
}
@article{GrSi95,
author = {M. Grigni and M. Sipser},
title = {Monotone separation of logarithmic space from
logarithmic depth},
journal = jcss,
volume = {50},
year = {1995},
pages = {433--437}
}
@inproceedings{GrKa98,
author = {D. Grigoriev and M. Karpinski},
title = {An exponential lower bound for depth 3 arithmetic circuits},
booktitle = proc30 # stoc,
year = {1998},
pages = {577--582}
}
@article{GrRa00,
author = {D. Grigoriev and A.A. Razborov},
title = {Exponential lower bounds for depth 3 algebraic circuits
in algebras of functions over finite fields},
journal = {Applicable Algebra in Engineering, Communication, and
Computing},
volume = {10},
year = {2000},
pages = {465--487},
note = {(preliminary version FOCS 1998)}
}
@Article{GrSt95,
author = "P. Gritzmann and B. Sturmfels",
title = "Minkowski Addition of Polytopes: Computational
Complexity and Applications to Grobner Bases",
journal = "SIAM Journal on Discrete Mathematics",
volume = "6",
number = "2",
pages = "246--269",
year = "1993",
}
@inproceedings{GrSe84,
author = {J. Grollmann and A. Selman},
title = {Complexity measures for public-key cryptosystems
(preliminary report)},
booktitle = proc25 # focs,
year = {1984},
pages = {495--503}
}
@article{GrSe88,
author = {J. Grollmann and A. Selman},
title = {Complexity measures for public-key cryptosystems},
journal = sicomp,
volume = {17},
year = {1988},
pages = {309--335}
}
@ARTICLE{Gro02,
author = {Vince Grolmusz},
title = {Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications},
journal = {SIAM Journal on Computing},
year = {2002},
volume = {32},
pages = {2002--02}
}
@inproceedings{Gro96,
author = {Grover, Lov K.},
title = {A fast quantum mechanical algorithm for database search},
booktitle = {Proceedings of the twenty-eighth annual ACM symposium on Theory of computing},
series = {STOC '96},
year = {1996},
isbn = {0-89791-785-5},
location = {Philadelphia, Pennsylvania, United States},
pages = {212--219},
numpages = {8},
url = {http://doi.acm.org/10.1145/237814.237866},
doi = {http://doi.acm.org/10.1145/237814.237866},
acmid = {237866},
publisher = {ACM},
address = {New York, NY, USA},
}
@ARTICLE{Gro97,
author = "L.K. Grover",
title = "Quantum mechanics helps in searching for a needle in a haystack",
journal = "Physical Review Letters",
volume = "79(2)",
year = "1997",
pages = "325-328"
}
@article{Grun81,
author = {F. A. Gr{\"u}nbaum},
title = {Eigenvectors of a {T}oeplitz matrix: discrete version of
the prolate spheroidal wave functions},
journal = "SIAM J. Alg. Disc. Meth.",
volume = {2},
year = {1981},
pages = {136--141}
}
@article{Gru90,
author = {J. Gruska},
title = {Synthesis, structure, and power of systolic computations},
journal = tcs,
volume = {71},
year = {1990},
pages = {47--77}
}
@article{GuLa91,
author = {X. Guan and M. Langston},
title = {Time-space optimal parallel merging and sorting},
journal = {IEEE Transactions on Computers},
volume = {40},
number = {5},
year = {1991},
pages = {596--602}
}
@article{GuLa92,
author = {X. Guan and M. Langston},
title = {Parallel methods for solving fundamental file
rearrangement problems},
journal = jpdc,
volume = {14},
year = {1992},
pages = {436--439}
}
@inproceedings{GNW90,
author = {T. Gundermann and N. Nasser and G. Wechsung},
title = {A survey on counting classes},
booktitle = proc5 # structures},
year = {1990},
pages = {140--153}
}
@article{Gup92,
author = {S. Gupta},
title = {On the closure of certain function classes under
integer division by polynomially-bounded functions},
journal = ipl,
volume = {44},
year = {1992},
pages = {205--210}
}
@techreport{Gup92b,
author = {S. Gupta},
title = {On bounded-probability operators and {C$_{=}$P}},
number = {OSU-CISRC-11/92-TR32},
institution = {Dept. of Comp. Sci., Ohio State University},
year = {1992}
}
@techreport{Gup93,
author = {S. Gupta},
title = {On isolating an odd number of elements and its applications
to complexity theory},
number = {OSU-CISRC-6/93-TR24},
institution = {Dept. of Comp. Sci., Ohio State University},
year = {1993}
}
@inproceedings{GuSh88,
author = {Y. Gurevich and S. Shelah},
title = {Nondeterministic linear-time tasks may require
substantially nonlinear deterministic time in the case of sublinear
work space},
booktitle = proc20 # stoc,
year = {1988},
pages = {281--289}
}
@INPROCEEDINGS{GuSh89,
AUTHOR = {Y. Gurevich and S. Shelah},
TITLE = {Nearly-linear time},
BOOKTITLE = {Proceedings, Logic at Botik '89},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {363},
YEAR = {1989},
PAGES = {108--118}
}
@article{Gur91,
author = {Y. Gurevich},
title = {Average case completeness},
journal = jcss,
volume = {42},
year = {1991},
pages = {346--398}
}
@inproceedings{GuKh00,
author = {V. Guruswami and S. Khanna},
title = {On the hardness of 4-coloring a 3-colorable graph},
booktitle = proc15 # ccc,
year = {2000},
pages = {188--197}
}
@
@article{GuKh04,
author = {V. Guruswami and S. Khanna},
title = {On the hardness of 4-coloring a 3-colorable graph},
journal = {SIAM J. Disc. Math},
volume = {18},
year = {2004},
pages = {30--40}
}
@inproceedings{Habnn,
author = {K. Habart},
title = {Randomness and Turing reducibility restraints},
booktitle = {nnn},
year = {nnnn},
pages = {234--247}
}
@article{HaRu89,
author = {T. Hagerup and C. R{\"u}b},
title = {A guided tour of {C}hernoff bounds},
journal = ipl,
volume = {33},
year = {1989},
pages = {305--308}
}
@article{Haj79,
author = {P. H{\'a}jek},
title = {Arithmetical hierarchy and complexity of computation},
journal = tcs,
volume = {8},
year = {1979},
pages = {227--237}
}
@book{HP93,
author = {P. H{\'a}jek and P. Pudl{\'a}k},
title = {Metamathematics of First-Order Arithmetic},
publisher = springer,
year = {1993}
}
@inproceedings{HMPST87,
author = {A. Hajnal and W. Maass and P. Pudl{\'a}k and M. Szegedy
and G. Tur{\'a}n},
title = {Threshold circuits of bounded depth},
booktitle = proc28 # focs,
year = {1987},
pages = {99--110}
}
@inproceedings{HMT88,
author = {A. Hajnal and W. Maass and G. Turan},
title = {On the communication complexity of graph properties},
booktitle = proc20 # stoc,
year = {1988},
pages = {186--191}
}
@article{Hak85,
author = {A. Haken},
title = {The intractability of resolution},
journal = tcs,
volume = {39},
year = {1985},
pages = {297--308}
}
@inproceedings{HRS93,
author = {M. Halld{\'o}rsson and J. Radhakrishnan and
K. Subrahmanyam},
title = {On some communication complexity problems related
to threshold functions},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {248--259}
}
@article{Hall80,
author = {J. Hall},
title = {Locally {P}eteresen graphs},
journal = {J. Graph Thy.},
volume = {4},
year = {1980},
pages = {173--187}
}
@misc{HaWa96,
author = {M. Hallett and H..T. Wareham},
title = {A compendium of parameterized complexity results, version
2.0},
month = {May},
year = {1996},
institution = {Computer Science Department, University of Victoria},
note = {URL:
{\tt \verb+http://www-csc.uvic.ca/home/harold/W_hier/compendium.html+}}
}
@article{HLMW86,
author = {J. Halpern and M. Loui and A. Meyer and D. Weise},
title = {On time versus space {III}},
journal = mathsys,
volume = {19},
year = {1986},
pages = {13--28}
}
@techreport{HHT93,
author = {Y. Han and L. Hemaspaandra and T. Thierauf},
title = {Threshold computation and cryptographic security},
institution = {University of Rochester, Computer Science},
number = {TR 461},
year = {1993},
month = {June}
}
@techreport{HaTh93,
author = {Y. Han and T. Thierauf},
title = {Advice from nonadaptive queries to {NP}},
institution = {Computer Science, University of Rochester},
number = {470},
month = {October},
year = {1993}
}
@misc{HJLT94,
author = {T. Hancock and T. Jiang and M. Li and J. Tromp},
title = {Lower bounds on learning decision lists and trees (draft)},
month = {May},
year = {1994}
}
@inproceedings{HSST16,
author = {T. H{\"a}ner and D. Steiger and M. Smelyanskiy and M. Troyer},
title = {High performance emulation of quantum circuits},
booktitle = {Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Salt Lake City, Utah, Nov. 2016},
publisher = {IEEE press},
year = {2016},
note = {Article 74 in e-volume}
}
@misc{HaSt17,
author = {T. H{\"a}ner and D. Steiger},
title = {0.5 Petabyte simulation of a 45-qubit quantum circuit},
year = {2017},
month = {April},
day = {4},
howpublished = {arXiv:1704.01127v1}
}
@article{HRS17,
author = {T. H{\"a}ner and M. Roetteler and K. Svore},
title = {Factoring using 2n+2 qubits with {T}offoli based modular multiplication},
journal = {Quantum Information and Computation},
volume = {17},
year = {2017}
}
@article{HKL92,
author = {T. Harju and H.C.M. Kleijn and M. Latteux},
title = {Deterministic sequential functions},
journal = {Acta Informatics},
volume = {29},
year = {1992},
pages = {545--554}
}
@article{HaKl93,
author = {T. Harju and H.C.M. Kleijn},
title = {Morphisms and rational transducers},
journal = beatcs,
volume = {51},
year = {1993},
month = {October},
pages = {168--180},
note = {Guest column, A. Salomaa ed., Formal Language Theory Column}
}
@article{Har92,
author = {V. Harnick},
title = {Provably total functions of intuitionistic bounded
arithmetic},
journal = jsl,
volume = {57},
year = {1992},
pages = {466--477}
}
@article{HaNa10,
author = {D. Harnik and M. Naor},
title = {On the compressibility of {NP} instances and
cryptographic applications},
journal = sicomp,
volume = {39},
year = {2010},
pages = {1667--1713}
}
@book{Har92,
author = {J. Harris},
title = {Algebraic Geometry: A First Course},
publisher = springer,
series = gtm,
volume = {133},
year = {1992}
}
@techreport{Har81,
author = {P. Harrison},
title = {The finite state machine as a software engineering tool},
institution = {IBM Research Division},
number = {RC 8861 (\#38784) 5/19/81},
address = {San Jos{\'e}, California},
year = {1981}
}
@inproceedings{HMS11,
author = {A. Harrow and A. Montanaro and A. Short},
title = {Limitations on quantum dimensionality reduction},
booktitle = proc38 # icalp,
volume = {6756},
series = lncs,
publisher = springer,
year = {2011},
pages = {86--97},
note = {arXiv:1012.2262}
}
@article{HaSt65,
author = {J. Hartmanis and R. Stearns},
title = {On the computational complexity of algorithms},
journal = {Transactions of the AMS},
year = {1965},
volume = {117},
pages = {285--306}
}
@inproceedings{HLS65,
author = {J. Hartmanis and P. L{ewis II} and R. Stearns},
title = {Hierarchies of memory-limited computations},
booktitle = {Proceedings, Sixth Annual IEEE Symposium on
Switching Circuit Theory and Logical Design (now FOCS)},
year = {1965},
pages = {179--190}
}
@book{HS66,
author = {J. Hartmanis and R. Stearns},
title = {Algebraic Structure Theory of Sequential Machines},
publisher = {Prentice-Hall},
address = {Englewood Cliffs, NJ},
year = {1966}
}
@article{Har71,
author = {J. Hartmanis},
title = {Computational complexity of random access stored
program machines},
journal = mathsys,
volume = {5},
year = {1971},
pages = {232--245}
}
@article{HaLe71,
author = {J. Hartmanis and F. Lewis},
title = {The use of lists in the study of undecidable problems in
automata theory},
journal = jcss,
volume = {5},
year = {1971},
pages = {54--66}
}
@inproceedings{HaSi74,
author = {J. Hartmanis and J. Simon},
title = {On the power of multiplication in random-access machines},
booktitle = proc15 # "Annual IEEE Symposium on Switching and Automata Theory (now FOCS)",
year = {1974},
pages = {13--23}
}
@article{Har75,
author = {J. Hartmanis},
title = {Independence results about context-free languages and
lower bounds},
journal = ipl,
volume = {20},
year = {1985},
pages = {241--248}
}
@article{HaHo76,
author = {J. Harmanis and J. Hopcroft},
title = {Independence results in computer science},
journal = {SIGACT News},
volume = {8},
year = {1976},
pages = {13--24}
}
@article{Har78,
author = {J. Hartmanis},
title = {On log-tape isomorphisms of complete sets},
journal = tcs,
volume = {7},
year = {1978},
pages = {273--286}
}
@book{Har78b,
author = {J. Hartmanis},
title = {Feasible Computations and Provable Complexity Properties},
publisher = {SIAM Press},
year = {1978}
}
@inproceedings{HIM78,
author = {J. Hartmanis and N. Immerman and S. Mahaney},
title = {One-way log tape reductions},
booktitle = proc19 # focs,
year = {1978},
pages = {65--72}
}
@article{Har79,
author = {J. Hartmanis},
title = {Relations between diagonalization, proof systems,
and complexity gaps},
journal = tcs,
volume = {8},
year = {1979},
pages = {224--233}
}
@article{HaMa81,
author = {J. Hartmanis and S. Mahaney},
title = {Languages simultaneously complete for one-way and two-way
log-tape automata},
journal = sicomp,
volume = {10},
year = {1981},
pages = {383--390}
}
@article{Har83,
author = {J. Hartmanis},
title = {On G{\"o}del speed-up and succinctness of language
representations},
journal = tcs,
volume = {26},
year = {1983},
pages = {335--342}
}
@article{Har85,
author = {J. Hartmanis},
title = {Independence results about context-free languages and
lower bounds},
journal = ipl,
volume = {20},
year = {1985},
pages = {241--248}
}
@inproceedings{HaHe86,
author = {J. Hartmanis and L. Hemachandra},
title = {Complexity classes without machines: On complete languages
for {UP}},
booktitle = proc13 # icalp,
series = lncs,
volume = {226},
publisher = springer,
year = {1986},
pages = {123--135}
}
@article{HaHe88,
author = {J. Hartmanis and L. Hemachandra},
title = {Complexity classes without machines: On complete languages
for {UP}},
journal = tcs,
volume = {58},
year = {1988},
pages = {129--142}
}
@inproceedings{Har88,
author = {J. Hartmanis},
title = {New directions in structural complexity theory},
booktitle = proc15 # icalp,
year = {1988},
volume = {317},
series = lncs,
publisher = springer,
pages = {271--286}
}
@book{Har89,
editor = {J. Hartmanis},
title = {Computational Complexity Theory},
publisher = ams,
year = {1989}
}
@article{HaHe90,
author = {J. Hartmanis and L. Hemachandra},
title = {Robust machines accept easy sets},
journal = tcs,
volume = {74},
year = {1990},
pages = {217--225}
}
@article{HaHe91,
author = {J. Hartmanis and L. Hemachandra},
title = {One-way functions and the nonisomorphism of
{NP}-complete sets},
journal = tcs,
volume = {81},
year = {1991},
pages = {155--163}
}
@article{Har94,
author = {J. Hartmanis},
title = {On computational complexity and the nature of computer
science},
journal = cacm,
volume = {37},
year = {1994},
pages = {37--43}
}
@inproceedings{Has86,
author = {J. H{\aa}stad},
title = {Almost optimal lower bounds for small-depth circuits},
booktitle = proc18 # stoc,
year = {1986},
pages = {6--20}
}
@article{Has87,
author = {J. H{\aa}stad},
title = {One-way permutations in {NC$^0$}},
journal = ipl,
volume = {26},
year = {1987},
pages = {153--155}
}
@book{Has88,
author = {J. H{\aa}stad},
title = {On the Computational Limitations of Small-Depth Circuits},
publisher = {MIT Press},
address = {Cambridge, MA},
year = {1988}
}
@incollection{Has89,
author = {J. H{\aa}stad},
title = {Almost optimal lower bounds for small-depth circuits},
booktitle = {Randomness and Computation},
series = {Advances in Computing Research},
volume = {5},
editor = {S. Micali},
publisher = {JAI Press},
address = {Greenwich, CT, USA},
year = {1989},
pages = {143--170}
}
@inproceedings{Has90,
author = {J. H{\aa}stad},
title = {Pseudorandom generation under uniform assumptions},
booktitle = proc22 # stoc,
year = {1990},
pages = {395--404}
}
@techreport{HILL91,
author = {J. H{\aa}stad and R. Impagliazzo and L. Levin and
M. Luby},
title = {Construction of a pseudo-random generator from any
one-way function},
institution = {International Computer Science Institute,
Berkeley},
number = {91--68},
year = {1991}
}
@article{HILL99,
author = {J. H{\aa}stad and R. Impagliazzo and L. Levin and
M. Luby},
title = {Construction of a pseudo-random generator from any
one-way function},
journal = sicomp,
volume = {28},
year = {1999},
pages = {1364--1396}
}
@article{HaGo91,
author = {J. H{\aa}stad and M. Goldmann},
title = {On the power of small-depth threshold circuits},
journal = {Computational Complexity},
volume = {1},
year = {1991},
pages = {113--129}
}
@inproceedings{Has93,
author = {J. H{\aa}stad},
title = {The shrinkage exponent is 2},
booktitle = proc34 # focs,
year = {1993},
pages = {114--123}
}
@article{Has98,
author = {J. H{\aa}stad},
title = {The shrinkage exponent is 2},
journal = sicomp,
volume = {27},
year = {1998},
pages = {48--64}
}
@article{Has02,
author = {J. H{\aa}stad},
title = {Some optimal inapproximability results},
journal = jacm,
volume = {48},
year = {2002},
pages = {798--859}
}
@article{Hay69,
author = {L. Hay},
title = {Index sets of finite classes of recursively enumerable sets},
journal = jsl,
volume = {34},
year = {1969},
pages = {39--44}
}
@article{Hay74,
author = {L. Hay},
title = {Index sets universal for differences of arithmetic sets}, journal = zml,
volume = {20},
year = {1974},
pages = {239--254}
}
@book{Hay88,
author = {J.P. Hayes},
title = {Computer Architecture and Organization (Second Edition)},
publisher = {McGraw-Hill},
year = {1988}
}
@techreport{HePe90,
author = {L. Heath and S. Pemmaraju},
title = {New results for the minimum-weight triangulation problem},
institution = {Department of Computer Science,
Virginia Polytechnic Institute and State University},
number = {90--65},
year = {1990}
}
@article{HNW93,
author = {R. Heiman and I. Newman and A. Wigderson},
title = {On read-once threshold formulae and their randomized
decision tree complexity},
journal = tcs,
volume = {107},
year = {1993},
pages = {63--76}
}
@article{HeMo93,
author = {J. Heintz and J. Morgenstern},
title = {On the intrinsic complexity of elimination theory},
journal = {Journal of Complexity},
volume = {9},
year = {1993},
pages = {471--498}
}
@article{Hel86,
author = {F. Heller},
title = {On relativized exponential and probabilistic complexity
classes},
journal = infcon,
volume = {71},
year = {1986},
pages = {231--243}
}
@inproceedings{HeJh93,
author = {L. Hemachandra and S. Jha},
title = {Defying upward and downward separation},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {185--195}
}
@article{HeHo91,
author = {L. Hemachandra and A. Hoene},
title = {On sets with efficient implicit membership tests},
journal = sicomp,
volume = {20},
year = {1991},
pages = {nnn--nnn}
}
@techreport{HNOS93,
author = {E. Hemaspaandra and A. Naik and M. Ogiwara and
A. Selman},
title = {P-selective sets, and reducing search to decision
versus self-reducibility},
institution = {Computer Science Dept., SUNY at Buffalo},
number = {93--21},
address = {Buffalo, NY 14260},
year = {1993}
}
@techreport{HemaspaandraNaikOgiwaraSelman93,
author = {E. Hemaspaandra and A. Naik and M. Ogiwara and
A. Selman},
title = {P-selective sets, and reducing search to decision
versus self-reducibility},
institution = {Computer Science Dept., SUNY at Buffalo},
number = {93--21},
address = {Buffalo, NY 14260},
year = {1993}
}
@techreport{HNOS93b,
author = {L. Hemaspaandra and A. Naik and M. Ogiwara and A. Selman},
title = {Computing solutions uniquely collapses the polynomial
hierarchy},
institution = {Computer Science Dept., SUNY at Buffalo},
number = {CS-TR 93-28},
month = {August},
year = {1993}
}
@inproceedings{HNOS94,
author = {L. Hemaspaandra and A. Naik and M. Ogiwara and A. Selman},
title = {Computing solutions uniquely collapses the polynomial
hierarchy},
booktitle = {Proceedings, 5th International Symposium on Algorithms
and Computation},
series = lncs,
volume = {834},
publisher = springer,
year = {1994},
pages = {56--64}
}
@article{HRZ95,
author = {L.~Hemaspaandra and A.~Ramachandran and M.~Zimand},
title = {Worlds to Die For---{Complexity Theory Column~11}},
journal = {SIGACT News},
volume = {26},
number = {4},
year = {1995},
pages = {5--15}
}
@article{HNOS96,
author = {L. Hemaspaandra and A. Naik and M. Ogiwara and A. Selman},
title = {Computing solutions uniquely collapses the polynomial
hierarchy},
journal = sicomp,
volume = {25},
year = {1996},
pages = {697--708}
}
@inproceedings{HHOSTW93,
author = {L. Hemachandra and A. Hoene and M. Ogiwara
and A. Selman and T. Thierauf and J. Wang},
title = {Selectivity},
booktitle = proc5 # icci,
year = {1993},
pages = {54--58}
}
@techreport{HHNOSTW93,
author = {L. Hemaspaandra and A. Hoene and A. Naik and M. Ogiwara
and A. Selman and T. Thierauf and J. Wang},
title = {Selectivity: reductions, nondeterminism, and function
classes},
institution = {Computer Science, University of Rochester},
number = {469},
month = {August},
year = {1993}
}
@techreport{HeZi93,
author = {L. Hemaspaandra and M. Zimand},
title = {Seeking stronger separations: probability one
balanced- and bi-immunity},
institution = {Computer Science, University of Rochester},
number = {480},
month = {December},
year = {1983}
}
@techreport{HeJi94,
author = {L. Hemaspaandra and Z. Jiang},
title = {P-selectivity: intersections and indices},
institution = {Computer Science, University of Rochester},
number = {482},
month = {January},
year = {1994}
}
@techreport{HeRo94,
author = {L. Hemaspaandra and J. Rothe},
title = {Unambiguous computation: Boolean hierarchies and
sparse {T}uring-complete sets},
institution = {Computer Science, University of Rochester},
number = {483},
month = {January},
year = {1994}
}
@article{HeJi97,
author = {L. Hemaspaandra and Z. Jiang},
title = {Logspace reducibility: models and equivalences},
journal = {International Journal of Foundations of
Computer Science},
year = {1997},
volume = {8}
}
@book{HeSe97,
title = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
note = {In press}
}
@article{HeRo00,
title = "A Second step towards complexity-theoretic analogs of
{Rice's Theorem}",
author = "L. Hemaspaandra and {J\"org} Rothe",
journal = "Theoretical Computer Science",
pages = "205-217",
volume = "244",
number = "1-2",
year = "2000"
}
@article{Hen66,
author = {F. Hennie},
title = {On-line {Turing} machine computation},
journal = {IEEE Trans. Electr. Comp.},
volume = {EC-15},
year = {1966},
pages = {35--44}
}
@ARTICLE{HeSt66,
AUTHOR = {F. Hennie and R. Stearns},
TITLE = {Two--way simulation of multitape {Turing} machines},
JOURNAL = jacm,
VOLUME = {13},
YEAR = {1966},
PAGES = {533--546}
}
@book{Hen81,
author = {F. Hennie},
title = {Iterative arrays of logic circuits},
publisher = {MIT Press, Cambridge, Mass.},
year = {1981}
}
@inproceedings{HeSh93,
author = {M. Herlihy and N. Shavit},
title = {The asynchronous computability theorem for {$t$}-resilient
tasks},
booktitle = proc25 # stoc,
year = {1993},
pages = {111--120}
}
@inproceedings{HeSh94,
author = {M. Herlihy and N. Shavit},
title = {A simple constructive computability theorem for
wait-free computation},
booktitle = proc26 # stoc,
year = {1994},
pages = {243--252}
}
@article{Her90,
author = {U. Hertrampf},
title = {Relations among {MOD} classes},
journal = tcs,
volume = {74},
year = {1990},
pages = {325--328}
}
@inproceedings{HLSVW93,
author = {U. Hertrampf and C. Lautemann and T. Schwentick
and H. Vollmer and K. Wagner},
title = {On the power of polynomial time bit-reductions},
booktitle = proc8 # structures,
year = {1993},
pages = {200--207}
}
@article{Heu91,
author = {V. Heuring},
title = {Systems considerations in designing and implementing
a bit serial optical computer},
journal = {Optical Engineering},
volume = {30},
year = {1991},
pages = {1931--1935}
}
@article{HJP92,
author = {V. Heuring and H. Jordan and J. Pratt},
title = {Bit-serial architecture for optical computing},
journal = {Applied Optics},
volume = {31},
number = {17},
year = {1992},
pages = {3213--3224}
}
@techreport{Hey90,
author = {A. Heydon},
title = {An introduction to circuit complexity and a guide
to {H}astad's proof},
number = {CMU-CS-90-141},
institution = {Carnegie-Mellon Univ.},
year = {1990}
}
@article{HeRa92a,
author = {T. Heywood and S. Ranka},
title = {A practical hierarchical model of parallel computation
{I}: The model},
journal = jpdc,
volume = {16},
year = {1992},
pages = {212--232}
}
@article{HeRa92b,
author = {T. Heywood and S. Ranka},
title = {A practical hierarchical model of parallel computation
{II}: Binary tree and {FFT} algorithms},
journal = jpdc,
volume = {16},
year = {1992},
pages = {233--249}
}
@MISC{Hid97,
author = {Christian Hidber},
title = {A Generalisation of the Cantor-Zassenhaus Algorithm},
year = {1997}
}
@article{HiHu08,
author = {B. Hiesmayr and M. Huber},
title = {Multipartite entanglement measure for all discrete
systems},
journal = {Phys. Rev. A},
volume = {78},
year = {2008},
pages = {012342 1--7}
}
@article{HiLa90,
author = {M. Hill and J. Larus},
title = {Cache considerations for multiprocessor programmers},
journal = cacm,
volume = {33},
year = {1990},
month = {August},
pages = {97--102}
}
@article{HiSt86,
author = {W.D. Hillis and G. Steele},
title = {Data parallel algorithms},
journal = cacm,
volume = {29},
year = {1986},
pages = {1170--1183}
}
@INPROCEEDINGS{HiZa84,
AUTHOR = {P. Hinman and S. Zachos},
TITLE = {Probabilistic machines, oracles, and quantifiers},
BOOKTITLE = {Proceedings, Oberwohlfach Recursion-Theory Week,
Lecture Notes in Mathematics No.~1141},
PUBLISHER = springer,
YEAR = {1984},
PAGES = {159--192}
}
@article{HoTr98,
author = {Le Tuan Hoa and Ngo Viet Trung},
title = {On the {C}astelnuovo-{M}umford regularity
and the arithmetic degree of monomial ideals},
journal = {Mathematische Zeitschrift},
volume = {229},
year = {1998},
pages = {519--537}
}
@article{HoLo88,
author = {A. Hodel and M. Loui},
title = {Optimal dynamic embedding of {X}-trees into arrays},
journal = tcs,
volume = {59},
year = {1988},
pages = {259--276}
}
@inproceedings{HoNi93,
author = {A. Hoene and A. Nickelsen},
title = {Counting, selecting, and sorting by query-bounded machines},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {196--205}
}
@inproceedings{HHK91,
author = {T. Hofmeister and W. Hohberg and S. K{\"o}hling},
title = {Some notes on threshold circuits and multiplication in
depth 4},
booktitle = proc8 # fct,
year = {1991},
pages = {230--239}
}
@inproceedings{Hof96,
author = {T. Hofmeister},
title = {A Note on the Simulation of Exponential Threshold Weights},
booktitle = proc2 # "International Computing and Combinatorics
Conference (COCOON'96)",
series = lncs,
volume = {1090},
publisher = springer,
year = {1996},
pages = {136--141}
}
@ARTICLE{Hol73,
author = "A. S. Holevo",
title = " Some estimates of the information transmitted by quantum communication channels",
journal = "Problems of Information Transmission",
volume = "9",
year = "1973",
pages = "77-83",
note = "English Translation"
}
@article{HoMa83,
author = {S. Homer and W. Maass},
title = {Oracle dependent properties of the lattice of {NP} sets},
journal = tcs,
volume = {24},
year = {1983},
pages = {nnn--nnn}
}
@article{HoRe86,
author = {S. Homer and J. Reif},
title = {Arithmetic theories for computational complexity problems},
journal = infcon,
volume = {69},
year = {1986},
pages = {1--11}
}
@article{Hom87,
author = {S. Homer},
title = {Minimal degrees for polynomial reducibilities},
journal = jacm,
volume = {34},
year = {1987},
pages = {480--491}
}
@article{HoLo87,
author = {S. Homer and T. Long},
title = {Honest polynomial degrees and {P =? NP}},
journal = tcs,
volume = {51},
year = {1987},
pages = {nnn--nnn}
}
@inproceedings{HoSe89,
author = {S. Homer and A. Selman},
title = {Oracles for structural properties: The {I}somorphism
{P}roblem and public-key cryptography},
booktitle = proc4 # structures,
year = {1989},
pages = {3--14}
}
@article{HoSe92,
author = {S. Homer and A. Selman},
title = {Oracles for structural properties: The {I}somorphism
{P}roblem and public-key cryptography},
journal = jcss,
volume = {44},
year = {1992},
pages = {287--301}
}
@article{HoWa89,
author = {S. Homer and J. Wang},
title = {Absolute results concerning one-way functions and their
applications},
journal = mst,
year = {1989},
volume = {22},
pages = {21--35}
}
@misc{HoMo94,
author = {S. Homer and S. Mocas},
title = {Nonuniform lower bounds for exponential time classes},
year = {1994}
}
@article{HoWa94,
author = {S. Homer and J. Wang},
title = {Immunity of complete problems},
journal = infcon,
volume = {110},
year = {1994},
pages = {119--129}
}
@techreport{HoPe93,
author = {S. Homer and M. Peinado},
title = {On the performance of polynomial-time {CLIQUE}-approximation
algorithms on very large graphs},
institution = {Dept. of Computer Science, Boston University},
number = {nnn},
month = {August},
year = {1993}
}
@book{HS01,
author = {S. Homer and A. selman},
title = {Computability and Complexity Theory},
publisher = springer,
year = {2001}
}
@phdthesis{Hon94,
author = {H. Hon},
title = {A strongly asynchronous parallel algorithm for the
write-all problem},
school = {University of Waterloo},
year = {1994}
}
@article{Hong85,
author = {J.-W. Hong},
title = {On similarity and duality of computation {I}},
journal = infcomp,
volume = {62},
year = {1985},
pages = {109--128}
}
@book{Hong86,
author = {J.-W. Hong},
title = {Computation: Similarity and Duality},
series = {Research Notes in Theoretical Computer Science},
publisher = {Wiley},
year = {1986}
}
@article{HoVe93,
author = {J. Hong and M. Vetterli},
title = {Computing {$m$} {DFT's} over {GF($q$)} with
one {DFT} over {GF($q^m$)}},
journal = itit,
volume = {39},
number = {1},
year = {1993},
month = {January},
pages = {271--273}
}
@article{HKP84,
author = {H. Hoover and M. Klawe and N. Pippenger},
title = {Bounding fan-out in logical networks},
journal = jacm,
volume = {31},
year = {1984},
pages = {13--18}
}
@inproceedings{HPV75,
AUTHOR = {J. Hopcroft and W. Paul and L. Valiant},
TITLE = {On time versus space and related problems},
booktitle = proc16 # focs,
year = {1975},
pages = {57--64}
}
@ARTICLE{HPV77,
AUTHOR = {J. Hopcroft and W. Paul and L. Valiant},
TITLE = {On time versus space},
JOURNAL = jacm,
VOLUME = {24},
YEAR = {1977},
PAGES = {332--337}
}
@BOOK{HU79,
AUTHOR = {J. Hopcroft and J. Ullman},
TITLE = {Introduction to Automata Theory, Languages, and Computation},
PUBLISHER = {Addison--Wesley},
ADDRESS = {Reading, MA},
YEAR = {1979}
}
@misc{HoWa98,
author = {S. Horie and O. Watanabe},
title = {Hard instance generation for {SAT}}
}
@article{HSW89,
author = {K. Hornick and M. Stinchcombe and H. White},
title = {Multilayer feedforward networks are universal approximators},
journal = {Neural Networks},
volume = {2},
year = {1989},
pages = {359--366}
}
@article{HoPr91,
author = {S. Hornick and F. Preparata},
title = {Deterministic {P-RAM} simulation with constant redundancy},
journal = infcomp,
volume = {92},
year = {1991},
pages = {81-96}
}
@article{Hro91,
author = {J. Hromkovic},
title = {Nonlinear lower bounds on the number of processors of
circuits with sublinear separators},
journal = infcomp,
volume = {95},
year = {1991},
pages = {117--128}
}
@article{HJK91,
author = {J. Hromkovic and L. Janiga and V. Koubek},
title = {Variable multi-head machines},
journal = {J. Inform. Process. Cybernet.},
volume = {EIK 27},
year = {1991},
pages = {411--424}
}
@article{HKMW92,
author = {J. Hromkovic and M. Krause and C. Meinel and S. Waack},
title = {Branching programs provide lower bounds on the areas
of multilective deterministic and nondeterministic {VLSI} circuits},
journal = infcon,
volume = {96},
year = {1992},
pages = {168--178}
}
@article{HJKP10,
author = {P. Hrube{\v{s}} and S. Jukna and A. Kulikov and
P. Pudl{\'a}k},
title = {On convex complexity measures},
journal = tcs,
volume = {411},
year = {2010},
pages = {1842--1854}
}
@article{HACN90,
author = "F.H. Hsu and T. Anantharaman and M. Campbell and Andreas Nowatzyk",
title = "A Grandmaster Chess Machine",
journal = "Scientific American",
month = "October",
year = "1990",
volume = "263",
number = "4",
pages = "44 - 50"
}
@article{Hua89,
author = {X. Huang},
title = {A lower bound for the edit-distance problem under an
arbitrary cost function},
journal = ipl,
volume = {27},
year = {1988},
pages = {319--321}
}
@article{Hua84,
author = {A. Huang},
title = {Architectural considerations involved in the
design of an optical digital computer},
journal = {Proceedings of the IEEE},
volume = {72},
number = {7},
month = {July},
year = {1984},
pages = {780--786}
}
@incollection{Hua90,
author = {A. Huang},
title = {Optical digital computers: devices and architecture},
booktitle = {Concurrent Computations},
editor = {S. Tewksbury and B. Dickinson and S. Schwartz},
publisher = {Plenum},
year = {1990},
pages = {23--31}
}
@article{Hua92,
author = {A. Huang},
title = {Computational origami: the folding of circuits and systems},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5419--5422}
}
@article{HuLa88,
author = {B.-C. Huang and M. Langston},
title = {Practical in-place merging},
journal = cacm,
volume = {31},
month = {March},
year = {1988},
pages = {348--352}
}
@misc{HNS18,
author = {C. Huang and M. Newman and M. Szegedy},
title = {Explicit lower bounds on strong quantum simulation},
year = {2018},
howpublished = {https://arxiv.org/abs/1804.10368}
}
@misc{HNS19,
author = {C. Huang and M. Newman and M. Szegedy},
title = {Explicit lower bounds on strong simulation of quantum circuits in terms of {T}-gate count},
year = {2019},
howpublished = {https://arxiv.org/abs/1902.04764}
}
@misc{HuvEB94,
author = {Z. Huang and P. van Emde Boas},
title = {Information acquisition from multi-agent resources},
month = {February},
year = {1994}
}
@inproceedings{HKLLL17,
author={Xiang Huang and Titus H. Klinge and James I. Lathrop and Xiaoyuan Li and Jack H. Lutz},
title={Real-Time Computability of Real Numbers by Chemical Reaction Networks},
booktitle={Proceedings, 16th International Conference on Unconventional Computation and Natural Computation},
year={2017},
pages = {29--40}
}
@article{Huh93,
author = {M. H{\"u}hne},
title = {Linear speed-up does not hold for {T}uring machines with
tree storages},
journal = ipl,
volume = {47},
year = {1993},
pages = {313--318}
}
@article{Huh93s,
author = {M. H{\"u}hne},
title = {Linear speed-up does not hold for {T}uring machines with
tree storages},
journal = {IPL},
volume = {47},
year = {1993},
pages = {313--318}
}
@book{Hum81,
author = {J.E. Humphreys},
title = {Linear Algebraic Groups},
publisher = springer,
series = gtm,
volume = {21},
year = {1981},
note = {2nd printing}
}
@book{Hung80,
author = {T.W. Hungerford},
title = {Algebra},
publisher = springer,
series = gtm,
year = {1980},
note = {8th printing}
}
@article{Hunt76,
author = {H. {Hunt III}},
title = {On the complexity of finite, pushdown, and stack automata},
journal = mathsys,
volume = {10},
year = {1976},
pages = {33--52}
}
@inproceedings{HuSt88,
author = {H. Hunt and R. Stearns},
title = {On the complexity of satisfiability problems for
algebraic structures (preliminary report},
booktitle = proc6 # "Conference on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {250--258}
}
@Unpublished{HRS88,
author = "H. B. Hunt and S. S. Ravi and R. E. Stearns",
title = "Separators, Graph Homomorphisms and Chromatic
Polynomials (extended abstract)",
year = "1988",
note = "manuscript",
}
@article{HuSt90,
author = {H. {Hunt III} and R. Stearns},
title = {The complexity of very simple {B}oolean formulas,
with applications},
journal = sicomp,
volume = {19},
year = {1990},
pages = {44--70}
}
@article{Huy86,
author = {D. Huynh},
title = {A superexponential lower bound for {Gr{\"o}bner}
bases and {Church-Rosser} commutative {Thue} systems},
journal = infcon,
volume = {68},
year = {1986},
pages = {196--206}
}
@article{Huy92,
author = {D. Huynh},
title = {Nonuniform complexity and the randomness of certain
complete languages},
journal = tcs,
volume = {96},
year = {1992},
pages = {305--324}
}
@article{Hya79,
author = {L. Hyafil},
title = {On the parallel evaluation of multivariate polynomials},
journal = sicomp,
volume = {8},
year = {1979},
pages = {120--123}
}
@article{HyCo06,
author = {R. Hyatt and A. Cozzie},
title = {The effect of hash signature collisions in a computer
chess program},
journal = {ICGA Journal},
volume = {28},
year = {2006},
pages = {131--139}
}
@article{Iba72,
author = {O. Ibarra},
title = {A note concerning nondeterministic tape complexities},
journal = jacm,
volume = {19},
year = {1972},
pages = {608--612}
}
@inproceedings{Iba86,
author = {O. Ibarra},
title = {Systolic arrays: characterizations and complexity},
booktitle = {The Proceedings of the 1986 Conference on Mathematical Foundations of Computer Science},
series = {Lecture Notes in Computer Science No.~233},
publisher = springer,
year = {1986},
pages = {140--153}
}
@article{IbKi84,
author = {O. Ibarra and S. Kim},
title = {Characterizations and computational complexity of
systolic trellis automata},
journal = tcs,
volume = {29},
year = {1984},
pages = {123--153}
}
@article{IPK85,
author = {O. Ibarra and M. Palis and S. Kim},
title = {Some results concerning linear iterative (systolic) arrays},
journal = jpdc,
volume = {2},
year = {1985},
pages = {182--218}
}
@article{IKP86,
author = {O. Ibarra and S. Kim and M. Palis},
title = {Designing systolic algorithms using sequential machines},
journal = {IEEE Transactions on Computing},
volume = {35},
year = {1986},
pages = {531--542}
}
@article{IbJi87,
author = {O. Ibarra and T. Jiang},
title = {On one-way cellular arrays},
journal = sicomp,
volume = {16},
year = {1987},
pages = {1135--1153}
}
@article{IJR88,
author = {O. Ibarra and T. Jiang and B. Ravikumar},
title = {Some subclasses of context-free languages in {NC$^1$}},
journal = ipl,
volume = {29},
year = {1988},
pages = {111--117}
}
@article{Iba91,
author = {O. Ibarra},
title = {On resetting {DLBAs}},
journal = sigact,
volume = {22},
number = {1},
month = {Winter},
year = {1991},
pages = {62--63}
}
@article{IJW91,
author = {O. Ibarra and T. Jiang and H. Wang},
title = {Parallel parsing on a one-way linear array of
finite-state machines},
journal = tcs,
volume = {85},
year = {1991},
pages = {53--74}
}
@article{IJCR91,
author = {O. Ibarra and T. Jiang and J. Chang and B. Ravikumar},
title = {Some classes of languages in {NC$^1$}},
journal = infcomp,
volume = {90},
year = {1991},
pages = {86--106}
}
@article{IJW92,
author = {O. Ibarra and T. Jiang and H. Wang},
title = {String editing on a one-way linear array of finite-state
machines},
journal = ieeetc,
volume = {41},
month = {January},
year = {1992},
pages = {112--118}
}
@inproceedings{IJTW93,
author = {O. Ibarra and T. Jiang and N. Tran and H. Wang},
title = {On the equivalence of two-way pushdown automata and
counter machines over bounded languages},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {354--364}
}
@techreport{IbTr93,
author = {O. Ibarra and N. Tran},
title = {On the parallel complexity of solving recurrence equations},
insttitution = {Computer Science, University of California at
Santa Barbara},
number = {nnn},
month = {September},
year = {1993}
}
@article{IbTr94,
author = {O. Ibarra and N. Tran},
title = {On communication-bounded synchronized alternating
finite automata},
journal = {Acta Informatica},
volume = {31},
year = {1994},
pages = {315--327}
}
@inproceedings{Imm82,
author = {N. Immerman},
title = {Relational queries computable in polynomial time},
booktitle = proc14 # stoc,
year = {1982},
pages = {147--152}
}
@inproceedings{Imm83,
author = {N. Immerman},
title = {Languages which capture complexity classes},
booktitle = proc15 # stoc,
year = {1983},
pages = {347--354}
}
@article{Imm86,
author = {N. Immerman},
title = {Relational queries computable in polynomial time},
journal = infcon,
volume = {68},
year = {1986},
pages = {86--104}
}
@article{Imm87,
author = {N. Immerman},
title = {Languages which capture complexity classes},
journal = sicomp,
volume = {16},
year = {1987},
pages = {760--778}
}
@inproceedings{Imm87e,
author = {N. Immerman},
title = {Expressibility as a complexity measure: results and
directions},
booktitle = proc2 # structures,
year = {1987},
pages = {194--202}
}
@article{Imm88,
author = {N. Immerman},
title = {Nondeterministic space is closed under complementation},
journal = sicomp,
volume = {17},
year = {1988},
pages = {935--938}
}
@article{Imm89,
author = {N. Immerman},
title = {Expressibility and parallel complexity},
journal = sicomp,
volume = {18},
year = {1989},
pages = {625--638}
}
@incollection{Imm89b,
author = {N. Immerman},
title = {Descriptive and computational complexity},
booktitle = {Computational Complexity Theory},
editor = {J. Hartmanis},
series = {Proc. Symp. in Applied Math.},
volume = {38},
publisher = ams,
year = {1989},
pages = {75--91}
}
@inproceedings{ImLa89,
author = {N. Immerman and S. Landau},
title = {The complexity of iterated multiplication},
booktitle = proc4 # structures,
year = {1989},
pages = {104--111}
}
@inproceedings{Imm91,
author = {N. Immerman},
title = {{DSPACE$[n^k]$ = VAR$[k+1]$}},
booktitle = proc6 # structures,
year = {1991},
pages = {334--340}
}
@article{ImLa95,
author = {N. Immerman and S. Landau},
title = {The complexity of iterated multiplication},
journal = infcon,
volume = {116},
year = {1995},
pages = {103--116}
}
@book{Imm98,
author = {N. Immerman},
title = {Descriptive and Computational Complexity},
series = {Graduate Texts in Computer Science},
publisher = springer,
year = {1998},
note = "forthcoming"
}
@inproceedings{ImNa89,
author = {R. Impagliazzo and M. Naor},
title = {Efficient cryptographic schemes provably as secure as
subset-sum},
booktitle = proc30 # focs,
year = {1989}
}
@inproceedings{ImRu89,
author = {R. Impagliazzo and S. Rudich},
title = {Limits on the provable consequences of one-way permutations},
booktitle = proc21 # stoc,
year = {1989},
pages = {44--61}
}
@inproceedings{ImZu89,
author = {R. Impagliazzo and D. Zuckerman},
title = {How to recycle random bits},
booktitle = proc30 # focs,
year = {1989},
pages = {248--253}
}
@inproceedings{ILL89,
author = {R. Impagliazzo and L. Levin and M. Luby},
title = {Pseudo-random generation from one-way functions
(extended abstract},
booktitle = proc21 # stoc,
year = {1989},
pages = {12--24}
}
@InProceedings{ImLe90,
title = "No Better Ways to Generate Hard {NP} Instances than
Picking Uniformly at Random",
author = "R. Impagliazzo and L. Levin",
pages = "812--821",
booktitle = proc31 # focs,
volume = "II",
year = "1990",
}
@inproceedings{INW94,
author = {R. Impagliazzo and N. Nisan and A. Wigderson},
title = {Pseudorandomness for network algorithms},
booktitle = proc26 # stoc,
year = {1994},
pages = {356--364}
}
@inproceedings{Imp95,
author = {R. Impagliazzo},
title = {A personal view of average-case complexity},
booktitle = proc10 # structures,
year = {1995},
pages = {134--147}
}
@article{ImNa96,
author = {R. Impagliazzo and M. Naor},
title = {Efficient cryptographic schemes provably as secure as
subset-sum},
journal = {Journal of Cryptology},
volume = {9},
year = {1996},
pages = {199--216}
}
@misc{IPS97,
author = "Impagliazzo and Pudlak and Sgall",
title = "Lower Bounds for the Polynomial Calculus and the
Groebner Basis Algorithm",
note = "Electronic Colloquium on Computational Complexity,
technical report no.\ TR97-042",
year = "1997",
}
@inproceedings{ImWi97,
author = {R. Impagliazzo and A. Wigderson},
title = {{P = BPP} if {E} requires exponential circuits:
Derandomizing the {XOR} {L}emma},
booktitle = proc29 # stoc,
year = {1997},
pages = {220--229}
}
@inproceedings{ImWi98,
author = {R. Impagliazzo and A. Wigderson},
title = {Randomness vs. Time: De-randomization under a uniform
assumption},
booktitle = proc39 # focs,
year = {1998},
note = "to appear"
}
@misc{Imp99pc,
author = {R. Impagliazzo},
title = {Very strong one-way functions and pseudo-random generators
exist relative to a random oracle},
year = {1999},
note = "Unpublished manuscript/personal communication"
}
@article{IPZ01,
author = {R. Impagliazzo and R. Paturi and F. Zane},
title = {Which problems have strongly exponential complexity?},
journal = jcss,
year = {2001},
volume = {63},
pages = {512--530}
}
@article{IKW02,
author = {R. Impagliazzo and V. Kabanets and A. Wigderson},
title = {In search of an easy witness: exponential time versus
probabilistic polynomial time},
journal = jcss,
year = {2002},
volume = {65},
pages = {672--694}
}
@inproceedings{INR10,
author={Piotr Indyk and Hung Q. Ngo and Atri Rudra},
title={Efficiently Decodable Non-adaptive Group Testing},
booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA)},
year={2010},
pages={1126--1142}
}
@article{INR92,
author = {S. Irani and M. Naor and R. Rubinfeld},
title = {On the time and space complexity of computation using
write-once memories, or {I}s pen really much worse than pencil?},
journal = mathsys,
volume = {25},
year = {1992},
pages = {141--159}
}
@inproceedings{IsZi93,
author = {S. Istrail and D. Zivkovic},
title = {Non-probabilistic switching lemma for the {Sipser}
function},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {566--575}
}
@article{IsZi94,
author = {S. Istrail and D. Zivkovic},
title = {Bounded-width polynomial-size {B}oolean formulas
compute exactly those functions in {AC$^0$}},
journal = ipl,
volume = {50},
year = {1994},
pages = {211--216}
}
@techreport{Ist96,
author = {G. Istrate},
title = {Resource-bounded measure and autoreducibility},
institution = {Department of Computer Science,
University of Rochester},
number = {644},
year = {1996},
month = {December}
}
@inproceedings{IwMo02,
author = {K. Iwama and H. Morizumi},
title = {An explicit lower bound of $5n-o(n)$ for Boolean circuits},
booktitle = imfcs,
year = {2002},
pages = {353--364}
}
@article{IKM93,
author = {S. Iwata and T. Kasai and E. Moriya},
title = {Relations among simultaneous complexity classes of
nondeterministic and alternating {Turing} machines},
journal = {Acta Informatica},
volume = {30},
year = {1993},
pages = {267--278}
}
@inproceedings{Iwen08,
author = {Mark A. Iwen},
title = {A deterministic sub-linear time sparse fourier algorithm
via non-adaptive compressed sensing methods},
booktitle = {Proceedings of the Nineteenth Annual {ACM}-{SIAM} Symposium
on Discrete Algorithms},
year = {2008},
pages = {20-29},
ee = {http://doi.acm.org/10.1145/1347082.1347085},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@techreport{Jac77,
author = {W. Jackson},
title = {Legitimate decks},
number = {CORR 77-56},
institution = {Department of Combinatorics and Optimization},
month = {December},
year = {1977}
}
@book{Jac51,
author = {N. Jacobson},
title = {Lectures in Abstract Algebra, Vols. 1--3},
publisher = {Van Nostrand},
year = {1951}
}
@article{JVW90,
author = {F. Jaeger and D. Vertigan and D. Welsh},
title = {On the computational complexity of the {Jones} and
{Tutte} polynomials},
journal = {Math. Proc. Camb. Phil. Soc.},
volume = {108},
year = {1990},
pages = {35--53}
}
@article{JMS90,
author = {G. Jacopini and P. Mentrasti and G. Sontacchi},
title = {Reversible {T}uring machines and polynomial time
reversibly computable functions},
journal = sjdm,
volume = {3},
year = {1990},
pages = {241--254}
}
@inproceedings{JRS93,
author = {A. Jakoby and R. Reischuk and C. Schindelhauer},
title = {Malign distributions for average case circuit complexity},
booktitle = proc4 # isaac,
publisher = springer,
series = lncs,
volume = {762},
year = {1993},
pages = {628--639}
}
@misc{JaRe04,
author = {M.J. Jansen and K.W. Regan},
title = {Toward Arithmetical Lower Bounds
with Unbounded Coefficients},
year = {2004},
note = {In preparation for submission to ICALP'05}
}
@misc{JaRe04a,
author = {M.J. Jansen and K.W. Regan},
title = {Orbits and arithmetical circuit lower bounds},
year = {2004}
}
@phdthesis{Jan06,
author = {Maurice J. Jansen},
title = {Lower Bound Frontiers in Arithmetical Circuit Complexity},
school = {University at Buffalo},
year = {2006}
}
@inproceedings{JaRe07,
author = {M. Jansen and K. Regan},
title = {`Resistant' Polynomials and Stronger Lower
Bounds for Depth-Three Arithmetical Formulas},
booktitle = proc13 # "International Computing and Combinatorics
Conference (COCOON 2007), Banff, Canada",
year = {2007},
series = lncs,
volume = {4598},
pages = {470--481}
}
@misc{JaRe08a,
author = {M. Jansen and K. Regan},
title = {On determinants of constrained random {F}ourier minors},
year = {2008},
note = "Submitted to the Journal of Fourier Analysis and its
Applications"
}
@article{JaRe08b,
author = {M. Jansen and K. Regan},
title = {A Non-Linear Lower Bound for Constant Depth Arithmetical
Circuits via the Discrete Uncertainty Principle},
journal = tcs,
volume = {409},
year = {2008},
pages = {617--622}
}
@article{JPS13,
author = {C.-P. Jeannerod and C. Pernet and A. Storjohann},
title = {Rank-profile revealing {G}aussian elimination and the {CUP} matrix decomposition},
journal = {J. Symb. Comput.},
volume = {56},
year = {2013},
pages = {46--68}
}
@article{Jed83,
author = {J. Jedrzejowicz},
title = {On the enlargement of the class of regular languages
by the shuffle closure},
journal = ipl,
volume = {16},
year = {1983},
pages = {51--54}
}
@article{Jed87,
author = {J. Jedrzejowicz},
title = {Nesting of shuffle closure is important},
journal = ipl,
volume = {25},
year = {1987},
pages = {363--367}
}
@article{Jed88,
author = {J. Jedrzejowicz},
title = {Infinite hierarchy of expressions containing shuffle
closure operator},
journal = ipl,
volume = {28},
year = {1988},
pages = {33--37}
}
@article{Jed90,
author = {J. Jedrzejowicz},
title = {Infinite hierarchy of shuffle expressions over a finite
alphabet},
journal = ipl,
volume = {36},
year = {1990},
pages = {13--17}
}
@inproceedings{JMT94,
author = {B. Jenner and P. McKenzie and D. Theri{\'e}n},
title = {Logspace and logtime leaf languages},
booktitle = proc9 # structures,
year = {1994},
pages = {242--254}
}
@inproceedings{JMT98,
author = {B. Jenner and P. McKenzie and J. Tor{\'a}n},
title = {A Note on the Hardness of Tree Isomorphism},
booktitle = proc13 # ccc,
year = {1998},
pages = {nnn--nnn}
}
@article{JVV86,
author = {M. Jerrum and L. Valiant and V. Vazirani},
title = {Random generation of combinatorial structures
from a uniform distribution},
journal = tcs,
volume = {43},
year = {1986},
pages = {169--188}
}
@inproceedings{JeSi88,
author = {M. Jerrum and A. Sinclair},
title = {Conductance and the rapid mixing property for {Markov} chains:
Approximating the permanent resolved},
booktitle = proc20 # stoc,
year = {1988},
pages = {nnn--nnn}
}
@techreport{JeSi88b,
author = {M. Jerrum and A. Sinclair},
title = {Approximating the permanent},
number = {CSR-275-88},
institution = {Department of Computer Science, University of
Edinburgh},
month = {September},
year = {1988}
}
@article{JeSi89,
author = {M. Jerrum and A. Sinclair},
title = {Approximating the permanent},
journal = sicomp,
volume = {18},
year = {1989},
pages = {1149--1178}
}
@techreport{Jer90,
author = {M. Jerrum},
title = {The elusiveness of large cliques in a random graph},
institution = {Department of Computer Science, University of
Edinburgh},
month = {August},
year = {1990}
}
@article{Jer92,
author = {M. Jerrum},
title = {Large cliques elude the {M}etropolis process},
journal = {Random Structures and Algorithms},
volume = {3},
number = {4},
year = {1992},
pages = {347--362}
}
@inproceedings{JiLi93,
author = {T. Jiang and M. Li},
title = {{$K$} one-way heads cannot do string-matching},
booktitle = proc25 # stoc,
year = {1993},
pages = {62--70}
}
@misc{JiWa96,
author = {L. Wang and T. Jiang},
title = {An approximation scheme for some {S}teiner tree
problems in the plane},
year = {1996}
}
@inproceedings{JSV94,
author = {T. Jiang and J. Seiferas and P. Vit{\'a}nyi},
title = {Two heads are better than two tapes},
booktitle = proc26 # stoc,
year = {1994},
pages = {668--675},
note = {U. Rochester Comp. Sci. TR 493, March 1994}
}
@incollection{JLRR98a,
author = {T. Jiang and M. Li and B. Ravikumar and K. Regan},
title = {Chapter 25: Formal Grammars and Languages},
booktitle = {CRC Handbook on Algorithms and Theory of Computation},
editor = {M. Atallah},
publisher = crc,
year = {1998},
note = {to appear in November}
}
@incollection{JLRR98b,
author = {T. Jiang and M. Li and B. Ravikumar and K. Regan},
title = {Chapter 26: Computability},
booktitle = {CRC Handbook on Algorithms and Theory of Computation},
editor = {M. Atallah},
publisher = crc,
year = {1998},
note = {to appear in November}
}
@article{Joh74,
author = {D.S. Johnson},
title = {Approximation algorithms for combinatorial problems},
journal = jcss,
volume = {9},
year = {1974},
pages = {256--278}
}
@article{Joh87c,
author = {D.S. Johnson},
title = {The many faces of polynomial time},
journal = jalg,
volume = {8},
year = {1987},
pages = {285--303}
}
@incollection{Joh90,
author = {D.S. Johnson},
title = {A catalog of complexity classes},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {67--161}
}
@incollection{JoMcG97,
author = {D.S. Johnson and L. McGeogh},
title = {The traveling salesman problem: a case study in
local optimization},
booktitle = {Local Search in Combinatorial Optimization},
editor = {E.H.L. Aarts and J.K. Lenstra},
publisher = wiley,
address = {New York},
year = {1997}
}
@inproceedings{Joh87,
author = {J. Johnson},
title = {Single-valued finite transductions},
booktitle = proc14 # icalp,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1987},
pages = {202--211}
}
@article{Jon69,
author = {N. Jones},
title = {Context-free languages and rudimentary attributes},
journal = mst,
volume = {2},
year = {1969},
pages = {102--109},
note = {Corrigendum {\it MST\/} {\bf 11} (1978), 379--380}
}
@article{JoSe74,
author = {N. Jones and A. Selman},
title = {Turing machines and the spectra of first-order
formulas},
journal = jacm,
volume = {39},
year = {1974},
pages = {139--150}
}
@article{Jon75,
author = {N. Jones},
title = {Space-bounded reducibility among combinatorial problems},
journal = jcss,
volume = {11},
year = {1975},
pages = {68--85},
note = {Corrigendum {\it J. Comp. Sys. Sci.\/} 15:241, 1977}
}
@inproceedings{Jon93,
author = {N. Jones},
title = {Constant factors do matter},
booktitle = proc25 # stoc,
year = {1993},
pages = {602--611}
}
@inproceedings{Jon94,
author = {N. Jones},
title = {Generalizing {C}ook's transformation to imperative
stack programs},
booktitle = {Results and Trends in Theoretical Computer Science:
Cpolloquium in Honor of Arto Salomaa, Graz, Austria, June 1994},
editor = {J. Karhumaki and H. Maurer and G. Rozenberg},
series = lncs,
volume = {812},
year = {1994},
pages = {1--18}
}
@article{JoAm00,
author = {A. Ben-Amram and N. Jones},
title = {Computational Complexity via Programming Languages:
Constant Factors Do Matter},
journal = {Acta Informatica},
volume = {37},
year = {2000},
peags = {83-120}
}
@inproceedings{JoYo81,
author = {D. Joseph and P. Young},
title = {Fast Programs for Initial Segments and Polynomial Time
Computation in Weak Models of Arithmetic},
booktitle = proc13 # stoc,
year = {1981},
pages = {55--61}
}
@article{JoYo81b,
author = {D. Joseph and P. Young},
title = {Independence results in computer science?},
journal = jcss,
volume = {23},
year = {1981},
pages = {205--222},
note = {Corrigendum, {\it JCSS\/} {\bf 24} (1982)}
}
@article{Jos83,
author = {D. Joseph},
title = {Computational complexity in models of {ET}},
journal = jcss,
volume = {25},
year = {1983},
pages = {208--223}
}
@article{JoYo85,
author = {D. Joseph and P. Young},
title = {A survey of some recent results on computational complexity
in weak theories of arithmetic},
journal = {Fundamenta Informatica},
volume = {8},
year = {1985},
pages = {104--121}
}
@article{JoYo85b,
author = {D. Joseph and P. Young},
title = {Some remarks on witness functions for nonpolynomial and
noncomplete sets in {NP}},
journal = tcs,
volume = {39},
year = {1985},
pages = {nnn--nnn}
}
@incollection{JoYo90,
author = {D. Joseph and P. Young},
title = {Self-reducibility: the effects of internal
structure on computational complexity},
booktitle = {Complexity Theory Retrospective},
editor = {A. Selman},
publisher = springer,
year = {1990},
pages = {82--107}
}
@incollection{JosephYoung90,
author = {D. Joseph and P. Young},
title = {Self-reducibility: the effects of internal
structure on computational complexity},
booktitle = {Complexity Theory Retrospective},
editor = {A. Selman},
publisher = springer,
year = {1990},
pages = {82--107}
}
@ARTICLE{JoSc94,
author = "R. Jozsa and B. Schumacher",
title = "A new proof of the quantum noiseless coding theorem",
journal = "Journal of Modern Optics",
volume = "41(12)",
year = "1994",
pages = "2343-2349"
}
@misc{JoMi08,
author = {R. Jozsa and A. Miyake},
title = {Matchgates and classical simulation of quantum circuits},
year = {2008},
month = {April},
number = {arXiv:quant-ph 0804.4050}
}
@inproceedings{Joz08,
author = {R. Jozsa},
title = {Embedding classical into quantum computation},
booktitle = "Proceedings of MMICS'08",
PAGES = {43-49},
YEAR = {2008},
note = {arXiv:quant-ph 0812.4511}
}
@misc{JKMW09,
author = {R. Jozsa and B. Kraus and A. Miyake and J. Watrous},
title = {Matchgate and space-bounded computations are equivalent},
year = {2009},
howpublished = {http://arxiv.org/abs/0908.1467}
}
@INPROCEEDINGS{JKMW10,
author="R. Jozsa and B. Kraus, A. Miyake and J. Watrous",
title = " Matchgate and space-bounded quantum computations are equivalent",
booktitle = "Proceedings of the Royal Society of London",
year = "2010",
volume = "466",
series = "Series A",
pages = "809-830",
note="arXiv:0908.1467"
}
@article{JovdN14,
author = {R. Jozsa and M. van den Nest},
title = {Classical simulation complexity of extended {C}lifford circuits},
journal = {Quantum Information and Computation},
year = {2014},
volume = {14},
pages = {633--648}
}
@article{JuSa85,
author = {H. Juergensen and A. Salomaa},
title = {Syntactic monoids in the construction of systolic tree
automata},
journal = {Internat. J. Comput. Inform. Sci.},
volume = {14},
year = {1985},
pages = {35--49}
}
@inproceedings{JuLu93,
author = {D. Juedes and J. Lutz},
title = {The complexity and distribution of hard problems},
booktitle = proc34 # focs,
year = {1993},
pages = {177--185},
note = sicomp # ", to appear"
}
@inproceedings{JLL93,
author = {D. Juedes and J. Lathrop and J. Lutz},
title = {Computational depth and reducibility},
booktitle = proc20 # icalp,
series = lncs,
volume = {200},
publisher = springer,
year = {1993},
pages = {277--288},
note = tcs # ", to appear"
}
@article{JuLu95,
author = {D. Juedes and J. Lutz},
title = {Weak completeness in {E} and {E$_2$}},
journal = tcs,
volume = {143},
year = {1995},
pages = {149--158}
}
@inproceedings{Jung85,
author = {H. Jung},
title = {Depth efficient transformations of arithmetic into
{B}oolean circuits},
booktitle = proc5 # fct,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1985},
pages = {167--174}
}
@article{Jus72,
author = {J. Justesen},
title = {A class of constructive asymptotically good algebraic
codes},
journal = itit,
volume = {IT-18},
year = {1972},
month = {September},
pages = {652--656}
}
@article{JLJHH89,
author = {J. Justesen and K. Larsen and H.E. Jensen and
A. Havemose and T. Hoholdt},
title = {Construction and decoding of a class of algebraic
geometry codes},
journal = itit,
volume = {35},
number = {4},
year = {1989},
month = {July},
pages = {811--820}
}
@article{JLJH92,
author = {J. Justesen and K. Larsen and H.E. Jensen and T. Hoholdt},
title = {Fast decoding of codes from algebraic plane curves},
journal = itit,
volume = {38},
number = {1},
year = {1992},
month = {January},
pages = {111--119}
}
@article{JPRZ09,
author = {Charanjit S. Jutla and
Anindya C. Patthak and
Atri Rudra and
David Zuckerman},
title = {Testing low-degree polynomials over prime fields},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
year = {2009},
pages = {163-193},
ee = {http://dx.doi.org/10.1002/rsa.20262},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{KaCa00,
author = {V. Kabanets and J.-Y. Cai},
title = {Circuit minimization problem},
booktitle = proc32 # stoc,
year = {2000},
pages = {73--79}
}
@inproceedings{KaIm03,
author = {V. Kabanets and R. Impagliazzo},
title = {Derandomizing Polynomial Identity Testing means
proving circuit lower bounds},
booktitle = proc35 # stoc,
year = {2003}
}
@article{KaIm04,
author = {V. Kabanets and R. Impagliazzo},
title = {Derandomizing Polynomial Identity Testing means
proving circuit lower bounds},
journal = compcomp,
volume = {13},
year = {2004},
pages = {1--46}
}
@inproceedings{KaSi91,
author = {E. Kaltofen and M. Singer},
title = {Size-efficient parallel algebraic circuits for
partial derivatives},
booktitle = {Proceedings, IV International Conference on
Computer Algebra in Physical Research},
editor = {V. Shirkov and V.A. Rostovtsev and V.P. Gerdt},
publisher = {World Scientific},
year = {1991},
pages = {133--145}
}
@inproceedings{KLRS10,
author = {S. Kalyanasundaram and R. Lipton and K. Regan and
F. Shokrieh},
title = {Improved Simulation of Nondeterministic Turing Machines},
booktitle = proc35 # mfcs,
year = {2010},
pages = {453--464}
}
@ARTICLE{KaVo70,
AUTHOR = {T. Kameda and R. Vollmar},
TITLE = {Note on tape reversal complexity of languages},
JOURNAL = infcon,
VOLUME = {17},
YEAR = {1970},
PAGES = {203--215}
}
@article{Kam91,
author = {J. K{\"a}mper},
title = {Nonuniform proof systems: a new framework to describe
nonuniform and probabilistic complexity classes},
journal = tcs,
volume = {85},
year = {1991},
pages = {305--331}
}
@article{Kan82,
author = {R. Kannan},
title = {Circuit-size lower bounds and reducibility to sparse sets},
journal = infcon,
volume = {55},
year = {1982},
pages = {40--56}
}
@article{Kan84,
author = {R. Kannan},
title = {Towards separating nondeterminism from determinism},
journal = mst,
volume = {17},
year = {1984},
pages = {29--45}
}
@article{KVVY93,
author = {R. Kannan and H. Venkateswaran and V. Vinay and A. Yao},
title = {A circuit-based proof of {Toda's} theorem},
journal = infcomp,
volume = {104},
year = {1993},
pages = {271--276}
}
@inproceedings{KaCo91,
author = {B. Kapron and S. Cook},
title = {A new characterization of {Mehlhorn's} polynomial
time functionals},
booktitle = proc32 # focs,
year = {1991},
pages = {342--347}
}
@article{KaOf62,
author = {A. Karatsuba and Y. Ofman},
title = {Multiplication of multidigit numbers on automata},
journal = {Dokl. Akad. Nauk SSSR},
volume = {145},
year = {1962},
pages = {293--294},
note = {English version in Soviet Phys. Dokl., 7
(1963), pp. 595--596}
}
@article{Kar86,
author = {M. Karchmer},
title = {Two time-space tradeoffs for element distinctness},
journal = tcs,
volume = {47},
year = {1986},
pages = {237--246}
}
@book{Kar89,
author = {M. Karchmer},
title = {Communication complexity: a new approach to circuit depth},
publisher = {MIT Press},
address = {Cambridge, MA},
year = {1989}
}
@article{KaWi90,
author = {M. Karchmer and A. Wigderson},
title = {Monotone circuits for connectivity require
super-logarithmic depth},
journal = sjdm,
volume = {3},
year = {1990},
pages = {255--265}
}
@inproceedings{KRW91,
author = {M. Karchmer and R. Raz and A. Wigderson},
title = {On proving super-logarithmic lower bounds via the
direct sum in communication complexity},
booktitle = proc6 # structures,
year = {1991},
pages = {299--304}
}
@inproceedings{KKN92,
author = {M. Karchmer and E. Kushilevitz and N. Nisan},
title = {Fractional covers and communication complexity},
booktitle = proc7 # structures,
year = {1992},
pages = {262--274}
}
@inproceedings{KNSW92,
author = {M. Karchmer and I. Newman and M. Saks and A. Wigderson},
title = {Non-deterministic communication complexity with few
witnesses},
booktitle = proc7 # structures,
year = {1992},
pages = {275--281}
}
@inproceedings{KaMo94,
author = {D. Karger and R. Motwani},
title = {Derandomization through approximation: An {NC} algorithm
for minimum cuts},
booktitle = proc26 # stoc,
year = {1994},
pages = {497--506}
}
@inproceedings{KaMa94,
author = {H. Karloff and Y. Mansour},
title = {On construction of {$k$}-wise independent random variables},
booktitle = proc26 # stoc,
year = {1994},
pages = {564--573}
}
@article{Kar84,
author = {N. Karmarkar},
title = {A new polynomial-time algorithm for linear programming},
journal = {Combinatorica},
volume = {4},
year = {1984},
pages = {373--395}
}
@incollection{Karp72,
author = {R. Karp},
title = {Reducibility among combinatorial problems},
booktitle = {Complexity of Computer Computations},
editor = {R.E. Miller and J.W. Thatcher},
publisher = {Plenum Press},
year = {1972},
pages = {85--104}
}
@incollection{Karp76,
author = {R. Karp},
title = "The probabilistic analysis of some combinatorial search
algorithms",
pages = "1--19",
editor= "Traub, J.F.",
booktitle = "Algorithms and Complexity: New Directions and Recent Results",
publisher = "Academic Press",
address = "New York",
year = 1976
}
@inproceedings{KaLi80,
author = {R. Karp and R. Lipton},
title = {Some connections between uniform and nonuniform
complexity classes},
booktitle = proc12 # stoc,
year = {1980},
pages = {302--309}
}
@inproceedings{KarpLipton,
author = {R. Karp and R. Lipton},
title = {Some connections between uniform and nonuniform
complexity classes},
booktitle = proc12 # stoc,
year = {1980},
pages = {302--309}
}
@article{KaLi82,
author = {R. Karp and R. Lipton},
title = {Turing machines that take advice},
journal = {L'Enseignement Math\'ematique},
volume = {28},
year = {1982},
pages = {191--210}
}
@inproceedings{KaLu83,
author = {R. Karp and M. Luby},
title = {Monte-{C}arlo algorithms for enumeration and reliability
problems},
booktitle = proc24 # focs,
year = {1983},
pages = {56--64}
}
@article{KaLu85,
author = {R. Karp and M. Luby},
title = {Monte-{C}arlo algorithms for the planar multiterminal
network reliability problem},
journal = {J. Complexity},
volume = {1},
year = {1985},
pages = {45--64}
}
@article{KLM89,
author = {R. Karp and M. Luby and N. Madras},
title = {Monte-{C}arlo approximation algorithms for enumeration
problems},
journal = {J. Algorithms},
volume = {10},
year = {1989},
pages = {429--448}
}
@INCOLLECTION{KaRa90,
AUTHOR = {R. Karp and V. Ramachandran},
TITLE = {Parallel algorithms for shared-memory machines},
BOOKTITLE = {Handbook of Theoretical Computer Science},
VOLUME = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {871--941}
}
@article{KUW88,
author = {R. Karp and E. Upfal and A. Wigderson},
title = {The complexity of parallel search},
journal = jcss,
volume = {36},
year = {1988},
pages = {225--253}
}
@inproceedings{KaVe87,
author = {M.\ Karpinski and R.~Verbeek},
title = {Randomness, provability, and the separation of
{M}onte {C}arlo time and space},
booktitle = {Computation Theory and Logic},
series = lncs,
year = {1987},
publisher = springer,
volume = {270},
pages = {189--207}
}
@article{KaLu93,
author = {M. Karpinski and M. Luby},
title = {Approximating the number of zeroes of a GF[2] polynomial},
journal = jalg,
volume = {14},
year = {1993},
pages = {280--287}
}
@inproceedings{KaVe93,
author = {M. Karpinski and R. Verbeek},
title = {On randomized versus deterministic computation},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {227--240}
}
@article{KAI79,
author = {T. Kasai and A. Adachi and S. Iwata},
title = {Classes of pebble games and complete problems},
journal = sicomp,
volume = {8},
year = {1979},
pages = {576--586}
}
@article{KaIw93,
author = {T. Kasai and S. Iwata},
title = {Some {EXPTIME} complete problems on context-free languages},
journal = {IEICE Trans. Inf.\ Sys.},
volume = {E76-D},
year = {1993},
pages = {329--335}
}
@article{IwKa94,
author = {S. Iwata and T. Kasai},
title = {The {O}thello game on an n*n board is {PSPACE}-complete},
journal = tcs,
volume = {123},
year = {1994},
pages = {329--340}
}
@ARTICLE{KvLP88,
AUTHOR = {J. Katajainen and J. van Leeuwen and M. Penttonen},
TITLE = {Fast simulation of {Turing} machines by random access machines},
JOURNAL = sicomp,
VOLUME = {17},
YEAR = {1988},
PAGES = {77--88}
}
@article{KTV84,
author = {G. Katsman and M. Tsfasman and S. Vladut},
title = {Modular curves and codes with a polynomial construction},
journal = itit,
volume = {IT-30},
year = {1984},
pages = {353--355}
}
@article{KR04,
AUTHOR = "Tali Kaufman and Dana Ron",
TITLE = "Testing Polynomials over General Fields",
journal = "SIAM Journal on Computing",
pages="779--802",
volume="36",
number="3",
YEAR = "2006"
}
@inproceedings{KaMi94,
author = {S. Kautz and P. Miltersen},
title = {Relative to a random oracle, {NP} is not small},
booktitle = proc9 # structures,
year = {1994},
pages = {162--174}
}
@techreport{KaNi05,
author = {N. Kayal and N. Saxena},
title = {Polynomial Identity Testing for Depth 3 Circuits},
institution = eccc,
number = {ECCC TR05-150},
month = {December},
year = {2005},
}
@inproceedings{Kea93,
author = {M. Kearns},
title = {Efficient noise-tolerant learning from statistical queries},
booktitle = proc25 # stoc,
year = {1993},
pages = {392--401}
}
@inproceedings{KMRRSS94,
author = {M. Kearns and Y. Mansour and D. Ron and R. Rubinfeld
and R. Schapire and L. Sellie},
title = {On the learnability of discrete distributions},
booktitle = proc26 # stoc,
year = {1994},
pages = {273--282}
}
@book{KeVa94,
author = {M. Kearns and U. Vazirani},
title = {Introduction to Computational Learning Theory},
publisher = {M.I.T. Press},
address = {Cambridge, MA},
year = {1994}
}
@article{Kem03,
author = {J. Kempe},
title = {Quantum random walks -- an introductory overview},
journal = {Contemporary Physics},
volume = {44},
year = {2003},
pages = {307--327},
note = {Also http://arxiv.org/abs/quant-ph/0303081}
}
@article{Kha79,
author = {L. Khachiyan},
title = {A polynomial algorithm in linear programming},
journal = {Soviet Mathematics Doklady},
volume = {20},
number = {1},
year = {1979},
pages = {191--194},
note = {English translation}
}
@phdthesis{Kha93,
author = {S. Khadilkar},
title = {Mode Transitions},
school = {Department of Computer Science and Engineering,
IIT Kanpur},
month = {October},
year = {1993}
}
@inproceedings{KZR14,
author = {A.U. Khalid and Z. Zilic and K. Radecka},
title = {{FPGA} Emulation of Quantum Circuits},
booktitle = {Proceedings of the 2014 IEEE International Conference on Computer Design},
year = {2014},
pages = {310--315}
}
@article{Kho01,
author = {N. Khovanskii},
title = {Three lectures on {N}ewton polyhedra},
journal = {RIMS},
volume = {1233},
year = {2001},
pages = {1--17},
note = {Also Kyoto University, http://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/41492}
}
@article{KhVa91,
author = {S. Khuller and V. Vazirani},
title = {Planar graph colring is not self-reducible assuming
{P $\noteq$ NP}},
journal = tcs,
volume = {88},
year = {1991},
pages = {nnn--nnn}
}
@inproceedings{KiRu91,
author = {J. Kilian and R. Rubinfeld},
title = {Interactive proofs with space bounded provers},
booktitle = {Proceedings, CRYPTO '91},
series = lncs,
volume = {576},
publisher = springer,
year = {1991},
pages = {225--231}
}
@inproceedings{Kil92,
author = {J. Kilian},
title = {A note on efficient zero-knowledge proofs and arguments},
booktitle = proc24 # stoc,
year = {1992},
pages = {723--732}
}
@article{KiFi80,
author = {C. Kintala and P. Fischer},
title = {Refining nondeterminism in relativized polynomial-time
bounded computations},
journal = sicomp,
volume = {9},
year = {1980},
pages = {46--53}
}
@inproceedings{Kir88,
author = {W. Kirchherr},
title = {A hierarchy theorem for {PRAM}-based complexity classes},
booktitle = proc8 # "FSTTCS",
series = lncs,
volume = {338},
publisher = springer,
year = {1988},
pages = {240--249}
}
@article{Kir88b,
author = {W. Kirchherr},
title = {Transposition of an {$l \times l$} matrix requires
{$O(\log l)$} reversals on conservative {T}uring machines},
journal = ipl,
volume = {28},
year = {1988},
pages = {55--59}
}
@article{ KLV97,
author = "Kirchherr and Li and Vitanyi",
title = "The Miraculous Universal Distribution",
journal = "MATHINT: The Mathematical Intelligencer",
volume = "19",
year = "1997",
url = "citeseer.ist.psu.edu/kirchherr97miraculou.html"
}
@ARTICLE{Kit97,
author="A. Kitaev",
title = "Quantum computations: algorithms and error-correction",
journal = "Russian Mathematical Surveys",
year = "1997",
volume = "52(6)",
pages = "1191-1249",
}
@MISC{KSV02,
author = "A. Kitaev and A. Shen and M. Vyalyi",
title = "Classical and quantum computation",
year = "2002",
note = "American Math. Society, Extended version of a book originally published in Russian"
}
@ARTICLE{Kla90,
AUTHOR = {A. Klapper},
TITLE = {Generalized lowness and highness and probabilistic
complexity classes},
JOURNAL = mathsys,
YEAR = {1990},
VOLUME = {22},
PAGES = {37--45}
}
@INPROCEEDINGS{Klauck00,
author="H. Klauck",
title = " Quantum communication complexity",
booktitle = "27th Int'l. Colloq. on Automata, Languages, and Programming (ICALP)",
year = "2000",
pages = "241-252",
note = "[arXiv:quant-ph/0005032]",
}
@INPROCEEDINGS{Klauck03,
author="H. Klauck",
title = " Quantum time-space tradeoffs for sorting",
booktitle = "35th ACM STOC",
year = "2003",
pages = "69-76",
note = "[STOC:780542.780553, arXiv:quant-ph/0211174]",
}
@INPROCEEDINGS{KSW04,
author="H. Klauck and R. Spalek and R. de Wolf",
title = " Quantum and classical strong direct product theorems and optimal time-space tradeoffs",
booktitle = "45th IEEE FOCS",
year = "2004",
pages = "12-21",
note = "[FOCS:10.1109/FOCS.2004.52, arXiv:quant-ph/0402123]",
}
@article{Kle43,
author = {S. Kleene},
title = {Recursive predicates and quantifiers},
journal = trans-ams,
volume = {53},
year = {1943},
pages = {41--73}
}
@article{Kle76,
author = {R. Klette},
title = {Indexmengen und {E}rkennung rekursiver {F}unktionen},
journal = zml,
volume = {22},
year = {1976},
pages = {231--238}
}
@article{Kli67,
author="Allen Klinger",
title="The {V}andermonde Matrix",
journal="The American Mathematical Monthly",
volume="74",
number="5",
year="1967",
pages="571--574"
}
@article{KvM02,
author = {A. Klivans and D. van Melkebeek},
title = {Graph nonisomorphism has subexponential sized proofs unless
the polynomial time hierarchy collapses},
journal = sicomp,
year = {2002},
pages = {1501--1526}
}
@ARTICLE{KMP77,
AUTHOR = {D. Knuth and J. Morris and V. Pratt},
TITLE = {Fast pattern matching in strings},
JOURNAL = sicomp,
VOLUME = {6},
YEAR = {1977},
PAGES = {323--350}
}
@ARTICLE{Ko82,
AUTHOR = {K. Ko},
TITLE = {Some observations on the probabilistic algorithms
and {$\NP$}-hard problems},
JOURNAL = ipl,
YEAR = {1982},
VOLUME = {14},
PAGES = {39--43}
}
@article{Ko83,
author = {K. Ko},
title = {On self-reducibility and weak {P}-selectivity},
journal = jcss,
volume = {26},
year = {1983},
pages = {209--211}
}
@article{Ko83real,
author = {K. Ko},
title = {On the definitions of some complexity classes of real
numbers},
journal = mst,
volume = {16},
pages = {95--109},
year = {1983}
}
@article{KLD86,
author = {K. Ko and T. Long and D. Du},
title = {A note on one-way functions and polynomial-time
isomorphisms},
journal = tcs,
volume = {47},
year = {1986},
pages = {263--276}
}
@article{Ko87,
author = {K. Ko},
title = {On helping by robust oracle machines},
journal = tcs,
volume = {52},
year = {1987},
pages = {15--36}
}
@article{Ko89,
author = {K. Ko},
title = {Relativized polynomial time hierarchies having exactly
{$k$} levels},
journal = sicomp,
volume = {18},
year = {1989},
pages = {392--408}
}
@article{KSTT92,
author = {K. Ko and U. Sch{\"o}ning and J. Tor{\'a}n and S. Toda},
title = {Turing machines with few accepting computations
and low sets for {PP}},
journal = jcss,
volume = {44},
year = {1992},
pages = {272--286}
}
@article{Kob85,
author = {K. Kobayashi},
title = {On proving time constructibility of functions},
journal = tcs,
volume = {35},
year = {1985},
pages = {215--225}
}
@article{KSW87,
author = {J. K{\"o}bler and U. Sch{\"o}ning and K. Wagner},
title = {The difference and truth-table hierarchies of {NP}},
journal = {Theoretical Informatics and Applications},
volume = {21},
year = {1987},
pages = {419--435}
}
@inproceedings{KST92,
author = {J. K{\"o}bler and U. Sch{\"o}ning and J. Tor{\'a}n},
title = {Graph isomorphism is low for {PP}},
booktitle = proc9 # stacs,
year = {1992},
pages = {nnn--nnn}
}
@book{KST93,
author = {J. K{\"o}bler and U. Sch{\"o}ning and J. Tor{\'a}n},
title = {The Graph Isomorphism Problem},
publisher = {Birkh{\"a}user},
address = {Boston},
year = {1993}
}
@inproceedings{Kob93,
author = {J. K{\"o}bler},
title = {Locating {P}/poly optimally in the extended low hierarchy},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {28--37}
}
@inproceedings{KoTo93,
author = {J. K{\"o}bler and S. Toda},
title = {On the power of generalized {MOD}-classes},
booktitle = proc8 # structures,
year = {1993},
pages = {147--155},
note = mst # ", to appear"
}
@inproceedings{KoWa95,
author = {J. K{\"o}bler and O. Watanabe},
title = {New collapse consequence of NP having small circuits},
booktitle = proc22 # icalp,
year = {1995},
series = lncs,
volume = {944},
publisher = springer,
pages = {196--207}
}
@inproceedings{KoLi98,
author = {J. K{\"o}bler and W. Lindner},
title = {On the resource bounded measure of {P}/poly},
booktitle = proc13 # ccc,
year = {1998},
pages = {182--185}
}
@article{Koba93,
author = {K. Kobayashi},
title = {{$\Sigma_n^0$}-complete properties of programs and
{Martin-L{\"o}f} randomness},
journal = ipl,
volume = {46},
year = {1993},
pages = {nnn--nnn}
}
@misc{KPS17,
author = {D.E. Koh and M.D. Penney and R.W. Spekkens},
title = {Computing quopit {C}lifford circuit amplitudes by the sum-over-paths technique},
year = {2017},
howpublished = {https://arxiv.org/pdf/1702.03316}
}
@article{Koh17,
author = {D. Koh},
title = {Further extensions of {C}lifford circuits and their classical simulation complexities},
journal = {Quantum information and computation},
volume = {17},
year = {2017},
pages = {262--282}
}
@Article{Koi96,
title = "Hilbert's {Nullstellensatz} Is in the Polynomial
Hierarchy",
author = "Pascal Koiran",
pages = "273--286",
journal = "Journal of Complexity",
year = "1996",
month = dec,
volume = "12",
number = "4",
}
@inproceedings{KKY09,
author = {A. Kojevnikov and A. Kulikov and G. Yaroslavtsev},
title = {Finding efficient circuits using {SAT} solvers},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2009},
series = lncs,
volume = {5584},
publisher = springer,
year = {2009},
pages = {32--44}
}
@inproceedings{Kol10,
author = {A. Kolla},
title = {Spectral algorithms for unique games},
booktitle = proc25 # ccc,
year = {2010},
note = {to appear}
}
@article{Kol88,
author = {J. Koll{\'a}r},
title = {Sharp effective {N}ullstellensatz},
journal = {Journal of the AMS},
volume = {1},
year = {1988},
pages = {963--975}
}
@article{KoUs58,
author = {A. Kolmogorov and V. Uspenskii},
title = {On the definition of an algorithm},
journal = {Uspekhi Mat. Nauk},
volume = {13},
year = {1958},
pages = {3--28},
note = {English transl. in {\it Russian Math Surveys\/}
{\bf 30} (1963) 217--245}
}
@Article{Kol68,
author = "A. N. Kolmogorov",
title = "Logical basis for information theory and probability
theory",
journal = itit,
volume = "14",
pages = "662--664",
year = "1968",
}
@misc{KoPo93,
author = {S. Konyagin and C. Pomerance},
title = {On primes recognizable in deterministic polynomial time},
month = {August},
year = {1993},
note = {Moscow State Univ. and University of Georgia (Mathematics)}
}
@article{KoSi92,
author = {J. K{\"o}rner and G. Simonyi},
title = {A {S}perner-type theorem and qualitative independence},
journal = jcta,
volume = {59},
year = {1992},
pages = {90--103}
}
@INPROCEEDINGS{Kos79,
AUTHOR = {R. Kosaraju},
TITLE = {Real-time simulation of concatenable double-ended queues by
double-ended queues},
BOOKTITLE = proc11 # stoc,
YEAR = {1979},
PAGES = {346--351}
}
@inproceedings{KoDe90,
author = {S.R. Kosaraju and A. Delcher},
title = {A tree-partitioning technique with applications to
expression evaluation and term matching},
booktitle = proc31 # focs,
year = {1990},
pages = {163--172}
}
@misc{KoDe92,
author = {S.R. Kosaraju and A. Delcher},
title = {A tree-partitioning technique with applications to
expression evaluation and term matching},
month = {November},
year = {1992},
comment = {Improved, AKS-free version of Kosaraju-Delcher, FOCS 1990.}
}
@article{KoPa92,
author = {E. Koutsoupias and C. Papadimitriou},
title = {On the greedy algorithm for satisfiability},
journal = ipl,
volume = {43},
year = {1993},
pages = {53--55}
}
@article{Kow82,
author = {W. Kowalczyk},
title = {A sufficient condition for the consistency of
{P = NP} with {P}eano arithmetic},
journal = {Fundamenta Informaticae},
volume = {2},
year = {1982},
pages = {233--245}
}
@inproceedings{Kow84,
author = {W. Kowalczyk},
title = {Some connections between presentability of complexity
classes and the power of formal systems of reasoning},
booktitle = proc11 # mfcs,
year = {1984},
pages = {364--368}
}
@article{Koz80,
author = {D. Kozen},
title = {Indexings of subrecursive classes},
journal = tcs,
volume = {11},
year = {1980},
pages = {277--301}
}
@article{KrPu89,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k},
title = {Propositional proof systems, the consistency of
first-order theories, and the complexity of computations},
journal = jsl,
volume = {54},
year = {1989},
pages = {1063--1079}
}
@article{KrPu90,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k},
title = {Quantified propositional logic and fragments of bounded
arithmetic},
journal = zml,
volume = {36},
year = {1990},
pages = {29--46}
}
@inproceedings{KrPu90b,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k},
title = {Propositional provability and models of weak arithmetic},
booktitle = proc3 # "Symposium on Computer Science Logic",
publisher = springer,
year = {1990}
}
@inproceedings{KPS90},
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k and J. Sgall},
title = {Interactive computations of optimal solutions},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {48--60}
}
@article{KPT91,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k and G. Takeuti},
title = {Bounded arithmetic and the polynomial hierarchy},
journal = {Annals of Pure and Applied Logic},
volume = {52},
year = {1991},
pages = {143--153}
}
@misc{KPW91,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k and A. Wood},
title = {Exponential lower bound to the size of bounded depth
{F}rege proofs of the pigeonhole principle},
year = {1991},
note = {Typeset manuscript, to appear in the journal
{\it Random Structures and Algorithms\/}}
}
@misc{Kra93,
author = {J. Kraj{\'\i\v{c}}ek},
title = {On {F}rege and extended {F}rege proof systems},
year = {1993},
note = {Typeset manuscript}
}
@article{Kra94,
Author = {J. Kraj{\'\i\v{c}}ek},
Title = {Lower Bounds to the Size of Constant-Depth {F}rege Proofs},
Journal = jsl,
Volume = {59},
Year = {1994},
Pages = {587-598}
}
@article{Kar88,
author = {M. Krause},
title = {Exponential lower bounds on the complexity
of real-time and local branching programs},
journal = {J. Inform. Process. Cybernet.},
volume = {24},
number = {3},
year = {1988},
pages = {nnn--nnn}
}
@INPROCEEDINGS{KMW89,
AUTHOR = {M. Krause and C. Meinel and S. Waack},
TITLE = {Separating complexity classes related to certain input-oblivious
logarithmic space-bounded {Turing} machines},
BOOKTITLE = proc4 # structures,
YEAR = {1989},
PAGES = {240--249}
}
@inproceedings{Kra90,
author = {M. Krause},
title = {Separating {$\oplus$}L from L, NL, co-NL, and AL
for oblivious {T}uring machines of linear access time},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {}
}
@article{Kra91,
author = {M. Krause},
title = {Lower bounds for depth-restricted branching programs},
journal = infcomp,
volume = {91},
year = {1991},
pages = {1--14}
}
@article{KrWa91,
author = {M. Krause and S. Waack},
title = {On oblivious branching programs of linear length},
journal = infcomp,
volume = {94},
year = {1991},
pages = {232--249}
}
@inproceedings{Kre86,
author = {M. Krentel},
title = {The complexity of optimization problems},
booktitle = proc18 # stoc,
year = {1986},
pages = {69--76}
}
@article{Kre88,
author = {M. Krentel},
title = {The complexity of optimization problems},
journal = jcss,
volume = {36},
year = {1988},
pages = {490--509}
}
@inproceedings{Kre89,
author = {M. Krentel},
title = {Structure of locally optimal solutions},
booktitle = proc30 # focs,
year = {1989},
pages = {216--221}
}
@srticle{Kre90,
author = {M. Krentel},
title = {On finding locally optimal solutions},
journal = sicomp,
volume = {19},
year = {1990},
pages = {742--749}
}
@article{Kri94,
author = {R. Krichevsky},
title = {Occam's {R}azor, partially specified {B}oolean functions,
string matching, and independent sets},
journal = infcomp,
volume = {108},
year = {1994},
pages = {158--174}
}
@article{KrRh65,
author = {K. Krohn and J. Rhodes},
title = {Algebraic theory of machines. {I}. Prime
decomposition theorem for finite semigroups and machines},
journal = trans-ams,
volume = {116},
year = {1965},
pages = {450--464}
}
@incollection{KRT68,
author = {K. Krohn and J. Rhodes and B. Tilson},
title = {The prime decomposition theorem of the
algebraic theory of machines},
booktitle = {Algebraic Theory of Machines, Languages,
and Semigroups},
editor = {M. Arbib},
publisher = {Academic Press},
year = {1968},
note = {Ch. 5; see also chs. 4 and 6--9}
}
@article{KRS85,
author = {C. Kruskal and L. Rudolph and M. Snir},
title = {The power of parallel prefix},
journal = {IEEE Transactions on Computers},
volume = {C--34},
year = {1985},
pages = {965--968}
}
@article{KRS90,
author = {C. Kruskal and L. Rudolph and M. Snir},
title = {A complexity theory of efficient parallel algorithms},
journal = tcs,
volume = {71},
year = {1990},
pages = {95--132}
}
@article{KRS91,
author = {C. Kruskal and L. Rudolph and M. Snir},
title = {Efficient parallel algorithms for graph problems},
journal = {Algorithmica},
volume = {5},
year = {1990},
pages = {43--64}
}
@inproceedings{KuSi95,
author = {S. Ravi Kumar and D. Sivakumar},
title = {On self-testing without the generator bottleneck},
booktitle = proc15 # fsttcs,
year = {1995},
series = lncs,
volume = {1026},
publisher = springer,
pages = {248--262}
}
@inproceedings{KuSi96,
author = {S. Ravi Kumar and D. Sivakumar},
title = {Efficient self-testing/self-correction of linear
recurrences},
booktitle = proc37 # focs,
year = {1996},
pages = {602--611}
}
@article{Kum89,
author = {G. Kumicakova--Jiraskova},
title = {Chomsky hierarchy and communication complexity},
journal = {J. Inf. Process. Cybern. EIK},
volume = {25},
year = {1989},
pages = {157--164}
}
@techreport{KuSt91,
author = {M. Kummer and F. Stephan},
title = {Some aspects of frequency computation},
institution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r
Informatik},
number = {21/91},
month = {October},
year = {1991}
}
@article{Kung88},
author = {H. Kung},
title = {Computational models for parallel computers},
journal = {Phil. Trans. R. Soc. Lond. A},
volume = {326},
year = {1988},
pages = {357--371}
}
@inproceedings{KuLe78,
author = {H. Kung and C. Leiserson},
title = {Systolic arrays (for {VLSI})},
booktitle = {Sparse Matrix Proceedings},
publisher = {SIAM},
year = {1978},
pages = {256--282}
}
@article{KOR87,
author = {S. Kurtz and M. O{'Donnell} and J. Royer},
title = {How to prove representation-independent independence
results},
journal = ipl,
volume = {24},
year = {1987},
pages = {5--10}
}
@techreport{Kur88,
author = {S. Kurtz},
title = {The isomorphism conjecture fails relative to
a generic oracle},
institution = {Department of Computer Science, University of Chicago},
number = {88-018},
year = {1988},
note = tcs # ", to appear"
}
@article{KMR88,
author = {S. Kurtz and S. Mahaney and J. Royer},
title = {Collapsing degrees},
journal = jcss,
volume = {37},
year = {1988},
pages = {247--268}
}
@inproceedings{KMR89,
author = {S. Kurtz and S. Mahaney and J. Royer},
title = {The {I}somorphism {C}onjecture fails relative
to a random oracle},
booktitle = proc21 # stoc,
year = {1989},
pages = {157--166}
}
@incollection{KMRS97,
author = {S. Kurtz and S. Mahaney and J. Royer and J. Simon},
title = {Biological computing},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
pages = {179--195}
}
@article{KuFr90,
author = {B. Kuszmaul and J. Fried},
title = {{NAP (No ALU Processor)}: The great communicator},
journal = jpdc,
volume = {8},
year = {1990},
pages = {169--179}
}
@ARTICLE{Kut91,
AUTHOR = {M. Kutylowski},
TITLE = {Multihead one--way finite automata},
JOURNAL = tcs,
VOLUME = {85},
YEAR = {1991},
PAGES = {135--153}
}
@article{Kut91b,
author = {M. Kutylowski},
title = {Time complexity of {Boolean} functions on {CREW} {PRAMs}},
journal = sicomp,
volume = {20},
year = {1991},
pages = {824--833}
}
@article{Kut93,
author = {M. Kutylowski},
title = {Stack versus sensitivity for one-way automata},
journal = tcs,
volume = {119},
year = {1993},
pages = {233--245}
}
@article{Kwo89a,
author = {Y.H.H. Kwong},
title = {Minimum periods of {$S(n,k)$} modulo {$m$}},
journal = {Fibonacci Quarterly},
volume = {27},
year = {1989},
pages = {217--221}
}
@article{Kwo89b,
author = {Y.H.H. Kwong},
title = {Minimum periods of binomial coefficients modulo {$m$}},
ournal = {Fibonacci Quarterly},
volume = {27},
year = {1989},
pages = {348--351}
}
@article{Kwo89c,
author = {Y.H.H. Kwong},
title = {Periodicities of a class of infinite integer sequences
modulo {$m$}},
journal = {Journal of Number Theory},
volume = {31},
year = {1989},
pages = {64--79}
}
@article{Lad75,
author = {R. Ladner},
title = {On the structure of polynomial-time reducibility},
journal = jacm,
volume = {22},
year = {1975},
pages = {155--171}
}
@article{Lad75b,
author = {R. Ladner},
title = {The circuit value problem is log-space complete for {P}},
journal = {SIGACT News},
volume = {7},
year = {1975},
pages = {18--20}
}
@article{Lad77,
author = {R. Ladner},
title = {The computational complexity of provability in systems
of modal propositional logic},
journal = sicomp,
volume = {6},
year = {1977},
pages = {467--480}
}
@article{Lad77b,
author = {R. Ladner},
title = {Application of model-theoretic games to discrete linear
orders and finite automata},
journal = infcon,
volume = {33},
year = {1977},
pages = {281--303},
}
@article{LLS75,
author = "R. Ladner and N. Lynch and A. Selman",
title = "A comparison of polynomial time reducibilities",
journal = tcs,
year = "1975",
volume = "1",
pages = "103--123"
}
@article{LaLy76,
author = {R. Ladner and N. Lynch},
title = {Relativization of questions about log-space
computability},
journal = mathsys,
volume = {10},
year = {1976},
pages = {19--32}
}
@ARTICLE{LaFi80,
AUTHOR = {R. Ladner and M. Fischer},
TITLE = {Parallel prefix computation},
JOURNAL = jacm,
VOLUME = {27},
YEAR = {1980},
PAGES = {831--838}
}
@book{Lak95,
author = {John Lakos},
title = {Large-Scale Software Design in C++},
publisher = wiley,
year = {1995}
}
@article{LaRo72,
author = {L. Landweber and E. Robertson},
title = {Recursive properties of abstract complexity classes},
journal = jacm,
volume = {19},
year = {1972},
pages = {286--308}
}
@article{LLR81,
author = {L. Landweber and R. Lipton and E. Robertson},
title = {On the structure of sets in {NP} and other
complexity classes},
journal = tcs,
volume = {15},
year = {1981},
pages = {181--200}
}
@inproceedings{LaNi93,
author = {K. Lange and R. Niedermeier},
title = {Data-independences of parallel random access machines},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {104--113}
}
@inproceedings{LaRo94,
author = {K.-J. Lange and P. Rossmanith},
title = {Unambiguous Polynomial Hierarchies and Exponential Size},
booktitle = proc9 # structures,
year = {1994},
pages = {106--117}
}
@inproceedings{LaSh91,
author = {D. Lapidot and A. Shamir},
title = {A one-round, two-prover, zero-knowledge protocol for NP},
booktitle = {Proceedings, CRYPTO '91},
series = lncs,
volume = {576},
publisher = springer,
year = {1991},
pages = {213--224}
}
@misc{Lap94,
author = {S. Laplante},
title = {A {K}olmogorov complexity proof of {H}astad's
switching lemma: an exposition},
month = {March},
year = {1994},
note = {Computer Science, University of Chicago}
}
@article{LLS06,
author = {S. Laplante and T. Lee and M. Szegedy},
title = {The quantum adversary method and formula size lower bounds},
journal = compcomp,
volume = {15},
year = {2006},
pages = {163--196}
}
@misc{LaSw98,
author = {R. Laubenbacher and I. Swanson},
title = {Permanental Ideals},
year = {1998},
note = {Submitted for publication}
}
@ARTICLE{Lau83,
AUTHOR = {C. Lautemann},
TITLE = {{BPP} and the polynomial hierarchy},
JOURNAL = ipl,
YEAR = {1983},
VOLUME = {17},
PAGES = {215--217}
}
@article{LKH16,
author = {Y.H. Lee and M. Khalil-Hani and M.N. Marsono},
title = {An {FPGA}-Based Quantum Computing Emulation Framework Based on Serial-Parallel Architecture},
journal = {Journal of Reconfigurable Computing},
volume = {2016},
year = {2016},
pages = {18 pages}
}
@article{Lgh85,
author = {T. Leighton},
title = {Tight bounds on the complexity of parallel sorting},
journal = {IEEE Transactions on Computers},
volume = {C-34},
year = {1985},
pages = {344--354}
}
@article{LeMa88,
author = {C. Leiserson and B. Maggs},
title = {Communication-efficient parallel algorithms for
distributed random-access machines},
journal = {Algorithmica},
volume = {3},
year = {1988},
pages = {53--77}
}
@article{Lei82,
author = {D. Leivant},
title = {Unprovability of theorems of complexity theory in weak
number theories},
journal = tcs,
volume = {18},
year = {1982},
pages = {259--268}
}
@ARTICLE{Lei85,
AUTHOR = {D. Leivant},
TITLE = {Syntactic translations and provably recursive functions},
JOURNAL = jsl,
VOLUME = {50},
YEAR = {1985},
PAGES = {682--687}
}
@incollection{Lei85b,
author = {D. Leivant},
title = {Intuitionistic formal systems},
booktitle = {Harvey Friedman's Research on the Foundations
of Mathematics},
editor = {L. Harrington et~al.},
publisher = {Elsevier},
year = {1985},
pages = {231--255}
}
@article{Lei89,
author = {D. Leivant},
title = {Descriptive characterizations of computational complexity},
journal = jcss,
volume = {39},
year = {1989},
pages = {51--83}
}
@techreport{Lei89b,
author = {D. Leivant},
title = {Monotone use of space and computational complexity over
abstract structures},
institution = {Carnegie-Mellon University, Computer Science Department},
number = {CMU-CS-89-212},
year = {1989}
}
@incollection{Lei90,
author = {D. Leivant},
title = {Contracting proofs to programs},
booktitle = {Logic and Computer Science},
editor = {P. Odifreddi},
publisher = {Academic Press},
year = {1990},
pages = {279--327}
}
@incollection{Lei90b,
author = {D. Leivant},
title = {Subrecursion and lambda representation over free algebras
(preliminary summary)},
booktitle = {Feasible Mathematics},
editor = {S. Buss and P. Scott},
series = {Perspectives in Computer Science},
publisher = {Birkh{\"a}user},
year = {1990},
pages = {281--291}
}
@inproceedings{Lei91,
author = {D. Leivant},
title = {A foundational delineation of computational feasibility},
booktitle = proc6 # lics,
year = {1991}
}
@techreport{Lei92,
author = {D. Leivant},
title = {A foundational delineation of polynomial time},
institution = {Indiana University Logic Group},
number = {Preprint No. IULG--92--nn},
year = {1992},
note = infcon # ", to appear"
}
@techreport{Lei92b,
author = {D. Leivant},
title = {Peano theories and their computable functions},
number = {nnn},
institution = {Computer Science, Indiana University},
address = {Bloomington, IN 47405},
month = {December},
year = {1992}
}
@article{Lem75,
author = {A. Lempel},
title = {Matrix factorization over {GF}(2) and trace-orthogonal bases of {GF}({$2^n$})},
journal = sicomp,
year = {1975},
volume = {4},
pages = {175--186}
}
@article{LeTa82,
author = {T. Lengauer and R. Tarjan},
title = {Asymptotically tight bounds on time-space tradeoffs
in a pebble game},
journal = jacm,
volume = {29},
year = {1982},
pages = {1087--1130}
}
@article{Len91,
author = {H.W. Lenstra},
title = {Finding isomorphisms between finite fields},
journal = {Mathematics of Computation},
volume = {56},
year = {1991},
pages = {329--347}
}
@ARTICLE{LeSe81,
AUTHOR = {B. Leong and J. Seiferas},
TITLE = {New real-time simulations of multihead tape units},
JOURNAL = jacm,
VOLUME = {28},
YEAR = {1981},
PAGES = {166--180}
}
@article{Leo91,
author = {C. Leopold},
title = {Reading data in a hierarchical memory},
journal = {J. Inf. Proc. Cybernet.},
volume = {EIK 27},
year = {1991},
pages = {207--216}
}
@article{LTWYC90,
author = {J. Leung and T. Tam and C. Wong and G. Young and F. Chin},
title = {Packing squares into a square},
journal = jpdc,
volume = {10},
year = {1990},
pages = {271--275}
}
@article{LPV81,
author = {G.F. Lev and N. Pippenger and L. Valiant},
title = {A fast parallel algorithm for routing in permutation
networks},
journal = {IEEE Transactions on Computers},
volume = {C-30},
month = {February},
year = {1981},
pages = {93--100}
}
@article{Lev73,
author = {L. Levin},
title = {Universal sequential search problems},
journal = {Problems of Information Transmission},
volume = {9},
year = {1973},
pages = {265--266}
}
@incollection{Lev74,
author = {L. Levin},
title = {Complexity of algorithms and computations},
editor = {Kosmidiadi and Maslov and Petri},
booktitle = {""},
publisher = {Mir},
year = {1974},
pages = {174--185},
note = {In Russian. An English revision by Levin of part of the paper
is available as BUCS-TR-85-005, Boston University Computer Science
Department, 1985}
}
@techreport{Lev80,
author = {L. Levin},
title = {A concept of independence with applications in various
fields of mathematics},
institution = {MIT Laboratory for Computer Science},
number = {MIT/LCS/TR-235},
year = {1980}
}
@InProceedings{Lev84,
author = "L. Levin",
title = "Problems, Complete in {"}Average{"} Instance",
pages = "465--465",
booktitle = proc25 # stoc,
year = "1984",
}
@techreport{Lev85,
author = {L. Levin},
title = {Computational complexity of functions},
institution = {Boston University, Computer Science Department},
number = {BUCS-TR-85-005},
year = {1985},
note = {English update by Levin of part of his Russian article
``Complexity of algorithms and computations,'' Kosmidiadi, Maslov, and Petri,
eds., {\it Mir\/}, 1974, pp~174--185.}
}
@article{Lev96,
title = "Computational complexity of functions",
author = "Leonid A. Levin",
pages = "267--271",
journal = tcs,
year = "1996",
volume = "157",
number = "2"
}
@article{Lew79,
author = {J. Lew},
title = {Polynomial enumeration of multidimensional lattices},
journal = mathsys,
volume = {12},
year = {1979},
pages = {253--270}
}
@article{LMS93,
author = {J. Lew and L. Morales and A. Sanchez-Flores},
title = {Diagonal polynomials for small dimensions},
journal = mathsys,
year = {1993},
volume = {nn},
note = {To appear}
}
@article{Lew71,
author = {F. Lewis},
title = {Classes of recursive functions and their index sets},
journal = zml,
volume = {17},
year = {1971},
pages = {291--294}
}
@inproceedings{LSH65,
author = {P. L{ewis II} and R. Stearns and J. Hartmanis},
title = {Memory bounds for recognition of context-free and
context-sensitive languages},
booktitle = {Proceedings, Sixth Annual IEEE Symposium on
Switching Circuit Theory and Logical Design (now FOCS)},
year = {1965},
pages = {191--202}
}
@article{LiYe86,
author = {M. Li and Y. Yesha},
title = {String-matching cannot be done by a {2-head} {1-way}
deterministic finite automata},
journal = ipl,
volume = {22},
year = {1986},
pages = {231--235}
}
@article{LiVi88,
author = {M. Li and P. Vit{\'a}nyi},
title = {Tape versus queue and stacks: the lower bounds},
journal = infcomp,
volume = {78},
year = {1988},
pages = {56--85}
}
@INCOLLECTION{LiVi90,
AUTHOR = {M. Li and P. Vit{\'a}nyi},
TITLE = {Applications of {Kolmogorov} complexity in the theory of
computation},
BOOKTITLE = {Complexity Theory Retrospective},
EDITOR = {A. Selman},
PUBLISHER = springer,
YEAR = {1990},
PAGES = {147--203}
}
@article{LiVi91,
author = {M. Li and P. Vitanyi},
title = {Learning simple concepts under simple distributions},
journal = sicomp,
volume = {20},
year = {1991},
pages = {911--935}
}
@article{LLV92,
author = {M. Li and L. Longpr{\'e} and P. Vit{\'a}nyi},
title = {The power of the queue},
journal = sicomp,
volume = {21},
year = {1992},
pages = {697--712}
}
@article{LiVi92,
author = {M. Li and P. Vit{\'a}nyi},
title = {Average case complexity under the universal distribution
equals worst-case complexity},
journal = ipl,
volume = {42},
year = {1992},
pages = {145--149}
}
@inproceedings{LiVi92p,
author = {M. Li and P. Vit{\'a}nyi},
title = {Philosophical issues in {K}olmogorov complexity},
booktitle = proc19 # icalp,
series = lncs,
publisher = springer,
volume = {623},
year = {1992},
pages = {nnn--nnn}
}
@book{LV93,
author = {M. Li and P. Vit{\'a}nyi},
title = {An Introduction to Kolmogorov Complexity and its
Applications},
publisher = springer,
year = {1993}
}
@book{LV08,
author = {M. Li and P. Vit{\'a}nyi},
title = {An Introduction to Kolmogorov Complexity and its
Applications, Third Edition},
publisher = springer,
year = {2008}
}
@book{LN86,
author = {R. Lidl and H. Niederreiter},
title = {Introduction to Finite Fields and Their Applications},
publisher = {Cambridge University Press},
year = {1986}
}
@article{LiPi94,
author = {G. Lin and N. Pippenger},
title = {Parallel algorithms for routing in nonblocking networks},
journal = mathsys,
volume = {27},
year = {1994},
pages = {29--40}
}
@inproceedings{LLSZ93,
author = {N. Linial and M. Luby and M. Saks and D. Zuckerman},
title = {Efficient construction of a small hitting set for
combinatorial rectangles in high dimension},
booktitle = proc25 # stoc,
year = {1993},
pages = {258--267}
}
@article{LLR95,
author = {N.~Linial and E.~London and Y.~Rabinovich},
title = {The geometry of graphs and some of its algorithmic
applications},
journal = {Combinatorica},
volume = {15},
year = {1995}
}
@article{Lin92,
author = {S. Lindell},
title = {The invariant problem for binary string structures and the
parallel complexity theory of queries},
journal = jcss,
volume = {44},
year = {1992},
pages = {385--410}
}
@inproceedings{Lin92b,
author = {S. Lindell},
title = {A purely logical characterization of circuit uniformity},
booktitle = proc7 # structures,
year = {1992},
pages = {185--192}
}
@misc{Lin94,
author = {S. Lindell},
title = {How to define exponentiation from addition and multiplication
in first-order logic on finite structures},
note = {Unpublished manuscript. The main result will appear
in a forthcoming text by N.~Immerman, {\it Descriptive and
Computational Complexity\/}, in the Springer Verlag ``Graduate Texts in
Computer Science'' series},
year = {1994}
}
@inproceedings{LSW98,
author = {W. Lindner and R. Schuler and O. Watanabe},
title = {Resource bounded measure and learnability},
booktitle = proc13 # ccc,
year = {1998},
pages = {261--270}
}
@incollection{Lin93,
author = {N. Linial},
title = {Local-global phenomena in graphs},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {491--503}
}
@article{LiZa77,
author = {R. Lipton and Y. Zalcstein},
title = {Word problems solvable in logspace},
journal = jacm,
volume = {24},
year = {1977},
pages = {522--526}
}
@inproceedings{Lip78,
author = {R. Lipton},
title = {Model-theoretic aspects of computational complexity},
booktitle = proc19 # focs,
year = {1978},
pages = {191--200}
}
@article{LiTa79,
author = {R. Lipton and R. Tarjan},
title = {A separator theorem for planar graphs},
journal = {SIAM J. Appl. Math.},
volume = {36},
year = {1979},
pages = {177--189}
}
@article{LiTa80,
author = {R. Lipton and R. Tarjan},
title = {Applications of a planar separator theorem},
journal = sicomp,
volume = {9},
year = {1980},
pages = {615--627}
}
@incollection{Lip91,
author = {R. Lipton},
title = {New directions in testing},
booktitle = {Distributed Computing and Cryptography},
publisher = ams,
year = {1991},
pages = {191--202}
}
@inproceedings{Lip94,
author = {R. Lipton},
title = {A new approach to information theory},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {699--708}
}
@inproceedings{LiYo94,
author = {R. Lipton and N. Young},
title = {Simple strategies for large zero-sum games, with
applications to complexity theory},
booktitle = proc26 # stoc,
year = {1994},
pages = {734--740}
}
@inproceedings{Lip94b,
author = {R. Lipton},
title = {Some consequences of our failure to prove non-linear
lower bounds on explicit functions},
booktitle = proc9 # structures,
year = {1994},
pages = {79--87}
}
@inproceedings{Lip94c,
author = {R. Lipton},
title = {Straight-line complexity and integer factorization},
booktitle = {Algorithmic Number Theory (ANTS'94)},
publisher = springer,
series = lncs,
volume = {877},
year = {1994},
pages = {71--79}
}
@inproceedings{LiVi99,
author = {R. Lipton and A. Viglas},
title = {On the complexity of {SAT}},
booktitle = proc40 # focs,
year = {1999},
pages = {459--464}
}
@misc{LRR10,
author = {R. Lipton and K. Regan and A. Rudra},
title = {Equivalences to Symmetric Polynomials},
year = {2010},
note = {Draft, in preparation}
}
@misc{LiReGLL10a,
author = {R. Lipton and K. Regan},
title = {An approach to {P=NP} via descriptive complexity},
year = {2010},
month = {January},
day = {5},
howpublished = {http://rjlipton.wordpress.com/2010/01/05/an-approach-to-pnp-via-descriptive-complexity/}
}
@misc{LiReGLL10p,
author = {R. Lipton and K. Regan},
title = {Lower bounds and progressive algorithms},
year = {2010},
month = {August},
day = {28},
howpublished =
{http://rjlipton.wordpress.com/2010/08/28/lower-bounds-and-progressive-algorithms/}
}
@misc{LiRe11fc,
author = {R. Lipton and K. Regan},
title = {A Finite-Compactness Notion, and Property Testing
(extended abstract)},
year = {2011},
note = {Presented at LCC Workshop, 6/25/11, University of Toronto}
}
@inproceedings{LRR11,
author = {R. Lipton and K. Regan and A. Rudra},
title = {Symmetric functions capture general functions},
booktitle = proc36 # mfcs,
year = {2011}
}
@misc{LiReGLL12p,
author = {R. Lipton and K. Regan},
title = {Progress on Progressive Algorithms},
year = {2012},
month = {November},
day = {17},
howpublished = {https://rjlipton.wordpress.com/2012/11/17/progress-on-progressive-algorithms/}
}
@book{LR14,
author = {R. Lipton and K. Regan},
title = {Quantum Algorithms via Linear Algebra},
publisher = {MIT Press},
year = {2014}
}
@misc{LRR15,
author = {Richard Lipton and Kenneth Regan and Atri Rudra},
title = {New Conditional Separation Theorems},
year = {2015}
}
@article{Lis93,
author = {M. Li{\'s}kiewicz},
title = {On the relationship between deterministic time and
deterministic reversal},
journal = ipl,
volume = {45},
year = {1993},
pages = {143--146}
}
@inproceedings{LiRe93,
author = {M. Li{\'s}kiewicz and R. Reischuk},
title = {Separating the lower levels of the sublogarithmic space
hierarchy},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {16--27}
}
@article{LiRe06,
author = {H. Liu and K. Regan},
title = {Improved construction for universality of determinant and
permanent},
journal = ipl,
year = {2006},
volume = {100},
pages = {233--237}
}
@article{LWZ90,
author = {H.-N. Liu and C. Wrathall and K. Zeger},
title = {Efficient solution of some problems in free partially
commutative monoids},
journal = infcomp,
volume = {1989},
year = {1990},
pages = {180--198}
}
@ARTICLE{Llo95,
author = "S. Lloyd",
title = "Almost any quantum logic gate is universal",
journal = "Physical Review Letters",
volume = "75(2)",
year = "1995",
pages = "346-349"
}
@inproceedings{Lok95,
author = {S. Lokam},
title = {Spectral Methods for Matrix Rigidity with Applications
to Size-Depth Tradeoffs and Communication Complexity},
booktitle = proc36 # focs,
year = {1995},
pages = {6--15}
}
@article{Lok01,
author = {S. Lokam},
title = {Spectral Methods for Matrix Rigidity with Applications
to Size-Depth Tradeoffs and Communication Complexity},
journal = jcss,
volume = {63},
year = {2001}
}
@article{Long81,
author = {T. Long},
title = {On {$\gamma$}-reducibility versus polynomial time
many-one reducibility},
journal = tcs,
volume = {14},
year = {1981},
pages = {nnn--nnn}
}
@ARTICLE{Long82,
AUTHOR = {T. Long},
TITLE = {Strong nondeterministic polynomial reducibilities},
JOURNAL = tcs,
YEAR = {1982},
VOLUME = {21},
PAGES = {1--25}
}
@article{Long82b,
AUTHOR = {T. Long},
TITLE = {A note on sparse oracles for {NP}},
journal = jcss,
volume = {24},
year = {1982},
pages = {380--389}
}
@article{Long85,
author = {T. Long},
title = {On restricting the size of oracles compared with
restricting access to oracles},
journal = sicomp,
volume = {14},
year = {1985},
pages = {585--597}
}
@article{LoSe93,
author = {L. Longpr{\'e} and A. Selman},
title = {Hard promise problems and nonuniform complexity},
journal = tcs,
volume = {115},
year = {1993},
pages = {277--290}
}
@article{LoWa95,
author = {L. Longpr{\'e} and O. Watanabe},
title = {On the symmetry of information and polynomial time
invertibility},
journal = infcon,
volume = {121},
year = {1995},
pages = {14--22}
}
@article{Loui80,
author = {M. Loui},
title = {A note on the pebble game},
journal = ipl,
volume = {11},
year = {1980},
pages = {24--26}
}
@ARTICLE{Loui82,
AUTHOR = {M. Loui},
TITLE = {Simulations among multidimensional {Turing} machines},
JOURNAL = tcs,
VOLUME = {21},
YEAR = {1981},
PAGES = {145--161}
}
@ARTICLE{Loui83,
AUTHOR = {M. Loui},
TITLE = {Optimal dynamic embedding of trees into arrays},
JOURNAL = sicomp,
VOLUME = {12},
YEAR = {1983},
PAGES = {463--472}
}
@ARTICLE{Loui84,
AUTHOR = {M. Loui},
TITLE = {Minimizing access pointers into trees and arrays},
JOURNAL = jcss,
VOLUME = {28},
YEAR = {1984},
PAGES = {359--378}
}
@article{LMW86,
author = {M. Loui and T. Matsushita and D. West},
title = {Election in a complete network with a sense of direction},
journal = ipl,
volume = {22},
year = {1986},
pages = {185--187},
note = {Corrigendum: {\it IPL\/} {\bf 28} (1988), p327}
}
@ARTICLE{LoLu91,
AUTHOR = {M. Loui and D. Luginbuhl},
TITLE = {The complexity of on-line simulation between multidimensional
{Turing} machines and random-access machines},
JOURNAL = mathsys,
VOLUME = {25},
YEAR = {1992},
PAGES = {293--308}
}
@ARTICLE{LoLu92,
AUTHOR = {M. Loui and D. Luginbuhl},
TITLE = {Optimal on-line simulations of tree machines by random access
machines},
JOURNAL = sicomp,
VOLUME = {21},
YEAR = {1992},
PAGES = {959--971}
}
@article{LoPo92,
author = {A. Louri and A. Post},
title = {Complexity analysis of optical-computing paradigms},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5568--5583}
}
@Article{Lov69,
title = "A Variant of the {Kolmogorov} Concept of Complexity",
author = "D. W. Loveland",
pages = "510--526",
journal = infcon,
year = "1969",
volume = "15",
}
@inproceedings{Lu98,
author = {Chi-Jen Lu},
title = {An Exact Characterization of Symmetric Functions in
{$q$AC$^0[2]$}},
booktitle = proc4 # cocoon,
year = {1998},
pages = {167--173}
}
@article{LSZ93,
author = {M. Luby and A. Sinclair and D. Zuckerman},
title = {Optimal speedup of {L}as {V}egas algorithms},
journal = ipl,
volume = {47},
year = {1993},
pages = {173--180}
}
@inproceedings{LuPa89,
author = {F. Luccio and L. Pagli},
title = {A model of sequential computation based on a pipelined
access to memory},
booktitle = proc27 # "Annual Allerton Conference on Communication, Control, and Computing",
year = {1989},
pages = {}
}
@article{LuPa93,
author = {F. Luccio and L. Pagli},
title = {A model of sequential computation with pipelined access
to memory},
journal = mst,
volume = {26},
year = {1993},
pages = {343--356}
}
@article{Luc91,
author = {H. Luckhardt},
title = {New formally undecidable propositions: non-trivial lower
bounds on proof complexity and related theorems},
journal = tcs,
volume = {83},
year = {1991},
pages = {169--188}
}
@article{LuLo93,
author = {D. Luginbuhl and M. Loui},
title = {Hierarchies and space measures for pointer machines},
journal = infcomp,
volume = {104},
year = {1993},
pages = {253--270}
}
@article{LFKN92,
author = {C. Lund and L. Fortnow and H. Karloff and N. Nisan},
title = {Algebraic methods for interactive proof systems},
journal = jacm,
volume = {39},
year = {1992},
pages = {859--868}
}
@article{LuYa94,
author = {C. Lund and M. Yannakakis},
title = {On the hardness of approximating minimization problems},
journal = {Journal of the ACM},
volume = {41},
year = {1994},
pages = {960--981}
}
@inproceedings{Lun85,
author = {H. L{\"u}neberg},
title = {On a little but useful algorithm},
booktitle = {Proceedings, Third International Conference on
Algebraic Algorithms and Error-Correcting Codes, Grenoble, France,
July 1985},
series = lncs,
volume = {229},
publisher = springer,
year = {1985},
pages = {296--301}
}
@article{LBR17,
author = {A. P. Lund and M.J. Bremner and T. C. Ralph},
title = {Quantum Sampling Problems, BosonSampling and Quantum Supremacy},
journal = {npj Quantum Information},
volume = {3},
year = {2017},
month = {April},
howpublished = {https://www.nature.com/articles/s41534-017-0018-2}
}
@article{Lup63,
author = {O. Lupanov},
title = {On the synthesis of some classes of control systems},
journal = {Problemi Kibernetiki},
volume = {10},
year = {1963},
pages = {88--96}
}
@article{Lutz90,
author = {J. Lutz},
title = {Category and measure in complexity classes},
journal = sicomp,
volume = {19},
year = {1990},
pages = {220--258}
}
@inproceedings{Lutz91,
author = {J. Lutz},
title = {A pseudorandom oracle characterization of {BPP}},
booktitle = proc6 # structures,
year = {1991},
pages = {190--195}
}
@article{Lutz92,
author = {J. Lutz},
title = {Almost everywhere high nonuniform complexity},
journal = jcss,
volume = {44},
year = {1992},
pages = {220--258}
}
@misc{Lutz92b,
author = {J. Lutz},
title = {One-way functions and balanced {NP}},
year = {1992},
note = {Unpublished manuscript}
}
@inproceedings{Lutz93,
author = {J. Lutz},
title = {The quantitative structure of exponential time},
booktitle = proc8 # structures,
year = {1993},
pages = {158--175}
}
@article{Lutz93b,
author = {J. Lutz},
title = {A pseudorandom oracle characterization of {BPP}},
journal = sicomp,
volume = {22},
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{LuMa93,
author = {J. Lutz and E. Mayordomo},
title = {Measure, stochasticity, and the density of hard languages},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {38--47}
}
@article{LuSc93,
author = {J. Lutz and W. Schmidt},
title = {Circuit size relative to pseudorandom oracles},
journal = tcs,
volume = {107},
year = {1993},
pages = {95--120}
}
@inproceedings{LuMa94,
author = {J. Lutz and E. Mayordomo},
title = {Cook versus {Karp}-{Levin}: Separating completeness
notions if {NP} is not small},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {415--426}
}
@article{LuMa94b,
author = {J. Lutz and E. Mayordomo},
title = {Measure, stochasticity, and the density of hard languages},
journal = sicomp,
volume = {23},
year = {1994},
pages = {762--779}
}
@inproceedings{Lutz94,
author = {J. Lutz},
title = {Weakly hard problems},
bookittle = proc9 # structures,
year = {1994},
pages = {to appear},
note = sicomp # ", to appear"
}
@misc{Lutz96,
author = {J. Lutz},
title = {One-way functions and balanced {NP}},
year = {1996},
note = "Accepted to " # tcs
}
@incollection{Lutz97,
author = {J. Lutz},
title = {The Quantitative Structure of Exponential Time},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
pages = {225--260}
}
@article{Lyn75,
author = {N. Lynch},
title = {On reducibility to complex or sparse sets},
journal = jacm,
volume = {22},
year = {1975},
pages = {341--345}
}
@article{Lyn77,
author = {N. Lynch},
title = {Log space recognition and translation of parenthesis
languages},
journal = jacm,
volume = {24},
year = {1977},
pages = {583--590}
}
@article{Lyn82,
author = {J. Lynch},
title = {Complexity classes and theories of finite models},
journal = mst,
volume = {15},
year = {1982},
pages = {127--144}
}
@Misc{LMPR06,
author = {Lyubashevsky, Vadim and Micciancio, Daniele and Peikert, Chris and Rosen, Alon},
title = {Provably Secure FFT Hashing},
howpublished = {NIST 2nd Cryptogaphic Hash Workshop},
address = {Santa Barbara, CA, USA},
month = aug,
year = {2006},
note = {Available on-line at URL {\tt http://www.csrc.nist.gov/pki/HashWorkshop/2006/program_2006.htm}}
}
@INPROCEEDINGS{MaSc86,
AUTHOR = {W. Maass and G. Schnitger},
TITLE = {An optimal lower bound for {Turing} machines with one work tape
and a two--way input tape},
BOOKTITLE = proc1 # "Annual Conference on Structure in Complexity Theory",
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {223},
YEAR = {1986},
PAGES = {249--264}
}
@inproceedings{MSS87,
author = {W. Maass and G. Schnitger and E. Szemeredi},
title = {Two tapes are better than one for off-line {T}uring
machines},
booktitle = proc19 # stoc,
year = {1987},
pages = {94--100}
}
@article{MaSl92,
AUTHOR = {W. Maass and T. Slaman},
title = {The complexity types of computable sets},
journal = jcss,
volume = {44},
year = {1992},
pages = {168--192}
}
@misc{Mac93,
author = {I. Macarie},
title = {Connections among probabilistic automata (preliminary
version)},
year = {1993}
}
@techreport{Mac93,
author = {I. Macarie},
title = {Space-efficient deterministic simulation of probabilistic
automata},
institution = {Computer Science, University of Rochester},
number = {463},
year = {1993},
month = {July}
}
@inproceedings{Mac94,
author = {I. Macarie},
title = {Space-efficient simulation of deterministic automata},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {109--122}
}
@techreport{Mac94b,
author = {I. Macarie},
title = {Properties of multihead two-way probabilistic
finite automata},
institution = {Computer Science, University of Rochester},
number = {477},
month = {January},
year = {1994}
}
@techreport{Mac94c,
author = {I. Macarie},
title = {Connections among space-bounded and multihead
probabilistic automata},
institution = {Computer Science, University of Rochester},
number = {476},
month = {January},
year = {1994}
}
@misc{Mac94d,
author = {I. Macarie},
title = {Decreasing the bandwidth of a transition matrix},
year = {1994}
}
@inproceedings{MRU11,
author = {Andrew McGregor and
Atri Rudra and
Steve Uurtamo},
title = {Polynomial Fitting of Data Streams with Applications to
Codeword Testing},
booktitle = proc28 # stacs,
year = {2011},
pages = {428-439},
ee = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.428},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{Mac73,
author = {M. Machtey},
title = {A notion of helping and pseudo-complementation in
lattices of honest subrecursive classes},
booktitle = proc14 # focs,
year = {1973},
pages = {nnn--nnn}
}
@article{Mac75,
author = {M. Machtey},
title = {On the density of honest subrecursive classes},
journal = jcss,
volume = {10},
year = {1975},
pages = {nnn--nnn}
}
@article{Mac76,
author = {M. Machtey},
title = {Minimal pairs of polynomial degrees with subexponential
complexity},
journal = tcs,
volume = {2},
year = {1976},
pages = {nnn--nnn}
}
@book{MY78,
author = {M. Machtey and P. Young},
title = {An Introduction to the General Theory of Algorithms},
publisher = {North-Holland},
address = {New York},
year = {1978}
}
@inproceedings{MaTh93,
author = {A. Maciel and D. Th{\'e}rien},
title = {Threshold circuits for iterated mutliplication: using
{AC$^0$} for free},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {545--554}
}
@phdthesis{Maciel95,
author = {A. Maciel},
title = {Threshold Circuits of Small Majority-Depth},
school = {McGill University, School of Computer Science},
year = {1995}
}
@book{MS77,
author = {F. MacWilliams and N. Sloane},
title = {The Theory of Error-Correcting Codes},
publisher = {North-Holland},
address = {Amsterdam},
year = {1977}
}
@article{MacP85,
author = {H.D. Macpherson},
title = {Growth rates in infinite graphs and permutation groups},
journal = {Proc. London Math. Soc.},
volume = {51},
year = {1985},
pages = {285--294}
}
@inproceedings{MNRS07,
author = {F. Magniesz and A. nayak and J. Rolans and M. Santha},
title = {Search via quantum walk},
booktitle = proc39 # stoc,
year = [2007},
pages = {575--584}
}
@inproceedings{MaVi94,
author = {M. Mahajan and V. Vinay},
title = {Non-commutative computation, depth reduction, and skew
circuits},
booktitle = proc14 # fsttcs,
series = lncs,
volume = {880},
publisher = springer,
year = {1994}
}
@article{Mah82,
author = {S. Mahaney},
title = {Sparse complete sets for {NP}: solution of a conjecture
of {B}erman and {H}artmanis},
journal = jcss,
volume = {25},
year = {1982},
pages = {130--143}
}
@article{MaYo85,
author = {S. Mahaney and P. Young},
title = {Reductions among polynomial isomorphism types},
journal = tcs,
volume = {39},
year = {1985},
pages = {207--224}
}
@techreport{Mak92,
author = {L. Mak},
title = {Speedup of deterministic multidimensional {T}uring machines
by alternating multidimensional {T}uring machines},
institution = {Coordinated Science Laboratory, Univ. of Illinois at
Urbana-Champaign},
number = {UILU-ENG-92-2223, ACT-122},
month = {August},
year = {1992}
}
@techreport{Mak93,
author = {L. Mak},
title = {Are parallel machines always faster than sequential machines?},
institution = {Coordinated Science Laboratory, Univ. of Illinois at
Urbana-Champaign},
number = {UILU-ENG-93-2236, ACT-128},
month = {September},
year = {1993}
}
@techreport{Mak93b,
author = {L. Mak},
title = {Parallelism always helps},
institution = {Coordinated Science Laboratory, Univ. of Illinois at
Urbana-Champaign},
number = {UILU-ENG-93-2239, ACT-129},
month = {September},
year = {1993}
}
@inproceedings{Mak94,
author = {L. Mak},
title = {Are parallel machines always faster than sequential
machines?},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {137--148}
}
@techreport{MaMa09,
author = {K. Makarychev and Y. Makarychev},
title = {How to play unique games on expanders},
institution = eccc,
number = {ECCC TR 2009-21},
year = {2009},
note = {arXiv:0903.0367}
}
@techreport{MaPn92,
author = {J. Makowsky and Y. Pnueli},
title = {Computable quantifiers and logics capturing complexity
classes},
institution = {Computer Science, Technion, Haifa},
year = {1992},
month = {November}
}
@inproceedings{Mal07,
author = {G. Malod},
title = {The complexity of polynomials and their coefficient
functions},
booktitle = proc22 # ccc,
year = {2007},
pages = {193--204}
}
@article{Man82,
author = {G. Manacher},
title = {Steady-paced-output and fractional-on-line algorithms
on a {RAM}},
journal = ipl,
volume = {15},
number = {2},
year = {1982},
pages = {47--52}
}
@article{MNT93,
author = {Y. Mansour and N. Nisan and P. Tiwari},
title = {The computational complexity of universal hashing},
journal = tcs,
volume = {107},
year = {1993},
pages = {121--133}
}
@misc{MHRad93,
author = {M. Marathe and H. {Hunt III} and V. Radhakrishnan},
title = {Hierarchical specifications and polynomial time
approximation schemes for {PSPACE}-complete problems},
year = {1993}
}
@inproceedings{MHRav93,
author = {M. Marathe and H. {Hunt III} and S. Ravi},
title = {The complexity of approximating {PSPACE}-complete
problems for hierarchical specifications},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {nnn--nnn}
}
@article{MaRi94,
author = {D. Marinescu and J. Rice},
title = {On high level characterization of parallelism},
journal = jpdc,
volume = {20},
year = {1993},
pages = {107--113}
}
@article{MaSa12,
author = {I. Markov and M. Saeedi},
title = {Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation},
journal = {Quantum Information and Computation},
volume = {12},
year = {2012},
pages = {361--394}
}
@article{MaSa13,
author = {I. Markov and M. Saeedi},
title = {Faster quantum number factoring via circuit synthesis},
journal = {Phys. Rev. A},
volume = {87},
year = {2013},
pages = {012310 1--5}
}
@misc{MFIB18,
author = {I. Markov and A. Fatima and S. Isakov and S. Boixo},
title = {Quantum Supremacy Is Both Closer and Farther than It Appears},
year = {2018},
howpublished = {https://arxiv.org/pdf/1807.10749}
}
@inproceedings{MCW78,
author = {G. Markowsky and J. Carter and M. Wegman},
title = {Analysis of a universal class of hash functions},
booktitle = {Proceedings of the 1978 International Symposium on Mathemat
ical Foundations of Computer Science},
YEAR = {1978},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {64},
pages = {345--354}
}
@article{Mar94,
author = {B. Martin},
title = {A universal cellular automaton in quasi-linear time
and its {S-m-n} form},
journal = tcs,
volume = {123},
year = {1994},
pages = {199--237}
}
@article{MaPa80,
author = {W. Masek and M. Paterson},
title = {A faster algorithm for computing string distances},
journal = jcss,
volume = {20},
year = {1980},
pages = {18--31}
}
@incollection{Mat73,
author = {Y. Matijasevic},
title = {On recursive unsolvability of {H}ilbert's tenth problem},
booktitle = {Logic, Methodology, and Philosophy of Science IV},
editor = {L. Henkin and A. Joja and G. Moisil and P. Suppes},
publisher = {North-Holland},
year = {1973}
}
@article{MaRo75,
author = {Y. Matijasevic and J. Robinson},
title = {Reduction of an arbitrary {D}iophantine equation
to one in 13 unknowns},
journal = {Acta Arithmetica},
volume = {27},
year = {1975},
pages = {521--553}
}
@article{MDMN08,
author = {D. Maslov and G.W. Dueck and D.M. Miller and C. Negrevergne},
title = {Quantum circuit simplification and level compaction},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
volume = {27},
year = {2008},
pages = {436--444}
}
@incollection{Mat70,
author = {D. Matula},
title = {On the complete subgraph of a random graph},
booktitle = {Combinatory Mathematics and its Applications},
address = {Chapel Hill, NC},
year = {1970},
pages = {356--369}
}
@article{MaNi99,
author = {M. Matsumoto and T. Nishimura},
title = {Mersenne twister: a 623-dimensionally equidistributed
uniform pseudo-random number generator},
journal = {ACM Transactions on Modeling and Computer Simulation},
volume = {8},
year = {1998},
pages = {3--30}
}
@inproceedings{Mau91,
author = {U. Maurer},
title = {Perfect cryptographic security from partially independent
channels},
booktitle = proc23 # stoc,
year = {1991},
pages = {561--572}
}
@article{Mau93,
author = {U. Maurer},
title = {Secret key agreement by public discussion from
common information},
journal = itit,
volume = {39},
year = {1993},
pages = {733--742}
}
@misc{May13,
author = {J. Maynard},
title = {Small gaps between primes},
month = {November},
year = {2013},
howpublished = {http://arxiv.org/abs/1311.4600}
}
@inproceedings{May92,
author = {E. Mayordomo},
title = {Almost every set in exponential time is {P}-bi-immune},
booktitle = proc7 # mfcs,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1992},
pages = {392--400},
note = tcs # ", to appear"
}
@phdthesis{May94t,
author = {E. Mayordomo},
title = {Contributions to the Study of Resource-Bounded Measure},
school = {Universidad Polyt{\'e}cnica de Catalunya},
address = {Barcelona},
month = {April},
year = {1994}
}
@article{MaMe82,
author = {E. Mayr and A. Meyer},
title = {The complexity of the word problem for commutative
semigroups and polynomial ideals},
journal = {Advances in Math.},
volume = {46},
year = {1982},
pages = {305--329}
}
@inproceedings{Mayr89,
author = {E. Mayr},
title = {Membership in polynomial ideals over {\bf Q} is
exponential space complete},
booktitle = proc6 # stacs,
series = lncs,
volume = {349},
publisher = springer,
year = {1989},
pages = {400--406}
}
@inproceedings{MaWe93,
author = {E. Mayr and R. Werchner},
title = {Divide-and-conquer algorithms on the hypercube},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {153--162}
}
@article{Mayr97,
author = {E. Mayr},
title = {Some complexity results for polynomial ideals},
journal = {Journal of Complexity},
volume = {13},
year = {1997},
pages = {303--325}
}
@inproceedings{McA86,
author = {K. McAloon},
title = {Separation results for bounded alternation},
booktitle = proc1 # structures,
volume = {223},
series = lncs,
publisher = springer,
year = {1986},
pages = {265--271}
}
@book{McA91,
author = {A. McAulay},
title = {Optical Computer Architectures},
publisher = {Wiley},
address = {New York, NY},
year = {1991}
}
@inproceedings{MWB94,
author = {R. McCloskey and J. Wang and J. Belanger},
title = {Parallel parsing of languages generated by ambiguous
bounded context grammars},
booktitle = proc6 # icci,
year = {1994}
}
@incollection{McD90,
author = {C. {McDiamard}},
title = {Colourings of random graphs},
booktitle = {Graph Colourings},
editor = {R. Nelson and R. Wilson},
series = {Research Notes in Mathematics},
volume = {218},
publisher = {Pitman},
year = {1990},
pages = {79--86}
}
@article{McG07,
author = {C. McGeoch},
title = {Experimental algorithmics},
journal = cacm,
year = {2007},
pages = {27--31}
}
@article{McKCo87,
author = {P. McKenzie and S. Cook},
title = {The parallel complexity of abelian permutation group
problems},
journal = sicomp,
volume = {16},
year = {1987},
pages = {880--908}
}
@inproceedings{McKTh89,
author = {P. McKenzie and D. Th{\'e}rien},
title = {Automata theory meets circuit complexity},
booktitle = proc16 # icalp,
year = {1989},
pages = {589--602}
}
@article{MPT91,
author = {P. McKenzie and P. P{\'e}ladeau and D. Th{\'e}rien},
title = {{NC$^1$}: The automata-theoretic viewpoint},
journal = {Computational Complexity},
volume = {1},
year = {1991},
pages = {330--359}
}
@book{MP71,
author = {R. McNaughton and S. Papert},
title = {Counter-Free Automata},
publisher = {MIT Press},
address = {Cambridge, MA},
year = {1971}
}
@book{MC80,
editor = {C. Mead and L. Conway},
title = {Introduction to VLSI Systems},
publisher = {Addison-Wesley},
address = {Reading, Mass.},
year = {1980}
}
@techreport{MeKo93,
author = {B. Medawar and W. Korfhage},
title = {Hierarchical load balancing with dynamic hierarchies},
number = {CATT 93-16},
institution = {Center for Advanced Technology in Telecommunications,
Polytechnic University},
address = {Brooklyn, NY 11201},
month = {March},
year = {1993}
}
@article{Meh76,
author = {K. Mehlhorn},
title = {Polynomial and abstract subrecursive classes},
journal = jcss,
volume = {12},
year = {1976},
pages = {147--178}
}
@article{MeVi84,
author = {K. Mehlhorn and U. Vishkin},
title = {Randomized and deterministic simulation of {PRAMs}
by parallel machines with restricted granualrity of parallel memories},
journal = {Acta Informatica},
volume = {21},
year = {1984},
pages = {339--374}
}
@book{Mei89,
author = {C. Meinel},
title = {Modified Branching Programs and Their Computational
Power},
series = lncs,
volume = {370},
publisher = springer,
address = {Berlin},
year = {1989}
}
@article{Mei90,
author = {C. Meinel},
title = {Polynomial-size {$\Omega$}-branching programs
and their computational power},
journal = infcon,
volume = {85},
year = {1990},
pages = {163--182}
}
@inproceedings{Mei90b,
author = {C. Meinel},
title = {Restricted branching programs and their computational
power},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {61--75}
}
@inproceedings{MeWa93,
author = {C. Meinel and S. Waack},
title = {Separating complexity classes related to bounded
alternating {$\omega$}-branching programs},
booktitle = proc4 # isaac,
publisher = springer,
series = lncs,
volume = {762},
year = {1993},
pages = {379--390}
}
@article{Mei92,
author = {Yu. Meitus},
title = {The equivalence problem for real-time strict
deterministic pushdown automata},
journal = {Kibernetika},
volume = {25},
year = {1992},
pages = {581--594}
}
@article{Mei93,
author = {Yu. Meitus},
title = {Decidability of the equivalence problem for deterministic
pushdown automata},
journal = {Cybernetics and Systems Analysis},
volume = {28},
number = {5},
year = {1993},
pages = {672--690},
note = {Transl. of {\it Kibernetika i Sistemnyi Analiz\/}}
}
@InProceedings{Mel96,
author = "D.\ van Melkebeek",
title = "Reducing {P} to a Sparse Set using a Constant Number
of Queries Collapses {P} to {L}",
booktitle = proc11 # ccc,
year = "1996",
pages = {nnn--nnn}
}
@techreport{Mel98,
author = {D. van Melkebeek},
title = {On the measure of {BPP}},
institution = {Department of Computer Science, University of Chicago},
number = {TR-98-07},
year = {1998},
month = {July}
}
@phdthesis{Mel99,
author = {D. van Melkebeek},
title = {Randomness and Completeness in Computational Complexity},
school = {University of Chicago, Department of Computer Science},
year = {1999},
month = {June},
note = {Available as UC CS Technical Report TR 99-04}
}
@incollection{Mel04,
author = {D. van Melkebeek},
title = {Time-space lower bounds for {NP}-complete problems},
booktitle = {Current Trends in Theoretical Computer Science},
publisher = {World Scientific},
year = {2004},
pages = {265--291}
}
@article{Mel07,
author = {D. van Melkebeek},
title = {A survey of lower bounds for satisfiability and related
problems},
journal = {Foundations and Trends in Theoretical Computer Science},
year = {2007},
volume = {2},
pages = {197--303}
}
@article{Mer78,
author = {R. Merkle},
title = {Secure communications over insecure channels},
journal = cacm,
volume = {21},
year = {1978},
pages = {294--299}
}
@article{MeHe78,
author = {R. Merkle and M. Hellman},
title = {Hiding information and signatures in trapdoor knapsacks},
journal = itit,
volume = {24},
year = {1978},
pages = {525--530}
}
@article{vMI05,
author = {R. van Meter and K. Itoh},
title = {Fast quantum modular exponentiation},
journal = {Phys. Rev. A},
volume = {71},
year = {2005},
pages = {052320}
},
@article{MRRT53,
author = {N. Metropolis and A. Rosenbluth and M. Rosenbluth
and A. Teller},
title = {Equation of state calculations by fast computing
machines},
journal = {J. Chem. Phys.},
volume = {21},
year = {1953},
pages = {1087--1092}
}
@article{Mey69,
author = {A. Meyer},
title = {A note on star-free events},
journal = jacm,
volume = {16},
year = {1969},
pages = {220--225}
}
@techreport{MePa79,
author = {A. Meyer and M. Paterson},
title = {With what frequency are apparently intractable
problems difficult?},
institution = {MIT},
number = {TM-126},
year = {1979}
}
@article{Mic81,
author = {S. Micali},
title = {Two-way deterministic finite automata are exponentially
more succinct than sweeping automata},
journal = ipl,
volume = {12},
year = {1981},
pages = {103--105}
}
@article{Mic91,
author = {P. Michel},
title = {An {$\NP$}-complete language accepted in linear time by
a one-tape {Turing} machine},
journal = tcs,
volume = {85},
year = {1991},
pages = {205--212}
}
@article{MiRe04,
author = {Thierry Mignon and Nicolas Ressayre},
title = {A quadratic bound for the determinant and permanent problem},
journal = {Int. Math. Res. Not.},
volume = {79},
year = {2004},
pages = {4241--4253}
}
@article{MNSW88,
author = {D. Mikl{\'o}s and M. Newman and A. Seress and D. West},
title = {The addition game: An abstraction of a communication problem},
journal = {Discrete Mathematics},
volume = {68},
year = {1988},
pages = {265--272}
}
@inproceedings{MiRe85,
author = {G. Miller and J. Reif},
title = {Parallel tree contraction and its applications},
booktitle = proc26 # focs,
year = {1985},
pages = {478--489}
}
@incollection{MiRe89,
author = {G. Miller and J. Reif},
title = {Parallel tree contraction, {Part 1: Fundamentals}},
booktitle = {Advances in Computing Research},
publisher = {JAI Press, Inc.},
volume = {5},
year = {1989},
pages = {47--72}
}
@inproceedings{MiTh90,
author = {G. Miller and W. Thurston},
title = {Separators in two and three dimensions},
booktile = proc22 # stoc,
year = {1990},
pages = {300--309}
}
@inproceedings{MTV91,
author = {G. Miller and S.-H. Teng and S. Vavasis},
title = {A unified geometric approach to graph separators},
booktitle = proc32 # focs,
year = {1991},
pages = {538--547}
}
@inproceedings{MiVa91,
author = {G. Miller and S. Vavasis},
title = {Density graphs and separators},
booktitle = {Proceedings of the ACM-SIAM Symposium on Discrete
Algorithms},
year = {1991},
pages = {331--336}
}
@misc{MTTV96a,
author = {G. Miller and S.-H. Teng and W. Thurston and S. Vavasis},
title = {Finite element meshes and geometric separators},
year = {1996},
note = { To appear in {\it SIAM J. Sci. Comp.}}
}
@misc{MTTV96b,
author = {G. Miller and S.-H. Teng and W. Thurston and S. Vavasis},
title = {Separators for sphere-packings and nearest-neighbor
graphs},
year = {1996},
note = "Submitted to" # jacm
}
@article{MPRS93,
author = {R. Miller and V. P{rasanna-Kumar} and D. Reisis and
Q. Stout},
title = {Parallel computations on reconfigurable meshes},
journal = ieeetc,
volume = {42},
year = {1993},
pages = {678--692}
}
@INPROCEEDINGS{Mil91,
AUTHOR = {P. Miltersen},
TITLE = {The complexity of malign ensembles},
BOOKTITLE = proc6 # structures,
YEAR = {1991},
PAGES = {164--171}
}
@article{Mil93,
AUTHOR = {P. Miltersen},
TITLE = {The complexity of malign measures},
journal = sicomp,
volume = {22},
year = {1993},
pages = {147--156}
}
@inproceedings{Mil93b,
author = {P. Miltersen},
title = {The bit probe complexity measure revisited},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {662--671}
}
@book{MP68,
author = {M. Minsky and S. Papert},
title = {Perceptrons},
publisher = {MIT Press},
year = {1968},
note = {Revised and expanded in 1988}
}
@article{Mol90,
author = {B. Molzan},
title = {Expressibility and nonuniform complexity classes},
journal = sicomp,
volume = {19},
year = {1990},
pages = {411--423}
}
@article{Mon76,
author = {B. Monien},
title = {Transformational methods and their applications to
complexity problems},
journal = {Acta Informatica},
volume = {6},
year = {1976},
pages = {95--108}
}
@inproceedings{MoMo84,
author = {H. M{\"o}ller and F. Mora},
title = {Upper and lower bounds for the degree of {Gr{\"o}bner}
bases},
booktitle = {Proceedings of EUROSAM'84},
series = lncs,
volume = {174},
year = {1984},
pages = {172--183}
}
@ARTICLE{MMKIW95,
author = "C. Monroe and D.M. Meekhof and B.E. King and W.M. Itano and D.J. Wineland",
title = "Demonstration of a Fundamental Quantum Logic Gate",
journal = "Physical Review Letters",
volume = "75",
year = "1996",
pages = "4714"
}
@article{Mon17,
author = {A. Montanaro},
title = {Quantum circuits and low-degree polynomials over {$F_2$}},
journal = {Journal of Physics A},
volume = {50},
year = {2017}
}
@article{MoRo88,
author = {T. Mora and L. Robbiano},
title = {The {Gr{\"o}bner} fan of an ideal},
journal = {Journal of Symbolic Computation},
volume = {6},
year = {1988},
pages = {183--208}
}
@article{MoLe93,
author = {L. Morales and J. Lew},
title = {An enlarged family of packing polynomials on
multidimensional lattices},
journal = mathsys,
year = {1993},
volume = {nn},
note = {To appear}
}
@article{Mor73,
author = {J. Morgenstern},
title = {Note on a lower bound of the linear complexity of
the fast {F}ourier transform},
journal = jacm,
volume = {20},
year = {1973},
pages = {305--306}
}
@book{MoRa95,
author = {R. Motwani and P. Raghavan},
title = {Randomized Algorithms},
publisher = {Cambridge University Press},
address = {Cambridge, UK},
year = {1995}
}
@ARTICLE{MuPr75,
AUTHOR = {D. Muller and F. Preparata},
TITLE = {Bounds to complexities of networks for sorting and switching},
JOURNAL = jacm,
VOLUME = {22},
YEAR = {1975},
PAGES = {195--201}
}
@article{MuPr92,
author = {D. Muller and F. Preparata},
title = {Parallel restructuring and evaluation of expressions},
journal = jcss,
volume = {44},
year = {1992},
pages = {43--62}
}
@article{MVV87,
author = {K. Mulmuley and U. Vazirani and V. Vazirani},
title = {Matching is as easy as matrix inversion},
journal = {Combinatorica},
volume = {7},
year = {1987},
pages = {105--113}
}
@inproceedings{Mul93,
author = {K. Mulmuley},
title = {A lower bound for solvability of polynomial equations},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {268--283}
}
@inproceedings{Mul94,
author = {K. Mulmuley},
title = {Lower bounds for parallel linear programming and other
problems},
booktitle = proc26 # stoc,
year = {1994},
pages = {608--618}
}
@InProceedings{Mul97,
author = "Mulmuley",
title = "Is There an Algebraic Proof for {P} != {NC}? (Extended
Abstract)",
booktitle = proc28 # stoc,
year = "1997",
}
@article{Mul99,
author = {K. Mulmuley},
title = {Lower bounds in a parallel model without bit operations},
journal = sicomp,
volume = {28},
year = {1999},
pages = {1460--1509}
}
@misc{Mul00,
author = {K. Mulmuley},
note = {Personal communication},
month = {January},
year = {2000}
}
@inproceedings{MuSo01,
author = {K. Mulmuley and M. Sohoni},
title = {Geometric complexity theory, {P} vs. {NP}, and
explicit obstructions},
booktitle = {Proceedings, International Conference on
Algebra and Geometry, Hyderabad, 2001},
year = {2001}
}
@article{MuSo02,
author = {K. Mulmuley and M. Sohoni},
title = {Geometric complexity theory {I}: An approach to
the {P} vs. {NP} and related problems},
journal = sicomp,
volume = {31},
number = {2},
year = {2002},
pages = {496--526}
}
@unpublished{MuSo02b,
author = {K. Mulmuley and M. Sohoni},
title = {Geometric complexity theory {II}: Explicit
obstructions},
year = {2001--02},
note = {Manuscript, in preparation}
}
@techreport{Mul07,
author = {K. Mulmuley},
title = {On {P} vs.\ {NP}, geometric complexity theory, and
the {F}lip {I}: a high-level view},
year = {2007},
institution = {Computer Science Dept., The University of Chicago},
number = {2007-09}
}
@techreport{Mul10,
author = {K. Mulmuley},
title = {Explicit {P}roofs and {The Flip}},
year = {2010},
institution = {Computer Science Dept., The University of Chicago},
note = {http://arxiv.org/abs/1009.0246}
}
@book{Mum65,
author = {D. Mumford},
title = {Geometric Invariant Theory},
publisher = springer,
address = {New York},
year = {1965},
note = {Published in USA by Academic Press, Inc., New York}
}
@book{Mum76,
author = {D. Mumford},
title = {Algebraic Geometry I: Complex Projective Varieties},
publisher = springer,
series = {Grundlehren der mathematischen Wissenschaften},
volume = {221},
year = {1976}
}
@Article{Mum77,
author = "D. Mumford",
title = "Stability for projective varieties",
journal = "Enseign. Math. (2)",
volume = "23",
pages = "39--110",
year = "1977",
}
@techreport{Mur90,
author = {C. Murthy},
title = {Extracting Constructive Content from Classical Proofs},
institution = {Department of Computer Science, Cornell University},
year = {1990}
}
@inproceedings{Mye83,
author = {D. Myers},
title = {The random-access hierarchy (preliminary report)},
booktitle = proc15 # stoc,
year = {1983},
pages = {355--364}
}
@inproceedings{NOS93,
author = {A. Naik and M. Ogiwara and A. Selman},
title = {{P}-selective sets, and reducing search to decision
vs.\ self-reducibility},
booktitle = proc8 # structures,
year = {1993},
pages = {52--64}
}
@inproceedings{NaikOgiwaraSelman93,
author = {A. Naik and M. Ogiwara and A. Selman},
title = {{P}-selective sets, and reducing search to decision
vs.\ self-reducibility},
booktitle = proc8 # structures,
year = {1993},
pages = {52--64}
}
@inproceedings{NRS93,
author = {A. Naik and K. Regan and D. Sivakumar},
title = {Quasilinear time complexity theory},
booktitle = proc11 # stacs,
volume = {778},
series = lncs,
publisher = springer,
year = {1994},
pages = {97--108}
}
@techreport{NRS94,
author = {A. Naik and K. Regan and D. Sivakumar},
title = {Quasilinear time complexity theory},
institution = {Department of Computer Science, University at Buffalo},
number = {UB-CS TR 94-21},
year = {1994},
note = {An earlier version appeared in the proceedings of STACS'94,
LNCS 778, pp~97--108}
}
@article{NRS95,
author = {A. Naik and K. Regan and D. Sivakumar},
title = {On quasilinear time complexity theory},
journal = tcs,
volume = {148},
year = {1995},
pages = {325--349}
}
book{NaSt82,
author = {M.A. Naimark and A.I. Stern},
title = {The Theory of Group Representations},
publisher = {Springer-Verlag},
address = {New York, NY},
year = {1982}
}
@inproceedings{NaNa90,
author = {J. Naor and M. Naor},
title = {Small-bias probability spaces: efficient constructions
and applications},
booktitle = proc22 # stoc,
year = {1990},
pages = {213--223}
}
@article{NaNa93,
author = {J. Naor and M. Naor},
title = {Small-bias probability spaces: efficient constructions
and applications},
journal = sicomp,
volume = {22},
year = {1993},
pages = {838--856}
}
@Article{NOS93b,
author = {M. Naor and A. Orlitsky and P. Shor},
title = {Three results on interactive communication},
journal = itit,
volume = {39},
year = {1993},
pages = {1608--1615}
}
@article{NaSa81,
author = {D. Nassimi and S. Sahni},
title = {Data broadcasting in {SIMD} computers},
journal = {IEEE Transactions on Computers},
volume = {C-30},
month = {February},
year = {1981},
pages = {101--106}
}
@article{NaSa81,
author = {D. Nassimi and S. Sahni},
title = {Parallel permutation and sorting algorithms and a new
generalized connection network},
journal = jacm,
volume = {29},
year = {1982},
pages = {642--667}
}
@inproceedings{Ner89,
author = {A. Nerode},
title = {Polynomial-graded logic},
booktitle = proc3 # lics,
year = {1989},
pages = {nnn--nnn}
}
@article{NePo85,
author = {J. Nesetril and S. Poljak},
title = {On the complexity of the subgraph problem},
journal = {Commen. Math. Univ. Carol.},
volume = {26},
year = {1985},
pages = {415--419}
}
@misc{vdNest09,
author = {M. van den Nest},
title = {Classical simulation of quantum computation, the
{G}ottesman-{K}nill theorem, and slightly beyond},
year = {2009},
note = {arXiv:0811.0898}
}
@misc{vdNest10,
author = "M. van den Nest",
title = "Simulating Quantum Computers With Probabilistic Methods",
year = {2010},
note = "QIP 2010 and arXiv:0911.1624"
}
@article{NSCJBML17,
author = {A. Neville and C. Sparrow and R. Clifford and E. Johnston and P.M. Birchall and A. Montanaro and A. Laing},
title = {Classical boson sampling algorithms with superior performance to near-term experiments},
journal = {Nature Physics},
volume = {4270},
year = {2017},
howpublished = {http://dx.doi.org/10.1038/nphys4270}
}
@article{New64,
author = {D. Newman},
title = {Rational approximation to {\mbox{$|x|$}}},
journal = {Michigan Mathematical Journal},
volume = {11},
year = {1964},
pages = {11--14}
}
@inproceedings{NRLN10,
author = {Hung Q. Ngo and Atri Rudra and Anh N. Le and Thanh-Nhan Nguyen},
title = {Analyzing Nonblocking Switching Networks using Linear Programming (Duality)},
booktitle = {INFOCOM},
year = {2010},
pages = {2696-2704},
ee = {http://dx.doi.org/10.1109/INFCOM.2010.5462100},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{NPR11,
author = {Hung Q. Ngo and
Ely Porat and
Atri Rudra},
title = {Efficiently Decodable Error-Correcting List Disjunct Matrices
and Applications - (Extended Abstract)},
booktitle = proc38 # icalp,
year = {2011},
pages = {557-568},
ee = {http://dx.doi.org/10.1007/978-3-642-22006-7_47},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{NiRo93,
author = {R. Niedermeyer and P. Rossmanith},
title = {Extended locally definable acceptance types},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {473--483}
}
@book{NC00,
author = {M.A. Nielsen and I. L. Chuang},
title = {Quantum Computation and Quantum Information},
publisher = cup,
year = {2000}
}
@article{Nie77,
author = {J. Nievergelt},
title = {Information content of chess positions},
journal = {ACM SIGART Newsletter},
volume = {62},
pages = {13-14},
year = {1977}
}
@Article{NiRo98,
title = "Unambiguous computations and locally definable
acceptance types",
author = "Rolf Niedermeier and Peter Rossmanith",
pages = "137--161",
journal = "Theoretical Computer Science",
year = "1998",
volume = "194",
number = "1--2"
}
@INPROCEEDINGS{NiWi88,
AUTHOR = {N. Nisan and A. Wigderson},
TITLE = {Hardness vs. randomness},
BOOKTITLE = proc29 # focs,
YEAR = {1988},
PAGES = {2--11}
}
@inproceedings{Nis90,
author = {N. Nisan},
title = {Pseudorandom generators for space-bounded computation},
booktitle = proc22 # stoc,
year = {1990},
pages = {204--212}
}
@article{Nis91,
author = {N. Nisan},
title = {{CREW} {PRAMs} and decision trees},
journal = sicomp,
volume = {20},
year = {1991},
pages = {999--1007}
}
@article{Nis91b,
author = {N. Nisan},
title = {Pseudorandom bits for constant-depth circuits},
journal = {Combinatorica},
volume = {11},
year = {1991},
pages = {63--70}
}
@inproceedings{Nis91c,
author = {N. Nisan},
title = {Lower bounds for non-commutative computation: extended
abstract},
booktitle = proc23 # stoc,
year = {1991},
pages = {410--418}
}
@inproceedings{Nis92,
author = {N. Nisan},
title = {{RL} {$\subseteq$} {SC}},
booktitle = proc24 # stoc,
year = {1992},
pages = {619--623}
}
@article{Nis92p,
author = {N. Nisan},
title = {Pseudorandom generators for space-bounded computation},
journal = {Combinatorica},
volume = {12},
year = {1992},
pages = {449--461}
}
@book{Nis92t,
author = {N. Nisan},
title = {Using hard problems to create pseudorandom generators},
publisher = {MIT Press},
year = {1992},
note = {Revision of author's 1988 U.C. Berkeley thesis for the
ACM Distinguished Dissertation series}
}
@inproceedings{NiSz92,
author = {N. Nisan and M. Szegedy},
title = {On the degree of {B}oolean functions as real polynomials},
booktitle = proc24 # stoc,
year = {1992},
pages = {462--467}
}
@inproceedings{NSW92,
author = {N. Nisan and E. Szemer{\'e}di and A. Wigderson},
title = {Undirected connectivity in {$O(\log^{1.5}n)$} space},
booktitle = proc33 # focs,
year = {1992},
pages = {24--29}
}
@article{Nis93,
author = {N. Nisan},
title = {On read-once vs. multiple access to randomness
in logspace},
journal = tcs,
volume = {107},
year = {1993},
pages = {135--144}
}
@incollection{Nis93b,
author = {N. Nisan},
title = {The communication complexity of threshold gates},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {301--315}
}
@article{NiWi93,
author = {N. Nisan and A. Wigderson},
title = {Rounds in communication complexity revisited},
journal = sicomp,
volume = {22},
year = {1993},
pages = {211--219}
}
@inproceedings{NiZu93,
author = {N. Nisan and D. Zuckerman},
title = {More deterministic simulation in {Logspace}},
booktitle = proc25 # stoc,
year = {1993},
pages = {235--244}
}
@article{NiSz94,
author = {N. Nisan and M. Szegedy},
title = {On the degree of {B}oolean functions as real polynomials},
journal = compcomp,
volume = {4},
year = {1994},
pages = {301--313}
}
@article{NiWi94,
author = {N. Nisan and A. Wigderson},
title = {Hardness versus randomness},
journal = jcss,
volume = {49},
year = {1994},
pages = {149--167}
}
@InProceedings{NiWi95,
author={Noam Nisan and Avi Wigderson},
title={On the complexity of bilinear forms},
booktitle=proc27 # stoc,
pages={723-732},
year={1995}
}
@inproceedings{NiTaS95,
author = {N. Nisan and A. {Ta-Shma}},
title = {Symmetric logspace is closed under complement},
booktitle = proc27 # stoc,
year = {1995},
pages = {140--146}
}
@article{NiWi96,
author = {N. Nisan and A. Wigderson},
title = {Lower Bounds on Arithmetic Circuits via Partial
Derivatives},
journal = {Computational Complexity},
volume = {6},
year = {1996},
pages = {217--234}
}
@inproceedings{OD79,
author = {M. O'Donnell},
title = {A programming language theorem which is independent
of {P}eano arithmetic},
booktitle = proc11 # stoc,
year = {1979},
pages = {176--188}
}
@article{Ofm63,
author = {Y. Ofman},
title = {On the algorithmic complexity of discrete functions},
journal = {Soviet Physics---Doklady},
volume = {7},
number = {7},
year = {1963},
pages = {589--591},
note = {English translation}
}
@inproceedings{OgHe91,
author = {M. Ogiwara and L. Hemachandra},
title = {A complexity theory for feasible closure properties},
booktitle = proc6 # structures,
year = {1991},
pages = {16--29}
}
@techreport{Ogi93,
author = {M. Ogiwara},
title = {{NC$^k$(NP) = AC$^{k-1}$(NP)}},
number = {CSIM 93-06},
institution = {Dept. of Comp. Sci. and Information Maths.,
University of Electrocommunications},
address = {Chofu, Tokyo 182, Japan},
year = {1993},
note = {To appear in the proceedings of STACS'94}
}
@inproceedings{Ogi94,
author = {M. Ogihara},
title = {{NC$^k$(NP) = AC$^{k-1}$(NP)}},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {313--324}
}
@article{Ogi95,
author = {M. Ogihara},
title = {Equivalence of {NC$^k$} and {AC$^k$} closures of {NP}
and other classes},
journal = infcon,
volume = {120},
year = {1995},
pages = {56--59},
}
@inproceedings{Ogi95b,
author = {M. Ogihara},
title = {Sparse P-Hard Sets Yield Space-Efficient Algorithms},
booktitle = proc36 # focs,
year = {1995},
pages = {354--361},
note = {Journal version: {\it Chicago Journal of Theoretical Computer
Science\/}, 1996}
}
@inproceedings{Ogi96,
author = {M. Ogihara},
title = {The {PL} hierarchy collapses},
booktitle = proc26 # stoc,
year = {1996},
pages = {84--88}
}
@inproceedings{Oka93,
author = {T. Okamoto},
title = {On the relationship among cryptographic physical assumptions},
booktitle = proc4 # isaac,
publisher = springer,
series = lncs,
volume = {762},
year = {1993},
pages = {369--378}
}
@misc{Oli13,
author = {Igor Oliveira},
title = {Algorithms versus Circuit Lower Bounds},
year = {2013},
howpublished = {https://arxiv.org/abs/1309.0249}
}
@inproceedings{OrGa84,
author = {A. Orlitsky and A. El Gamal},
title = {Communication with secrecy constraints},
booktitle = proc16 # stoc,
year = {1984},
pages = {217--224}
}
@incollection{OrGa88,
author = {A. Orlitsky and A. El Gamal},
title = {Communication complexity},
booktitle = {Complexity in Information Theory},
editor = {Y. Abu-Mostafa},
publisher = springer,
year = {1988}
}
@article{OrGa90,
author = {A. Orlitsky and A. El Gamal},
title = {Average and randomized communication complexity},
journal = itit,
year = {1990},
volume = {36},
pages = {3--16}
}
@article{Orl90,
author = {A. Orlitsky},
title = {Worst-case interactive communication {I}: Two messages
are almost optimal},
journal = itit,
volume = {36},
year = {1990},
pages = {1111--1126}
}
@article{Orl91,
author = {A. Orlitsky},
title = {Worst-case interactive communication {II}: Two messages
are not optimal},
journal = itit,
volume = {37},
year = {1991},
pages = {995--1005}
}
@inproceedings{Orl91b,
author = {A. Orlitsky},
title = {Interactive communication: balanced distributions,
correlated files, and average-case complexity},
booktitle = proc32 # focs,
year = {1991},
pages = {228--238}
}
@article{Orl92,
author = {A. Orlitsky},
title = {Average-case interactive communication},
journal = itit,
volume = {38},
year = {1992},
pages = {1534--1547}
}
@article{Orl93,
author = {A. Orlitsky},
title = {Interactive communication of balanced distributions
and of correlated files},
journal = sjdm,
volume = {6},
year = {1993},
pages = {548--564}
}
@article{Orp86,
author = {P. Orponen},
title = {A classification of complexity core lattices},
journal = tcs,
volume = {47},
year = {1986},
pages = {121--130}
}
@article{ORS86,
author = {P. Orponen and D. Russo and U. Sch{\"o}ning},
title = {Optimal approximations and polynomially levelable sets},
journal = sicomp,
volume = {15},
year = {1986},
pages = {399--408}
}
@article{OrSc86,
author = {P. Orponen and U. Sch{\"o}ning},
title = {On the density and complexity of polynomial cores for
intractable sets},
journal = infcon,
volume = {70},
year = {1986},
pages = {54--68}
}
@inproceedings{Orp93,
author = {P. Orponen},
title = {On the computational power of discrete {H}opfield nets},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {215--225}
}
@article{OKSW94,
author = {P. Orponen and K. Ko and U. Sch{\"o}ning and O. Watanabe},
title = {Instance complexity},
journal = jacm,
year = {1994},
volume = {41},
pages = {96--121}
}
@misc{OsElA94,
author = {M. Osman and A. El-Amawy},
title = {A distributed fault-tolerant routing algorithm for
generalized de {B}ruijn networks},
year = {1994},
note = {Dept. of Electrical and Computer Engineering,
Louisiana State University}
}
@inproceedings{Ost90,
author = {R. Ostrovsky},
title = {Efficient computation on oblivious {RAMs}},
booktitle = proc22 # stoc,
year = {1990},
pages = {514--523}
}
@inproceedings{Ost91,
author = {R. Ostrovsky},
title = {One-way functions, hard on average problems, and statistical
zero-knowledge proofs},
booktitle = proc6 # structures,
year = {1991},
pages = {133--138}
}
@inproceedings{OuWo14,
author = {J. Ouaknine and J. Worrell},
title = {Ultimate Positivity is decidable for simple linear recurrence sequences},
booktitle = proc41 # icalp,
series = lncs,
publisher = springer,
volume = {8573},
year = {2014},
pages = {330--341}
}
@article{OuWo15,
author = {J. Ouaknine and J. Worrell},
title = {On linear recurrence sequences and loop termination (a survey)},
journal = {ACM SIGLOG News},
volume = {2},
year = {2015}
}
@article{Owi86,
author = {J. Owings},
title = {Effective choice functions and index sets},
journal = jcss,
volume = {32},
year = {1986},
pages = {370--373}
}
@article{OxWh93,
author = {J. Oxley and G. Whittle},
title = {A characterization of {T}utte invariants of 2-polymatroids},
journal = jctb,
volume = {59},
year = {1993},
pages = {210--244}
}
@book{Oxt80,
author = {J. Oxtoby},
title = {Measure and Category},
publisher = springer,
edition = {2nd},
address = {New York},
year = {1980}
}
@book{Oxtoby,
author = {J. Oxtoby},
title = {Measure and Category},
publisher = springer,
edition = {2nd},
address = {New York},
year = {1980}
}
@article{OzGo92,
author = {H. Ozaktas and J. Goodman},
title = {Implications of interconnection theory for optical
digital computing},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5559--5567}
}
@book{Pal85,
author = {E. Palmer},
title = {Graphical Evolution},
publisher = {Wiley},
address = {New York},
year = {1985}
}
@article{Pal77,
author = {E. Palmer},
title = {Unsolved problems in the theory of random graphs},
journal = {Ann. Disc. Math.},
volume = {33},
year = {1987},
pages = {227--239}
}
@article{PLM06,
author = {F. Panneton and P. L'Ecuyer and M. Matsumoto},
title = {Improved long-period generators based on linear
recurrences modulo 2},
journal = {ACM Trans. Math. Software},
volume = {32},
year = {2006},
pages = {1--16}
}
@INCOLLECTION{PaZa83,
AUTHOR = {C. H. Papadimitriou and S. Zachos},
TITLE = {Two remarks on the power of counting},
BOOKTITLE = {The 6th GI Conference on Theoretical Computer Science},
YEAR = {1983},
PAGES = {269--276},
PUBLISHER = springer,
SERIES = {Lecture Notes in Computer Science No.~145}
}
@INCOLLECTION{PZ83,
AUTHOR = {C. H. Papadimitriou and S. Zachos},
TITLE = {Two remarks on the power of counting},
BOOKTITLE = {The 6th GI Conference on Theoretical Computer Science},
YEAR = {1983},
PAGES = {269--276},
PUBLISHER = springer,
SERIES = {Lecture Notes in Computer Science No.~145}
}
@article{PaSi84,
author = {C. Papadimitriou and M. Sipser},
title = {Communication complexity},
journal = jcss,
volume = {28},
year = {1984},
pages = {260--269}
}
@article{PaYa84,
author = {C. Papadimitriou and M. Yannakakis},
title = {The complexity of facets (and some facets of complexity)},
journal = jcss,
volume = {28},
year = {1984},
pages = {244--259}
}
@article{PaUl87,
author = {C. Papadimitriou and J. Ullman},
title = {A communication-time tradeoff},
journal = sicomp,
volume = {16},
year = {1987},
pages = {639--646}
}
@article{PaYa90,
author = {C. Papadimitriou and M. Yannakakis},
title = {Towards an architecture-independent analysis of
parallel algorithms},
journal = sicomp,
volume = {19},
year = {1990},
pages = {322--328}
}
@article{PaYa91,
author = {C. Papadimitriou and M. Yannakakis},
title = {Optimization, approximation and complexity classes},
journal = jcss,
volume = {43},
year = {1991},
pages = {425--440}
}
@book{Pap94,
author = {C. Papadimitriou},
title = {Computational Complexity},
publisher = {Addison-Wesley},
address = {Reading, Mass.},
year = {1994}
}
@inproceedings{Pap94a,
author = {C. Papadimitriou},
title = {On complexity as bounded rationality},
booktitle = proc26 # stoc,
year = {1994},
pages = {726--733}
}
@article{Pap94b,
author = {C. Papadimitriou},
title = {On the complexity of the parity argument, and other
inefficient proofs of existence},
journal = jcss,
volume = {48},
year = {1994},
pages = {498--532}
}
@article{Pap97,
author = {C. Papadimitriou},
title = {Extroverted complexity theory},
journal = {SIGACT News},
volume = {28},
year = {1997},
pages = {}
}
@article{Par87a,
author = {I. Parberry},
title = {An improved simulation of space and reversal bounded
deterministic {Turing} machines by width and depth bounded uniform circuits},
journal = ipl,
volume = {24},
year = {1987},
pages = {363--367}
}
@article{Par87b,
author = {I. Parberry},
title = {Some practical simulations of impractical parallel
computers},
journal = {Parallel Computing},
volume = {4},
year = {1987},
pages = {93--101}
}
@book{Par94,
author = {I. Parberry},
title = {Circuit Complexity and Neural Networks},
publisher = {M.I.T. Press},
address = {Cambridge, Mass.},
year = {1994}
}
@inproceedings{Par95,
author = {L. Pardo},
title = {How upper and lower bounds meet in elimination theory},
booktitle = proc11 # "Conference on Applied Algebra,
Algebraic Algorithms and Error Correcting Codes",
series = lncs,
publisher = springer,
year = {1995}
}
@incollection{PaHa77,
author = {J. Paris and L. Harrington},
title = {A mathematical incompleteness in {P}eano {A}rithmetic},
booktitle = {Handbook of Mathematical Logic},
editor = {K.J. Barwise},
publisher = {North-Holland},
address = {Amsterdam},
year = {1977},
pages = {1133--1142}
}
@incollection{PHW85,
author = {J. Paris and M. Handley and A. Wilkie},
title = {Characterizing some low arithmetic classes},
booktitle = {Colloquium on the Theory of Algorithms},
editor = {L. Lov{\'a}sz and E. Szemeredi},
publisher = {North-Holland},
year = {1985}
}
@incollection{PaWi85,
author = {J. Paris and A. Wilkie},
title = {Counting problems in bounded arithmetic},
booktitle = {Methods in Mathematical Logic},
editor = {A. Dold and B. Eckman},
series = lnm,
volume = {1130},
publisher = springer,
year = {1985},
pages = {317--340}
}
@article{PaWi86,
author = {J. Paris and A. Wilkie},
title = {Counting {$\Delta_0$} sets},
journal = {Fundamenta Mathematicae},
volume = {127},
year = {1986},
pages = {67--76}
}
@article{PWW88,
author = {J. Paris and A. Wilkie and A. Woods},
title = {Provability of the pigeonhole principle and the
existence of infinitely many primes},
journal = jsl,
volume = {53},
year = {1988},
pages = {1235--1244}
}
@article{Par90,
author = {T. Parish},
title = {Crystal clear storage},
journal = {Byte},
volume = {15},
year = {1990},
month = {November},
pages = {283--288}
}
@book{Par77,
author = {K.R. Parthasarathy},
title = {Introduction to Probability and Measure},
publisher = {The Macmillan Company of India, Ltd.},
address = {Madras},
year = {1977}
}
@book{Parthasarathy,
author = {K.R. Parthasarathy},
title = {Introduction to Probability and Measure},
publisher = {The Macmillan Company of India, Ltd.},
address = {Madras},
year = {1977}
}
@inproceedings{PaVa05,
author = {Farzad Parvaresh and
Alexander Vardy},
title = {Correcting Errors Beyond the {G}uruswami-{S}udan Radius in Polyno
mial
Time},
booktitle = {Proceedings of the 46th Annual IEEE Symposium on Foundations of C
omputer Science
(FOCS)},
year = {2005},
pages = {285-294},
ee = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.29},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Pat90,
author = {M. Paterson},
title = {Improved sorting networks with {$O(\log n)$} depth},
journal = {Algorithmica},
volume = {5},
year = {1990},
pages = {75--92}
}
@article{PPRB15,
author = {J. Patrzyk and B. Patrzyk and K. Rycerz and M. Bubak},
title = {Towards a novel environment for simulation of quantum computing},
journal = {Computer Science},
volume = {16},
year = {2015},
pages = {103--129}
}
@inproceedings{PaSa90,
author = {R. Paturi and M. Saks},
title = {On threshold circuits for parity},
booktitle = proc31 # focs,
year = {1990},
pages = {397--404}
}
@article{PSSN90,
author = {R. Paturi and J. Seiferas and J. Simon and R. Newman-Wolfe},
title = {Milking the {Anderaa} argument},
journal = infcomp,
volume = {88},
year = {1990},
pages = {88--104}
}
@inproceedings{Pat92,
author = {R. Paturi},
title = {On the degree of polynomials that approximate symmetric
{B}oolean functions},
booktitle = proc24 # stoc,
year = {1992},
pages = {468--474}
}
@article{PaTa78,
author = {W. Paul and R. Tarjan},
title = {Time-space trade-offs in a pebble game},
journal = {Acta Informatica},
volume = {10},
year = {1978},
pages = {111--115}
}
@ARTICLE{Paul79,
AUTHOR = {W. Paul},
TITLE = {On time hierarchies},
JOURNAL = jcss,
VOLUME = {19},
YEAR = {1979},
PAGES = {197--202}
}
@article{PPR80,
author = {W. Paul and E. Prauss and R. Reischuk},
title = {On alternation},
journal = {Acta Informatica},
volume = {14},
year = {1980},
pages = {243--255}
}
@article{PaRe80b,
author = {W. Paul and R. Reischuk},
title = {On alternation},
journal = {Acta Informatica},
volume = {14},
year = {1980},
pages = {nnn--nnn}
}
@ARTICLE{PaRe81,
AUTHOR = {W. Paul and R. Reischuk},
TITLE = {On time versus space {II}},
JOURNAL = jcss,
VOLUME = {22},
YEAR = {1981},
PAGES = {312--327}
}
@article{PSS81,
author = {W. Paul and J. Seiferas and J. Simon},
title = {An information-theoretic approach to time bounds
for on-line computation},
journal = jcss,
volume = {23},
year = {1981},
pages = {108--126}
}
@INPROCEEDINGS{PPST83,
AUTHOR = {W. Paul and N. Pippenger and E. Szemer{\'e}di and W. Trotter},
TITLE = {On determinism versus nondeterminism and related problems},
BOOKTITLE = proc24 # focs,
YEAR = {1983},
PAGES = {429--438}
}
@incollection{PaSiM84,
author = {W. Paul and J. Simon},
title = {Decision trees and random-access machines},
booktitle = {Sorting and Searching},
editor = {K.~Mehlhorn},
publisher = springer,
year = {1984},
pages = {85--97}
}
@techreport{PaSe97,
author = {A. Pavan and A. Selman},
title = {Complete distributional problems, hard languages, and
resource-bounded measure},
institution = {Department of Computer Science, University at Buffalo},
number = {TR 97-01},
month = {February},
year = {1997}
}
@article{PaGi14,
author = {A. Pavlidis and D. Gizopoulos},
title = {Fast quantum modular exponentiation architecture for Shor's factoring algorithm},
journal = {Quantum Information and Computation},
volume= {14},
year = {2014},
pages = {694--682}
}
@article{PaRe07,
author = {G. Paz-Silva and J. Reina},
title = {Geometric multipartite entanglement measures},
journal = {Physics Letters A},
volume = {365},
year = {2007},
pages = {64--69}
}
@misc{Pei94,
author = {M. Peinado},
title = {Hard graphs for randomized subgraph exclusion problems},
year = {1994},
note = {To appear in the proceedings of ???}
}
@inproceedings{Pel91,
author = {R. Pelikaan},
title = {On the gonality of curves, abundant codes and decoding},
booktitle = {nnn},
series = lnm,
volume = {1518},
publisher = springer,
year = {1991}}
}
@article{PSW91,
author = {R. Pellikaan and B.-Z. Shen and {G. van} Wee},
title = {Which linear codes are algebraic-geometric?},
journal = itit,
volume = {37},
year = {1991},
pages = {583--602}
}
@article{PePi86,
author = {D. Perrin and J. Pin},
title = {First-order logic and star-free sets},
journal = jcss,
volume = {32},
year = {1986},
pages = {393--406}
}
@article{PeWe89,
author = {D.~Petford and D.J.A. Welsh},
title = {A randomised 3-colouring algorithm},
journal = {Discrete Mathematics},
volume = {74},
year = {1989},
pages = {253--261}
}
@article{Phi79,
author = {N. Phillips},
title = {The {P = NP} question and recent independence results},
journal = {Quaestiones Informaticae},
volume = {1},
year = {1979},
pages = {26--29}
}
@inproceedings{Pin87,
author = {J.E. Pin},
title = {On the languages acceptable by finite reversible automata},
booktitle = proc14 # icalp,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1987},
pages = {237--249}
}
@article{PST92,
author = {J. Pin and H. Straubing and D. Th{\'e}rien},
title = {Some results on the generalized star-height problem},
journal = infcon,
volume = {101},
year = {1992},
pages = {219--250}
}
@techreport{Pin94,
author = {J. Pin},
title = {Logic, semigroups, and automata on words},
institution = {Laboratoire Informatique Th{\'e}orique et
Programmation, Institut Blaise Pascal},
number = {LITP 94.16},
month = {February},
year = {1994},
note = {To appear in the journal
{\it Annals of Mathematics and Artificial Intelligence\/}}
}
@article{Pin94b,
author = {J. Pin},
title = {Logics on words},
journal = beatcs,
volume = {54},
year = {1994},
pages = {145--165}
}
@Article{Pin93a,
author = "Jean-Eric Pin",
title = "Logic, Semigroups and Automata on Words",
journal = "Annals of Mathematics and Artificial Intelligence",
year = "1996",
volume = "16",
pages = "343--384",
}
@inproceedings{Pip77,
author = {N. Pippenger},
title = {Fast simulation of combinatorial logic networks by machines
without random-access storage},
booktitle = proc15 # "Allerton Conf. on Comm., Contr., and Comp.",
year = {1977},
pages = {25--33}
}
@article{PiFi79,
author = {N. Pippenger and M. Fischer},
title = {Relations among complexity measures},
journal = jacm,
volume = {26},
year = {1979},
pages = {361--381}
}
@INPROCEEDINGS{Pip79,
AUTHOR = {N. Pippenger},
TITLE = {On simultaneous resource bounds},
BOOKTITLE = proc20 # focs,
YEAR = {1979},
PAGES = {307--311}
}
@article{Pip81,
author = {N. Pippenger},
title = {Algebraic complexity theory},
journal = {IBM Journal of research and Development},
volume = {25(5)},
month = {September},
year = {1981},
pages = {825--832},
note = {Available online at
http://www.research.ibm.com/journal/rd/255/ibmrd2505ZP.pdf}
}
@inproceedings{Pip85,
author = {N. Pippenger},
title = {On networks of noisy gates},
booktitle = proc26 # focs,
year = {1985},
pages = {30--38}
}
@article{Pip88,
author = {N. Pippenger},
title = {Reliable computation by formulas in the presence of noise},
journal = itit,
volume = {34},
year = {1988},
pages = {194--197}
}
@article{Pip89},
author = {N. Pippenger},
title = {Invariance of complexity measures for networks with
unreliable gates},
journal = jacm,
volume = {36},
year = {1989},
pages = {531--539}
}
@article{PST91,
author = {N. Pippenger and G. Stamoulis and J. Tsitsiklis},
title = {On a lower bound for the redundancy of reliable
networks with noisy gates},
journal = itit,
volume = {37},
year = {1991},
pages = {639--643}
}
@inproceedings{PiWi06,
author = {F. Piroi and A. Winterhof},
title = {Quantum period reconstruction of binary sequences},
booktitle = {Proceedings of AAECC 2006},
pages = {60--67},
year = {2006}
}
@phdthesis{Pit92,
author = {T. Pitassi},
title = {The Power of Weak Formal Systems},
school = {University of Toronto},
year = {1992}
}
@article{PBI93,
author = {T. Pitassi and P. Beame and R. Impagliazzo},
title = {Exponential lower bounds for the pigeonhole principle},
journal = {Computational Complexity},
volume = {3},
year = {1993},
pages = {97--140}
}
@article{PiVa88,
author = {L. Pitt and L. Valiant},
title = {Computational limitations on learning from examples},
journal = jacm,
volume = {35},
year = {1988},
pages = {965--984}
}
@misc{PlVi05,
author = {M. Plenio and S. Virmani},
title = {An introduction to entanglement measures},
year = {2005},
month = {April},
number = {arXiv:quant-ph/0504163v3},
note = {rev.\ 6/10/06}
}
@inproceedings{PoSa94,
author = {D. Polemi and T. Sakkalis},
title = {Singular algebraic curves over finite fields},
booktitle = {Information Theory and Applications---Proceedings,
Third Canadian Workshop, May/June 1993},
series = lncs,
volume = {793},
year = {1994},
pages = {24--37}
}
@inproceedings{PoSp94,
author = {A. Polischuk and D. Spielman},
title = {Nearly-linear size holographic proofs},
booktitle = proc26 # stoc,
year = {1994},
pages = {194--203}
}
@book{PoVi91,
author = {V. Popov and E. Vinberg},
title = {Invariant Theory},
series = {Algebraic Geometry IV, Encyclopedia Math. Sci.},
volume = {55},
publisher = springer,
year = {1991}
}
@article{PRS02,
author = {B. Postow and K. Regan and C. Smith},
title = {{UPSILON}: Universal programming
system with incomplete lazy object notation},
journal = {Fundamenta Informaticae},
volume = {50},
year = {2002},
pages = {325--359}
}
@article{PrSt76,
author = {V. Pratt and L. Stockmeyer},
title = {A characterization of the power of vector machines},
journal = jcss,
volume = {12},
year = {1976},
pages = {198--221}
}
@article{PrSa77,
author = {F. Preparata and D. Sarwate},
title = {Computational complexity of {F}ourier transforms over
finite fields},
journal = {Mathematics of Computation},
volume = {31},
number = {139},
year = {1977},
pages = {740--751}
}
@article{PrVu81,
author = {F. Preparata and J. Vuillemin},
title = {The cube-connected cycles: A versatile network for
parallel computation},
journal = cacm,
volume = {24},
number = {5},
year = {1981},
pages = {300--309}
}
@inproceedings{Pro15,
author = {A.N. Prokopenya},
title = {Approximate Quantum {F}ourier Transform and Quantum Algorithm for Phase Estimation},
booktitle = {Computer Algebra in Scientific Computing},
series = lncs,
volume = {9301},
publisher = springer,
year = {2015},
pages = {391--405}
}
@article{Puc02,
author = {J.-C. Puchta},
title = {Representation of numbers with negative digits and multiplication of small integers},
journal = {Fibonacci Quarterly},
volume = {40},
year = {2002},
pages = {66--67},
note = {Retyped 11/2012 at http://www.math.uni-rostock.de/~schlage-puchta/papers/Negative_digits.pdf}
}
@article{Puc00,
author = {J.-C. Puchta},
title = {Fast multiplication of small integers},
journal = {Southwest Journal of Pure and Applied Mathematics},
volume = {2000},
year = {2000},
pages = {82--83}
}
http://www.fq.math.ca/Scanned/40-1/puchta1.pdf
@article{PuRo92,
author = {P. Pudl{\'a}k and V. R{\"o}dl},
title = {A combinatorial approach to complexity},
journal = {Combinatorica},
volume = {12},
year = {1992},
pages = {221--226}
}
@inproceedings{Pud93,
author = {P. Pudl{\'a}k},
title = {{AC$^0$} circuit complexity},
booktitle = proc9 # fct,
series = lncs,
volume = {710},
publisher = springer,
year = {1993},
pages = {106--120}
}
@article{Pud94,
author = {P. Pudl{\'a}k},
title = {Communication in bounded-depth circuits},
journal = {Combinatorica},
volume = {14},
year = {1994},
pages = {203--216}
}
@article{PuRo94,
author = {P. Pudl{\'a}k and V. R{\"o}dl},
title = {Some combinatorial-algebraic problems from complexity theory},
journal = {Discrete Mathematics},
volume = {136},
year = {1994},
pages = {253--279}
}
@techreport{Pudlak98,
author = {P. Pudl{\'a}k},
title = {A note on the use of the determinant for proving lower bounds on the size of linear circuits},
institution = eccc,
number = {ECCC TR98-42},
year = {1998}
}
@article{QuRi89,
author = {J. Ross Quinlan and R. Rivest},
title = {Inferring decision trees using the minimum description
length principle},
journal = infcomp,
volume = {80},
year = {1989},
pages = {277--248}
}
@misc{Rap04,
author = {Sebastian Raaphorst},
title = {Parallel algebraic algorithms},
year = {2004},
note = {Project in CSI513, Carleton University, Ottawa},
url = {http://www.cs.toronto.edu/~sr/academic/csi5131paper.pdf}
}
@article{Rab63,
author = {M. Rabin},
title = {Real-time computation},
journal = {Israeli Journal of Mathematics},
volume = {1},
year = {1963},
pages = {203--211}
}
@article{Rab80,
author = {M. Rabin},
title = {Probabilistic algorithms in finite fields},
journal = sicomp,
volume = {9},
year = {1980},
pages = {273--280}
}
@article{RaSe81,
author = {C. Rackoff and J. Seiferas},
title = {Limitations on seperating nondeterministic
complexity classes},
journal = sicomp,
volume = {10},
year = {1981},
pages = {742--745}
}
@book{RaWe04,
author = {L. Rade and B. Westergren},
title = {Mathematics Handbook for Science and Engineering, 5th ed.},
publisher = springer,
year = {2004}
}
@article{Rader68,
author = {C.M. Rader},
title = {Discrete {F}ourier transforms when the number of data
samples is prime},
journal = {Proc. IEEE},
year = {1968},
volume = {56},
number = {6},
pages = {1107--1108}
}
@article{RaSu94,
author = {J. Radhakrishnan and K. Subrahmanyam},
title = {Directed monotone contact networks for threshold
functions},
journal = ipl,
volume = {50},
year = {1994},
pages = {199--203}
}
@techreport{Rad93,
author = {S. Radziszowski},
title = {Small {R}amsey numbers},
number = {RIT-TR-93-009},
institution = {Dept.\ of Comp.\ Sci.\, Rochester Inst.\ of
Technology},
month = {February},
year = {1993}
}
@article{RSSW88,
author = {P. Ragde and W. Steiger and E. Szemer{\'e}di
and A. Wigderson},
title = {The parallel complexity of element distinctness is
{$\Omega(\sqrt{{\log n}}) $}},
journal = {SIAM Journal on Discrete Mathematics},
volume = {1},
year = {1988},
pages = {399--410}
}
@inproceedings{RaSt10,
author = {P. Raghavendra and D. Steurer},
title = {Graph expansion and the unique games conjecture},
booktitle = proc42 # stoc,
year = {2010},
note = {to appear}
}
@inproceedings{Ram92,
author = {J. Ramachandran},
title = {Set-bit enumeration is hard},
booktitle = proc7 # structures,
year = {1992},
pages = {58--70}
}
@misc{RaSc93,
author = {J. Ramachandran and T. Schwentick},
title = {A note on set-bit enumeration},
note = {Technical Report, University of Mainz, 11/26/93},
year = {1993}
}
@inproceedings{RaRo92,
author = {D. Ranjan and P. Rohatgi},
title = {On randomized reductions to sparse sets},
booktitle = proc7 # structures,
year = {1992},
pages = {239--242}
}
@techreport{RRW94,
author = {R. Rao and J. Rothe and O. Watanabe},
title = {Upward separation for {FewP} and related classes},
institution = {Computer Science, University of Rochester},
number = {488},
month = {February},
year = {1994}
}
@inproceedings{Raz02,
author = {R. Raz},
title = {On the complexity of matrix product},
booktitle = proc34 # stoc,
year = {2002},
pages = {144--151},
note = {Also ECCC TR 12, 2002}
}
@article{Raz03,
author = {R. Raz},
title = "On the complexity of matrix product",
journal = "SIAM Journal of Computing",
pages = "1356--1369",
volume = 32,
number = 5,
year = 2003,
}
@article{RaSh03,
author = {R. Raz and A. Shpilka},
title = {Lower bounds for matrix product, in arbitrary circuits
with bounded gates},
journal = sicomp,
volume = {32},
year = {2003},
pages = {488-513}
}
@inproceedings{Raz04,
author = {R. Raz},
title = {Multilinear formulas for permanent and determinant
are of super-polynomial size},
booktitle = proc36 # stoc,
year = {2004},
pages = {633--641},
note = {Also ECCC TR03-067}
}
@inproceedings{Raz04b,
author = {R. Raz},
title = {Multilinear {NC$^1 \neq$} multilinear {NC$^2$}},
booktitle = proc45 # focs,
year = {2004},
pages = {344--351}
}
@article{Raz06,
author = {R. Raz},
title = {Separation of multilinear circuit and formula size},
journal = {Theory of Computing},
volume = {2},
year = {2006},
pages = {121--135}
}
@inproceedings{RaYe07,
author = {R. Raz and A. Yehudayoff},
title = {A lower bound for the size of syntactically multilinear
arithmetic circuits},
booktitle = proc48 # focs,
year = {2007}
}
@article{RaYe07b,
author = {R. Raz and A. Yehudayoff},
title = {Balancing syntactically multilinear
arithmetic circuits},
journal = compcomp,
year = {2007},
note = "to appear"
}
@techreport{Raz08,
author = {R. Raz},
title = {Elusive functions and lower bounds for arithmetic circuits},
institution = {Electronic Colloq. on Computational Complexity},
number = {TR08-001},
year = {2008},
note = {To appear in the proceedings of STOC'08}
}
@inproceedings{RaYe08,
author = {R. Raz and A. Yehudayoff},
title = {Lower bounds and separations for constant depth
multilinear circuits},
booktitle = proc23 # ccc,
year = {2008},
note = {to appear}
}
@article{Raz87,
author = {A. Razborov},
title = {Lower bounds for the size of circuits of bounded depth
with basis {$\{\wedge,\oplus\}$}},
journal = {Mathematical Notes, (formerly of the Academy
of Natural Sciences of the USSR)},
volume = {41},
year = {1987},
pages = {333--338}
}
@inproceedings{Raz89,
author = {A. Razborov},
title = {On the method of approximations},
booktitle = proc21 # stoc,
year = {1989},
pages = {167--176}
}
@inproceedings{Raznn,
author = {A. Razborov},
title = {Lower bounds for deterministic and nondeterministic
branching programs},
booktitle = {nnn},
year = {nnn},
pages = {47--60}
}
@article{Raz90,
author = {A. Razborov},
title = {Applications of matrix methods to the theory of lower
bounds in communication complexity},
journal = {Combinatorica},
voume = {10},
year = {1990},
pages = {81--93}
}
@techreport{Raz91,
author = {A Razborov},
title = {{IRTC} Lecture Series in Complexity: Lectures by
A.A. Razborov, including ``Some limitations on the theory of
approximations''},
year = {1991},
institution = {Department of Computer Science, University
of Toronto},
number = {251/91},
note = {Transcribed by S.~Bellantoni and J.\ St.~Jacques}
}
@article{Raz92,
author = {A. Razborov},
title = {On the distributional complexity of disjointness},
journal = tcs,
volume = {106},
year = {1992},
pages = {385--390}
}
@incollection{Raz92b,
author = {A. Razborov},
title = {On submodular complexity measures},
booktitle = {Boolean Function Complexity},
publisher = lms,
series = {Lecture Note Series},
volume = {169},
year = {1992},
pages = {76--83}
}
@techreport{Raz93,
author = {A. Razborov},
title = {Bounded arithmetic and lower bounds in {B}oolean
complexity},
institution = {Stekhlov Mathematical Institute},
address = {Vavilova-42, 117966, GSP-1, Moscow},
year = {1993}
}
@article{RaWi93,
author = {A. Razborov and A. Wigderson},
title = {{$n^{\Omega(\log n)}$} lower bounds on the size of depth-3
threshold circuits with {AND} gates at the bottom},
journal = ipl,
volume = {45},
year = {1993},
pages = {303--307}
}
@inproceedings{RaRu94,
author = {A. Razborov and S. Rudich},
title = {Natural proofs},
booktitle = proc26 # stoc,
year = {1994},
pages = {204--213}
}
@misc{RaRu94j,
author = {A. Razborov and S. Rudich},
title = {Natural proofs},
year = {1994},
note = {Update of STOC paper, November 1994}
}
@article{Raz94,
author = {A. Razborov},
title = {Unprovability of lower bounds on circuit size in
certain fragments of bounded arithmetic},
journal = {Izvestiya of the RAN},
year = {1994},
note = {To appear}
}
@article{RaRu97,
author = {A. Razborov and S. Rudich},
title = {Natural proofs},
journal = jcss,
volume = {55},
year = {1997},
pages = {24--35}
}
@ARTICLE{Razb02,
author = {Alexander A. Razborov},
title = {Quantum Communication Complexity of Symmetric Predicates},
journal = {Izvestiya of the Russian Academy of Science, Mathematics},
year = {2002},
volume = {67},
pages = {2003}
}
@phdthesis{Rec76,
author = {R. Reckhow},
title = {On the lengths of proofs in the propositional calculus},
school = {University of Toronto},
year = {1976},
note = {Computer Science TR \#87}
}
@inproceedings{Reg83a,
author = {K. Regan},
title = {On diagonalization methods and the structure of
language classes},
booktitle = {Proceedings, International Conference
on Foundations of Computation Theory (FCT'83), Borgholm, Sweden,
August 1983},
series = lncs,
volume = {158},
publisher = springer,
year = {1983},
pages = {368--380}
}
@inproceedings{Reg83b,
author = {K. Regan},
title = {Arithmetical degrees of index sets for
complexity classes},
booktitle = {Proceedings, Logic and Machines, M{\"u}nster,
Germany, May 1983},
series = lncs,
volume = {171},
publisher = springer,
year = {1984},
pages = {118--130}
}
@inproceedings{Reg86a,
author = {K. Regan},
title = {A topology of provability in complexity theory},
booktitle = proc1 # structures,
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {291--310}
}
@inproceedings{Reg86b,
author = {K. Regan},
title = {A uniform reduction theorem, extending a result of
{J. Grollmann} and {A. Selman}},
booktitle = proc13 # icalp,
series = lncs,
volume = {226},
publisher = springer,
year = {1986},
pages = {324--333}
}
@misc{Reg86t,
author = {K. Regan},
title = {On the {S}eparation of {C}omplexity {C}lasses},
note = {Dissertation, Oxford University},
year = {1986}
}
@inproceedings{Reg87,
author = {K. Regan},
title = {Unprovably intractable languages},
booktitle = proc2 # structures,
year = {1987},
pages = {69--80}
}
@article{Reg88,
author = {K. Regan},
title = {The topology of provability in complexity theory},
journal = jcss,
volume = {36},
year = {1988},
pages = {384--432}
}
@inproceedings{Reg89,
author = {K. Regan},
title = {Finitary substructure languages},
booktitle = proc4 # structures,
year = {1989},
pages = {87--96}
}
@misc{Reg89p,
author = {K. Regan},
title = {Provable complexity properties and constructive reasoning},
year = {1989},
note = {Draft, in revision}
}
@article{Reg92d,
author = {K. Regan},
title = {Diagonalization, uniformity, and fixed-point theorems},
journal = infcomp,
volume = {98},
year = {1992},
pages = {1--40}
}
@article{Reg92m,
author = {K. Regan},
title = {Minimum-complexity pairing functions},
journal = jcss,
volume = {45},
year = {1992},
pages = {285--295}
}
@techreport{Reg92l,
author = {K. Regan},
title = {Linear time and memory efficient computation},
institution = {Computer Science Department, State University of
NY at Buffalo, TR 92-28},
year = {1992},
}
@misc{Reg92i,
author = {K. Regan},
title = {The complexity of instance contraction},
month = {November},
year = {1992}
}
@misc{ReRo92,
author = {K. Regan and J. Royer},
title = {On closure properties of bounded {2-sided} error
complexity classes},
institution = {Dept. of Computer Science, University at Buffalo},
year = {1992},
note = mst # ", to appear"
}
@techreport{GKRST92,
author = {F. Green and J. K{\"o}bler and K. Regan and
T. Schwentick and J. Tor{\'a}n},
title = {The power of the middle bit of a {\#}{P} function},
institution = {Computer Science Dept., University at Buffalo},
number = {UBCS--TR 92--27},
year = {1992}
}
@techreport{JaRe92,
author = {A. Jagota and K. Regan},
title = {Performance of {MAX-CLIQUE} approximation heuristics under
description-length weighted distributions},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 92--24},
year = {1992}
}
@inproceedings{JaRe96,
author = {A. Jagota and K. Regan},
title = {Testing neural-net optimization algorithms on
highly compressible problem instances},
booktitle = {Proceedings of the 1996 International Conference
on Neural Information and Processing (ICONIP'96), Hong Kong,
September 1996},
year = {1996},
pages = {nnn--nnn+7}
}
@article{JaRe97,
author = {A. Jagota and K. Regan},
title = {Performance of neural net heuristics for {M}aximum {C}lique
on diverse highly compressible graphs},
journal = {Journal of Global Optimization},
volume = {10},
year = {1997},
pages = {439--465},
note = "A shorter version appeared in the proceedings of
the 1996 International Conference
on Neural Information and Processing (ICONIP'96), Hong Kong,
September 1996"
}
@article{JNR97,
author = {A. Jagota and G. Narasimhan and K. Regan},
title = {Information capacity of binary weights associative
memories},
journal = {Neurocomputing},
year = {1997},
note = {to appear}
}
@inproceedings{ReSc92,
author = {K. Regan and T. Schwentick},
title = {On the power of one bit of a {\#}{P} function},
booktitle = proc4 # "Annual Italian Conference on Theoretical Computer Science",
publisher = {World Scientific, Singapore},
year = {1992},
pages = {317--329}
}
@misc{Reg93r,
author = {K. Regan},
title = {Linear time and memory efficient computation},
note = {Revision of UB CS TR 92--28, submitted to
{\em SIAM J. Comput\/}},
year = {1993},
}
@article{Reg93s,
author = {K. Regan},
title = {Machine Models and Linear Time Complexity},
journal = sigact,
volume = {24},
month = {October},
year = {1993},
note = {Guest column, L. Hemachandra ed., ``Complexity Theory Column''},
pages = {5--15}
}
@inproceedings{Reg93i,
author = {K. Regan},
title = {On the difference between {Turing} machine time and
random-access machine time},
booktitle = proc5 # icci,
year = {1993},
pages = {36--40}
}
@inproceedings{Reg93p,
author = {K. Regan},
title = {A new parallel vector model, with exact characterizations
of {NC$^k$}},
booktitle = proc11 # stacs,
volume = {778},
series = lncs,
publisher = springer,
year = {1994},
pages = {289--300}
}
@techreport{Reg93c,
author = {K. Regan},
title = {Constructive formal systems and complexity theory},
institution = {Computer Science Dept., University at Buffalo},
number = {UBCS--TR 93--nn!!},
year = {1993}
}
@inproceedings{Reg93t,
author = {K. Regan},
title = {On the difference between {Turing} machine time and
random-access machine time},
booktitle = proc5 # icci,
year = {1993},
pages = {36--40}
}
@techreport{Reg94,
author = {K. Regan},
title = {Linear time and memory efficient computation},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-18},
note = {Revision of UB-CS-TR 92-28, accepted to
{\it SIAM J.~Comput.}},
year = {1994}
}
@techreport{GKRST94,
author = {F. Green and J. K{\"o}bler and K. Regan and
T. Schwentick and J. Tor{\'a}n},
title = {The power of the middle bit of a {\#}{P} function},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-19},
month = {May},
year = {1994},
note = jcss # ", to appear"
}
@inproceedings{LOR94,
author = {L. Li and M. Ogihara and K. Regan},
title = {On information from {\#P} functions},
booktitle = proc6 # icci,
year = {1994},
pages = {280--295},
note = {The proceedings constitute the first issue of the
electronic journal, {\it Journal of Computing and Information\/}}
}
@techreport{CLLORS94,
author = {J.-Y. Cai and R. Lipton and L. Longpr{\'e} and
M. Ogihara and K. Regan and D. Sivakumar},
title = {Communication complexity of key agreement on limited ranges},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-22},
month = {May},
year = {1994}
}
@techreport{Reg94a,
author = {K. Regan},
title = {Linear time algorithms in memory hierarchies},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-23},
month = {May},
year = {1994},
note = {To appear in the proceedings of the IFIP World Computer
Congress, Hamburg, August 1994}
}
@techreport{Reg94b,
author = {K. Regan},
title = {Linear speed-up, information vicinity, and finite-state
machines},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-24},
month = {May},
year = {1994},
note = {To appear in the proceedings of the IFIP World Computer
Congress, Hamburg, August 1994}
}
@inproceedings{Reg94l,
author = {K. Regan},
title = {Linear time algorithms in memory hierarchies},
booktitle = {Proceedings, 13th IFIP World Computer Congress '94,
Volume~1: Technology and Foundations},
editor = {B. Pehrson and I. Simon},
series = {IFIP Transactions},
volume = {A-51},
publisher = {North-Holland},
year = {1994},
pages = {288--293}
}
@inproceedings{Reg94iv,
author = {K. Regan},
title = {Linear speed-up, information vicinity, and finite-state
machines},
booktitle = {Proceedings, 13th IFIP World Computer Congress '94,
Volume~1: Technology and Foundations},
editor = {B. Pehrson and I. Simon},
series = {IFIP Transactions},
volume = {A-51},
publisher = {North-Holland},
year = {1994},
pages = {609--614}
}
@misc{ReSi94,
author = {K. Regan and D. Sivakumar},
title = {On resource-bounded measure and pseudorandom generators
(preliminary version)},
year = {1994}
}
@techreport{ReSi95,
author = {K. Regan and D. Sivakumar},
title = {Improved Resource-Bounded Borel-Cantelli and Stochasticity
Theorems (Research Note)},
institution = {Department of Computer Science, University
at Buffalo},
number = {UBCS TR 95-08},
year = {1995},
month = {February},
note = {Talk presented at a 1996 Schloss Dagstuhl workshop on
``Algorithmic Information Theory and Randomness,'' July 1996}
}
@misc{DFR95,
author = {R. Downey and M. Fellows and K. Regan},
title = {Parameterized circuit complexity and the {$W$} hierarchy},
year = {1995},
note = "Submitted to " # tcs
}
@misc{Reg94h,
author = {K. Regan},
title = {Linear-time algorithms in memory hierarchies},
year = {1994},
note = {This proceedings.}
}
@article{ReWa94,
author = {K. Regan and J. Wang},
title = {The quasilinear isomorphism challenge},
journal = {SIGACT News},
volume = {25},
year = {1994},
month = {September},
pages = {106--113}
}
@techreport{Reg94i,
author = {K. Regan},
title = {Index sets and presentations of complexity classes
(revised version)},
institution = {Department of Computer Science, University at
Buffalo},
number = {UB-CS TR 94-29},
month = {July},
year = {1994}
}
@techreport{RSC95tr,
author = {K. Regan and D. Sivakumar and J.-Y. Cai},
title = {Pseudorandom generators, measure theory, and natural proofs},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 95-02},
month = {January},
year = {1995}
}
@inproceedings{RSC95,
author = {K. Regan and D. Sivakumar and J.-Y. Cai},
title = {Pseudorandom generators, measure theory, and natural proofs},
booktitle = proc36 # focs,
year = {1995},
pages = {26--35}
}
@techreport{JNR95,
author = {A. Jagota and G. Narasimhan and K. Regan},
title = {Information capacity of binary weights associative memories},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 95-03},
month = {January},
year = {1995}
}
@inproceedings{CLLORS95,
author = {J.-Y. Cai and R. Lipton and L. Longpr{\'e} and
M. Ogihara and K. Regan and D. Sivakumar},
title = {Communication complexity of key agreement on limited ranges},
booktitle = proc12 # stacs,
series = lncs,
volume = {900},
publisher = springer,
year = {1995},
pages = {38--49}
}
@article{ReRo95,
author = {K. Regan and J. Royer},
title = {On closure properties of bounded two-sided error
complexity classes},
journal = mathsys,
volume = {28},
year = {1995},
pages = {229--243}
}
@article{GKRST95,
author = {F. Green and J. K{\"o}bler and K. Regan and
T. Schwentick and J. Tor{\'a}n},
title = {The power of the middle bit of a {\#}{P} function},
journal = jcss,
volume = {50},
year = {1995},
pages = {456--467}
}
@inproceedings{Reg95s,
author = {K. Regan},
title = {On superlinear lower bounds in complexity theory},
booktitle = proc10 # structures,
year = {1995},
pages = {50--64}
}
@article{Reg96,
author = {K. Regan},
title = {Linear time and memory-efficient computation},
journal = sicomp,
volume = {25},
year = {1996},
pages = {133--168}
}
@incollection{Reg97p,
author = {K. Regan},
title = {Polynomials and combinatorial definitions of languages},
booktitle = {Complexity Theory Retrospective II},
editor = {A. Selman and L. Hemaspaandra},
publisher = springer,
year = {1997},
pages = {261--293}
}
@article{ReVo97,
author = {K. Regan and H. Vollmer},
title = {Gap languages and log-time complexity classes},
year = {1997},
journal = tcs,
note = "to appear"
}
@article{ReVo98,
author = {K. Regan and H. Vollmer},
title = {Gap languages and log-time complexity classes},
year = {1998},
journal = tcs,
volume = {nnn},
pages = {nnn--nnn}
}
@article{DFR96,
author = {R. Downey and M. Fellows and K. Regan},
title = {Parameterized circuit complexity and the {$W$} hierarchy},
year = {1996},
journal = tcsa,
note = "to appear"
}
@misc{DFR96a,
author = {R. Downey and M. Fellows and K. Regan},
title = {Descriptive complexity and the {W} hierarchy},
note = {Accepted to the AMS-DIMACS Proceedings Series for the
1996 DIMACS Workshop on ``Feasible Arithmetics and Lengths of Proofs''},
year = {1996}
}
@incollection{DFR97,
author = {R. Downey and M. Fellows and K. Regan},
title = {Descriptive complexity and the {W} hierarchy},
booktitle = {Proof Complexity and Feasible Arithmetics:
DIMACS Workshop, April 21--24, 1996},
editor = {P.~Beame and S.~Buss},
series = {DIMACS Series in Discrete Mathematics and Theoretical
Computer Science},
volume = {39},
publisher = {American Mathematical Society},
year = {1997},
pages = {119--134}
}
@article{DFR98,
author = {R. Downey and M. Fellows and K. Regan},
title = {Parameterized circuit complexity and the {\it W\/}
hierarchy},
journal = tcsa,
volume = {191},
year = {1998},
pages = {97--115}
}
@article{DFR98b,
author = {R. Downey and M. Fellows and K. Regan},
title = {Threshold dominating sets and an improved
characterization of {W[2]}},
journal = tcsa,
volume = {209},
year = {1998},
pages = {123--140}
}
@article{Reg96i,
author = {K. Regan},
title = {Index sets and presentations of complexity classes},
journal = tcs,
volume = {161},
year = {1996},
pages = {263--287}
}
@inproceedings{Reg97,
author = {K. Regan},
title = {Polynomial vicinity circuits and nonlinear lower bounds},
booktitle = {Proceedings, 12th IEEE Conference on Computational
Complexity (formerly Structure in Complexity Theory), Ulm, Germany,
June},
publisher = {IEEE},
address = {New York},
year = {1997},
pages = {61--68}
}
@inproceedings{ReSi98,
author = {K. Regan and D. Sivakumar},
title = {Probabilistic martingales and {BPTIME} Classes},
booktitle = proc13 # ccc,
year = {1998},
pages = {186--200}
}
@Article{Buhrman:2001:GRB,
author = "Harry Buhrman and Dieter van Melkebeek and Kenneth W.
Regan and D. Sivakumar and Martin Strauss",
title = "A Generalization of Resource-Bounded Measure, with
Application to the {BPP} vs. {EXP} Problem",
journal = "SIAM Journal on Computing",
volume = "30",
number = "2",
pages = "576--601",
month = apr,
year = "2001",
coden = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
bibdate = "Fri Oct 27 06:28:40 MDT 2000",
url = "http://epubs.siam.org/sam-bin/dbq/article/34389",
acknowledgement = ack-nhfb,
}
@TechReport{Denis00,
author = "Charles Denis and Kenneth Regan",
title = "On Arithmetical Formulas Whose Jacobians are Groebner
Bases",
institution = "Department of Computer Science and Engineering, SUNY
Buffalo",
number = "2000-07",
month = jul # " 13",
year = "2000",
keywords = "polynomial, ideal, Groebner basis, Jacobian,
computational complexity",
url = "http://www.cse.buffalo.edu/tech-reports/2000-07.ps.Z",
abstract = "We exhibit classes of polynomials whose sets of k-th
partial derivatives form Groebner bases for all k, with
respect to all term orders. The classes are defined by
syntactic constraints on arithmetical formulas defining
the polynomials. Read-once formulas without constants
have this property for all k, while those with
constants have a weaker ``Groebner-bounding'' property
introduced here. For k = 1 the same properties hold
even with arbitrary powering of subterms of the
formulas.",
note = "Fri, 14 Jul 2000 19:59:10 GMT",
}
@article{Reg02,
author = {K. Regan},
title = {Understanding the {M}ulmuley-{S}ohoni approach to
{P vs. NP}},
journal = beatcs,
volume = {78},
month = {October},
year = {2002},
pages = {86--97},
note = {Invited contribution to Lance Fortnow's
Computational Complexity Column}
}
@misc{ReCh09,
author = {K. Regan and A. Chakrabarti},
title = {Quantum circuits, polynomials, and entanglement measures},
year = {2009},
note = {Draft}
}
@misc{ReCh12,
author = {K. Regan and A. Chakrabarti},
title = {Quantum circuits, polynomials, and entanglement measures},
year = {2012},
note = {Draft}
}
@inproceedings{ReHa11,
author = {K. Regan and G. Haworth},
title = {Intrinsic Chess Ratings},
booktitle = {Proceedings of AAAI 2011, San Francisco},
year = {2011}
}
@misc{Reg17,
author = {K. Regan},
title = {Rating Computer Science Via Chess},
year = {2017},
note = {Invited submission to the Springer LNCS 10,000 Anniversary Issue}
}
@article{BGR17,
author = {M.B. Villarino and W. Gasarch and K. Regan},
title = {Hilbert's proof of his {I}rreducibility {T}heorem},
journal = {American Mathematical Monthly},
year = {2017},
note = {Accepted in final form, to appear in 2018}
}
@misc{LGR17,
author = {R. Lipton and C. Guan and K. Regan},
title = {Status of An Attack on Factoring Via Polynomials},
year = {2017},
note = {Intended as journal version of [Lipton, ANTS 1994] with slightly stronger main result.}
}
@article{RCG17,
author = {K. Regan and A. Chakrabarti and C. Guan},
title = {Algebraic and Logical Emulations of Quantum Circuits},
year = {2017},
journal = {Transactions on Computational Science},
series = lncs,
publisher = springer,
note = {Submitted}
}
@article{RCG18,
author = {K. Regan and A. Chakrabarti and C. Guan},
title = {Algebraic and Logical Emulations of Quantum Circuits},
year = {2018},
journal = {Transactions on Computational Science},
series = lncs,
publisher = springer,
volume = {10,730},
pages = {41--76}
}
@inproceedings{RVW00,
author = {O. Reingold and S. Vadhan and A. Wigderson},
title = {Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors},
booktitle = proc41 # focs,
year = {2000},
pages = {3--13}
}
@inproceedings{Rei05,
author = {O. Reingold},
title = {Undirected {ST}-connectivity in log-space},
booktitle = proc37 # stoc,
year = {2005},
pages = {376--385}
}
@article{Rei08,
author = {O. Reingold},
title = {Undirected {ST}-connectivity in log-space},
journal = jacm,
volume = {55},
year = {2008},
pages = {1--24}
}
@ARTICLE{Rei82,
AUTHOR = {R. Reischuk},
TITLE = {A fast implementation of multidimensional storage into a tree
storage},
JOURNAL = tcs,
VOLUME = {19},
YEAR = {1982},
PAGES = {253--266}
}
@inproceedings{ReiSc89,
author = {R. Reischuk and B. Schmeltz},
title = {Area efficient methods to increase the reliability of
combinatorial circuits},
booktitle = proc6 # stacs,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1989},
pages = {314--326}
}
@book{Rei90,
author = {R. Reischuk},
title = {Einf{\"u}hurung in die Komplexit{\"a}tstheorie},
series = {Leitf{\"a}den und Monographien der Informatik},
publisher = {Teubner},
address = {Stuttgart},
year = {1990}
}
@inproceedings{ReiSc91,
author = {R. Reischuk and B. Schmeltz},
title = {Reliable computation with noisy circuits and decision
trees: A general {$n\log n$} lower bound},
booktitle = proc32 # focs,
year = {1991},
pages = {602--611}
}
@inproceedings{ReSc93,
author = {R. Reischuk and C. Schindelhauer},
title = {Precise average case complexity},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {650--661}
}
@inproceedings{ReVa83,
author = {J. Reif and L. Valiant},
title = {A logarithmic time sort for linear size networks},
booktitle = proc15 # stoc,
year = {1983},
pages = {10--16}
}
@article{Reif86,
author = {J.~Reif},
title = {Log depth circuits for algebraic functions},
journal = sicomp,
volume = {15},
year = {1986},
pages = {231--242}
}
@article{ReTa92,
author = {J. Reif and S. Tate},
title = {On threshold circuits and polynomial computation},
journal = sicomp,
volume = {21},
year = {1992},
pages = {896--908}
}
@misc{ReVe97,
author = {R.~Rettinger and R.~Verbeek},
title = {{BPP} equals {BPLINTIME} under an oracle
(extended abstract)},
year = {1997},
month = {November}
}
@ARTICLE{ReSc91,
AUTHOR = {C. Reutenauer and M. Sch\"utzenberger},
TITLE = {Minimization of rational word functions},
JOURNAL = sicomp,
VOLUME = {20},
YEAR = {1991},
PAGES = {669--685}
}
@book{RiPo11,
author = {E. Rieffel and W. Polak},
title = {Quantum Computing: A Gentle Introduction},
year = {2011},
publisher = {MIT Press}
}
@misc{RiSi97,
author = {S. Riis and M. Sitharam},
title = {Non-constant Degree Lower Bounds imply linear Degree Lower Bounds},
note = {Electronic Colloquium on Computational Complexity
Report no.\ TR97-048},
year = {1997}
}
@article{Ris82,
author = {J. Rissanen},
title = {A universal prior for integers and estimation by minimum
description length},
journal = {Ann. Statist.},
volume = {11},
year = {1982},
pages = {416--431}
}
@article{RSA78,
author = {R. Rivest and A. Shamir and L. Adleman},
title = {A method for obtaining digital signatures and
public-key cryptosystems},
journal = cacm,
volume = {21},
year = {1978},
pages = {120--126}
}
@article{Rob91,
author = {J. Robson},
title = {An {$O(T\log T)$} reduction from {RAM} computations
to satisfiability},
journal = tcs,
volume = {82},
year = {1991},
pages = {141--149}
}
@article{Rob92,
author = {J. Robson},
title = {Deterministic simulation of a single-tape {Turing} machine
by a random-access machine in sub-linear time},
journal = infcomp,
volume = {99},
year = {1990},
pages = {109--121}
}
@article{Rob92b,
author = {J. Robson},
title = {More languages of generalised star height 1},
journal = tcs,
volume = {106},
year = {1992},
pages = {327--335}
}
@article{Rob84,
author = {J. Robson},
title = {N by {N} checkers is {E}xptime complete},
journal = sicomp,
volume = {3},
year = {1984},
pages = {252--267}
}
@inproceedings{Rob83,
author = {J. Robson},
title = {The complexity of {G}o},
booktitle = {Proceedings of the IFIP Congress},
year = {1983},
pages = {413--417}
}
@article{FrLi81,
author = {A. Fraenkel and D. Lichtenstein},
title = {Computing a perfect strategy for nxn chess requires time exponential in n"},
journal = {J. Comb. Th. A},
volume = {31},
year = {1981},
pages = {199--14}
}
@article{RoSeII,
author = {N. Robertson and P. Seymour},
title = {Graph minors {II}. {A}lgorithmic aspects of tree-width},
journal = {Journal of Algorithms},
volume = {7},
year = {1986},
pages = {309--322}
}
@misc{RoSeXIII,
author = {N. Robertson and P. Seymour},
title = {Graph minors {XIII}. {T}he disjoint paths problem},
note = {to appear}
}
@misc{RoSeXV,
author = {N. Robertson and P. Seymour},
title = {Graph minors {XV}. {W}agner's conjecture},
note = {to appear}
}
@article{RoSe86,
author = {N. Robertson and P. Seymour},
title = {Graph minors {II}. {A}lgorithmic aspects of tree-width},
journal = {Journal of Algorithms},
volume = {7},
year = {1986},
pages = {309--322}
}
@article{Rog58,
author = {H. Rogers},
title = {G{\"o}del-numberings of the partial recursive functions},
journal = jsl,
volume = {23},
year = {1958},
pages = {331--341}
}
@article{Rog59,
author = {H. Rogers},
title = {Computing degrees of unsolvability},
journal = {Math. Annalen},
volume = {138},
year = {1959},
pages = {125--140}
}
@book{Rog67,
author = {H. Rogers},
year = {1967},
publisher = {McGraw-Hill},
title = {Theory of Recursive Functions and Effective
Computability},
note = {Reprinted, MIT Press, 1987.}
}
@book{Rogers:book,
author = {Rogers, H.},
year = {1967},
publisher = {McGraw-Hill},
title = {Theory of Recursive Functions and Effective
Computability},
note = {Reprinted. MIT Press. 1987.}
}
@inproceedings{Rog95,
author = {J. Rogers},
title = {The isomorphism conjecture holds and one-way functions exist
relative to an oracle},
booktitle = proc10 # structures,
year = {1995},
pages = {90--101}
}
@inproceedings{Roh92,
author = {P. Rohatgi},
title = {Saving queries with randomness},
booktitle = proc7 # structures,
year = {1992},
pages = {71--83},
note = jcss # ", to appear"
}
@phdthesis{Roh93,
author = {P. Rohatgi},
title = {On properties of random reductions},
school = {Cornell University},
number = {TR 93-1386},
year = {1993}
}
@book{Rom92,
author = {S. Roman},
title = {Coding and Information Theory},
publisher = springer,
year = {1992}
}
@book{Rose84,
author = {H. Rose},
title = {Subrecursion: Functions and Hierarchies},
series = {Oxford Logic Guides},
publisher = {Oxford University Press},
year = {1984}
}
@article{RoRy92,
author = {P. Rossmanith and W. Rytter},
title = {Observations on log($n$) time parallel recognition
of unambiguous cfl's},
journal = ipl,
volume = {44},
year = {1992},
pages = {267--272}
}
@techreport{Rot94,
author = {J. Rothe},
title = {A promise class at least as hard as the polynomial
hierarchy},
institution = {Computer Science, University of Rochester},
number = {484},
month = {January},
year = {1994}
}
@article{RoBe08,
author = {M. R{\"o}tteler and T. Beth},
title = {Representation-theoretical properties of the approximate quantum {F}ourier transform},
journal = {Applicable Algebra in Engineering, Communication and Computing},
volume = {19},
year = {2008},
pages = {117--193}
}
@inproceedings{Roy09,
author="Swapnoneel Roy",
title="Strip Exchanging is Hard",
booktitle="ECCC Tech Report TR09-095",
year="2009"
}
@BOOK{RC94,
AUTHOR = {James S. Royer and John Case},
TITLE = {Subrecursive Programming Systems:
{C}omplexity \& Succinctness},
PUBLISHER = {Birh\"{a}user},
YEAR = {1994},
SERIES = {Progress in Theoretical Computer Science},
NOTE = {ISBN 0-8176-3767-2},
PRICE = {\$49.50}
}
@inproceedings{Roy95,
author = {J. Royer},
title = {Semantics versus syntax versus computations},
booktitle = proc10 # structures,
year = {1995},
pages = {37--48}
}
@inproceedings{RuFi65,
author = {S. Ruby and P. Fischer},
title = {Translational methods and computational complexity},
booktitle = {Proceedings, Sixth Annual IEEE Symposium on
Switching Circuit Theory and Logical Design (now FOCS)},
year = {1965},
pages = {173--178}
}
@inproceedings{Rud97,
author = {S. Rudich},
title = {Super-bits, Demi-bits, and {NQP}-natural Proofs},
booktitle = {Proceedings of Random'97},
year = {1997},
note = {to appear}
}
@inproceedings{RU10,
author = {Atri Rudra and
Steve Uurtamo},
title = {Data Stream Algorithms for Codeword Testing},
booktitle = {Proceedings of the 37th International
Colloquium on Automata, Languages and Programming (ICALP)},
year = {2010},
pages = {629--640},
ee = {http://dx.doi.org/10.1007/978-3-642-14165-2_53},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{RU10-random,
author = {Atri Rudra and
Steve Uurtamo},
title = {Two Theorems on List Decoding - (Extended Abstract)},
booktitle = {Proceedings of the 14th Intl. Workshop on Randomization and Computation (RANDOM)},
year = {2010},
pages = {696--709},
ee = {http://dx.doi.org/10.1007/978-3-642-15369-3_52},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@misc{RuWa94,
author = {P. Ruzicka and J. Waczulik},
title = {On time-space trade-offs in dynamic graph pebbling},
year = {1994}
}
@article{Ruz80,
author = {W. Ruzzo},
title = {Tree-size bounded alternation},
journal = jcss,
volume = {21},
year = {1980},
pages = {218--235}
}
@ARTICLE{Ruz81,
AUTHOR = {W. Ruzzo},
TITLE = {On uniform circuit complexity},
JOURNAL = jcss,
VOLUME = {22},
YEAR = {1981},
PAGES = {365--383}
}
@article{RST84,
author = {W. Ruzzo and J. Simon and M. Tompa},
title = {Space-bounded hierarchies and probabilistic computation},
journal = jcss,
volume = {28},
year = {1984},
pages = {216--230}
}
@book{Rys63,
author = {H.J. Ryser},
title = {Combinatorial Mathematics},
series = {Carus Mathematical Monograph},
volume = {14},
publisher = {Mathematical Association of America},
year = {1963}
}
@article{Ryt83,
author = {W. Rytter},
title = {A simulation result for two-way pushdown automata},
journal = ipl,
volume = {16},
year = {1983},
pages = {199--202}
}
@article{Ryt86,
author = {W. Rytter},
title = {The space complexity of the unique decipherability problem},
journal = ipl,
volume = {23},
year = {1986},
pages = {1--3}
}
@book{Sac63,
author = {G. Sacks},
title = {Degrees of Unsolvability},
series = {Ann. of Math. Stud.},
volume = {55},
publisher = {Princeton Univ. Pr.},
year = {1963},
note = {Rev. ed. 1966}
}
@article{SaPe13,
author = {M. Saeedi and M. Pedram},
title = {Linear-Depth Quantum Circuits for n-qubit {T}offoli gates with no Ancilla},
journal = {Phys. Rev. A},
volume = {87},
year = {2013},
pages = {062318},
note = {Plus comment by M.-X. Luo and H.-R. Li at https://journals.aps.org/pra/abstract/10.1103/PhysRevA.94.026301}
}
@book{SST99,
author = {M. Saito and B. Sturmfels and N. Takayama},
title = {Gr{\"o}bner Deformations of Hypergeometric Differential
Equations},
publisher = springer,
series = {Algorithms and Computations in Mathematics},
year = {1999}
}
@article{Sak91,
author = {S. Sakata},
title = {Decoding binary {2-D} cyclic codes by the {2-D}
{Berlekamp-Massey} algorithm},
journal = itit,
volume = {37},
year = {1991},
month = {July},
pages = {1200--1203}
}
@inproceedings{SaZa93,
author = {M. Saks and F. Zaharoglou},
title = {Wait-free {$k$}-set agreement is impossible: The
topology of public knowledge},
booktitle = proc25 # stoc,
year = {1993},
pages = {101--110}
}
@inproceedings{SSZ95,
author = {M. Saks and A. Srinivasan and S. Zhou},
title = {Explicit dispersers with polylog degree},
booktitle = proc27 # stoc,
year = {1995},
pages = {479--488}
}
@inproceedings{SaYu90,
author = {K. Salomaa and S. Yu},
title = {Degrees of nondeterminism for pushdown automata},
booktitle = {nnn},
year = {1990},
pages = {380--389}
}
@article{SaFu90,
author = {L. Sanchis and M. Fulk},
title = {On the efficient generation of language instances},
journal = sicomp,
volume = {19},
year = {1990},
pages = {281--296}
}
@article{San93,
author = {L. Sanchis},
title = {On the effective generation of set elements within
specified ranges},
journal = mst,
volume = {26},
year = {1993},
pages = {327--341}
}
@inproceedings{SBBKP04,
author = {Tian Sang and Fahiem Bacchus and Paul Beame and Henry Kautz and Toniann Pitassi},
title = {Combining Component Caching and Clause Learning for Effective Model Counting},
booktitle = {Seventh International Conference on Theory and Applications of Satisfiability Testing, Vancouver},
year = {2004}
}
@inproceedings{SBK05,
author = {Tian Sang and Paul Beame and Henry Kautz},
title = {Heuristics for Fast Exact Model Counting},
booktitle = {Eighth International Conference on Theory and Applications of Satisfiability Testing, Edinburgh, Scotland},
year = {2005}
}
@inproceedings{SBK05b,
author = {Tian Sang and Paul Beame and Henry Kautz},
title = {Performing {B}ayesian Inference by Weighted Model Counting},
booktitle = {Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), Pittsburgh, PA},
year = {2005}
}
@INCOLLECTION{San87,
AUTHOR = {M. Santha},
TITLE = {Relativized {A}rthur-{M}erlin vs. {M}erlin-{A}rthur games},
BOOKTITLE = {Foundations of Software Theory and Theoretical Computer Science},
YEAR = {1987},
PAGES = {437--442},
PUBLISHER = springer,
SERIES = {Lecture Notes in Computer Science No.~287}
}
@inproceedings{San08,
author = {M. Santha},
title = {Quantum walk based search algorithms},
booktitle = proc5 # "Theory and Applications of Models of Computation",
series = lncs,
volume = {4978},
publisher = springer,
year = {2008},
pages = {31--46}
}
@article{Sar77,
author = {D. Sarwate},
title = {On the complexity of decoding {Goppa} codes},
journal = itit,
volume = {nnn},
year = {1977},
pages = {515--516}
}
@article{Sar80,
author = {D. Sarwate},
title = {A note on universal classes of hash functions},
journal = ipl,
volume = {10},
year = {1980},
pages = {41--45}
}
@article{Sav72,
author = {J. Savage},
title = {Computational work and time on finite machines},
journal = jacm,
volume = {19},
year = {1972},
pages = {660--674}
}
@article{Sav70,
author = {W. Savitch},
title = {Relationship between nondeterministic and deterministic
tape complexities},
journal = jcss,
volume = {4},
year = {1970},
pages = {177--192}
}
@inproceedings{SaVi77,
author = {W. Savitch and P. Vit\'{a}nyi},
title = {Linear time simulation of multihead {T}uring machines with
head-to-head jumps},
booktitle = proc4 # icalp,
series = lncs,
volume = {52},
publisher = springer,
year = {1977},
pages = {453--464}
}
@article{SKI94,
author = {S. Sawato and T. Kasai and S. Iwata},
title = {Exhaustive computation to derive the lower bound for
sorting 13 items},
journal = {IEICE Trans. Inf.\ Sys.},
volume = {E77-D},
year = {1994},
pages = {1027--1031}
}
@article{Sax94,
author = {S. Saxena},
title = {Two-coloring linked lists is {NC$^1$}-complete for
lograithmic space},
journal = ipl,
volume = {49},
year = {1994},
pages = {73--76}
}
@inproceedings{Scha78,
author = {T. Schaefer},
title = {The complexity of satisfiability problems},
booktitle = proc10 # stoc,
year = {1978},
pages = {216--226}
}
@inproceedings{Schi93,
author = {I. Schiermeyer},
title = {Solving 3-satisfiability in less than {$1,579^b$} steps},
booktitle = proc6 # csl,
series = lncs,
volume = {702},
publisher = springer,
year = {1993},
pages = {379--394}
}
@article{Schm85,
author = {D. Schmidt},
title = {The recursion-theoretic structure of complexity classes},
journal = tcs,
volume = {38},
year = {1985},
pages = {143--156}
}
@inproceedings{Schm90,
author = {M. Schmidt},
title = {On the power of several queues},
booktitle = {nnn},
year = {1990},
pages = {64--75}
}
@article{Schm09,
author = {Kai-Uwe Schmidt},
title = {{$Z_4$}-valued quadratic forms and quaternary sequence families},
journal = itit,
volume = {55},
year = {2009},
pages = {5803--5810}
}
@article{ScSt89,
author = {W. Schnitzlein and H.-J. Stoss},
title = {Linear-time simulation of multihead {Turing} machines},
journal = infcomp,
volume = {81},
year = {1989},
pages = {353--363}
}
@article{Schn71,
author = {C.P. Schnorr},
title = {A unified approach to the definition of random sequences},
journal = mst,
volume = {5},
year = {1971},
pages = {246--258}
}
@book{Schn71b,
author = {C.P. Schnorr},
title = {Zuf{\"a}lligkeit und Wahrscheinlichkeit},
series = lnm,
volume = {218},
publisher = springer,
year = {1971}
}
@article{Schn73,
author = {C.P. Schnorr},
title = {Process complexity and effective random tests},
journal = jcss,
volume = {7},
year = {1973},
pages = {376--388}
}
@article{Schn76,
author = {C. Schnorr},
title = {The network complexity and the {Turing} machine complexity
of finite functions},
journal = {Acta Informatica},
volume = {7},
year = {1976},
pages = {95--107}
}
@ARTICLE{Schn78,
AUTHOR = {C. Schnorr},
TITLE = {Satisfiability is quasilinear complete in {NQL}},
JOURNAL = jacm,
VOLUME = {25},
YEAR = {1978},
PAGES = {136--145}
}
@inproceedings{Schn88,
author = {C. Schnorr},
title = {The multiplicative complexity of {B}oolean functions},
booktitle = proc6 # "Symposium on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {45--58}
}
@inproceedings{ScvL89,
author = {B. Scholten and J. van Leeuwen},
title = {Structured {NC}},
booktitle = {The Proceedings of the 1989 Workshop on
Algorithms and Data Structures},
publisher = springer,
year = {1989},
pages = {487--498}
}
@article{ScSt71,
author = {A. Sch{\"o}nhage and V. Strassen},
title = {Schnelle {M}ultiplikation grosser {Z}ahlen},
journal = {Computing {\rm Arch. Elektron. Rechnen}},
volume = {7},
year = {1971},
pages = {281--292}
}
@ARTICLE{Sch80,
AUTHOR = {A. Sch{\"o}nhage},
TITLE = {Storage modification machines},
JOURNAL = sicomp,
VOLUME = {9},
YEAR = {1980},
PAGES = {490--508}
}
@article{Sch88,
author = {A. Sch{\"o}nhage},
title = {A nonlinear lower bound for random-access machines
under logarithmic cost},
journal = jacm,
volume = {35},
year = {1988},
pages = {748--754}
}
@article{Schoning82,
author = {U. Sch{\"o}ning},
title = {A uniform approach to obtain diagonal sets in complexity
classes},
journal = tcs,
volume = {18},
year = {1982},
pages = {95--103}
}
@article{Schoning83,
author = {U. Sch{\"o}ning},
title = {A low and a high hierarchy within {NP}},
journal = jcss,
volume = {27},
year = {1983},
pages = {14--28}
}
@BOOK{Schoning85,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {Complexity and Structure},
PUBLISHER = {Springer-Verlag},
YEAR = {1985},
VOLUME = {211},
SERIES = lncs
}
@article{Schoning85a,
author = {U. Sch{\"o}ning},
title = {Robust algorithms: a different approach to oracles},
journal = tcs,
volume = {40},
year = {1985},
pages = {57--66}
}
@ARTICLE{Schoning88,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {Graph isomorphism is in the low hierarchy},
JOURNAL = jcss,
YEAR = {1988},
VOLUME = {37},
PAGES = {312-323}
}
@ARTICLE{Schoning89,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {Probabilistic complexity classes and lowness},
JOURNAL = jcss,
YEAR = {1989},
VOLUME = {39},
PAGES = {84--100}
}
@INCOLLECTION{Schoning90,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {The power of counting},
BOOKTITLE = {Complexity Theory Retrospective},
EDITOR = {A. Selman},
YEAR = {1990},
PAGES = {204--223},
PUBLISHER = {Springer-Verlag}
}
@techreport{SPM05,
author = {Marcus Schoo and Krzysztof Pawlikowski and Don McNickle},
title = {A Survey and Empirical Comparison of Modern Pseudo-Random
Number Generators for Distributed Stochastic Simulations},
institution = {University of Canterbury, Christchurch, New Zealand},
year = {2005},
number = {TR-COSC 03/05}
}
@article{Sch83,
author = {A. Schorr},
title = {Physical parallel devices are not much faster than
sequential ones},
journal = ipl,
volume = {17},
year = {1983},
pages = {103--106}
}
@InProceedings{ScWa95,
author = "R. Schuler and O. Watanabe",
title = "Towards Average-Case Complexity: Analysis of {NP}
Optimization Problems",
pages = "148--161",
booktitle = proc10 # structures,
year = "1995",
}
@article{Schu92,
author = {L. Schulman},
title = {Sample spaces uniform on neighborhoods},
booktitle = proc24 # stoc,
year = {1992},
pages = {17--25}
}
@ARTICLE{Schu95,
author = "B. Schumacher",
title = "Quantum coding",
journal = "Physical Review A",
volume = "51(4)",
year = "1995",
pages = "2738-2747"
}
@article{Schu65,
author = {M.P. Sch{\"u}tzenberger},
title = {On finite monoids having only trivial subgroups},
journal = infcon,
volume = {8},
year = {1965},
pages = {190--194}
}
@incollection{Schu66,
author = {M.P. Sch{\"u}tzenberger},
title = {On a family of sets related to McNaughton's {$L$}-language},
booktitle = {Automata Theory},
editor = {E.R. Caianello},
publisher = {Academic Press},
address = {New York, NY},
year = {1966},
pages = {320--324}
}
@article{Schw80,
author = {J.T. Schwartz},
title = {Ultracomputers},
journal = {ACM Transactions on Programming Languages and Systems},
volume = {2},
year = {1980},
pages = {484--521}
}
@article{Schw80b,
author = {J.T. Schwartz},
title = {Fast probabilistic algorithms for polynomial identities},
journal = jacm,
volume = {27},
year = {1980},
pages = {701--717}
}
@article{Schw88,
author = {N. Schwartz},
title = {Stability of Gr{\"o}bner bases},
journal = {Journal of Pure and Applied Algebra},
year = {1988},
volume = {53},
pages = {171--186}
}
@article{ScLo87,
author = {A.M. Schwartz and M. Loui},
title = {Dictionary machines on cube-class networks},
journal = ieeetc,
volume = {C-36},
year = {1987},
pages = {100--105}
}
@misc{Schw91,
author = {T. Schwentick},
title = {The complexity of computing the middle bit of a \#P function},
institution = {Informatik, University of Mainz},
month = {September},
year = {1991}
}
@inproceedings{Schw94,
author = {T. Schwentick},
title = {Graph connectivity and monadic {NP}},
booktitle = proc35 # focs,
year = {1994},
pages = {614--622}
}
@inproceedings{Schw97,
author = {T. Schwentick},
title = {Algebriac and logical characterizations of deterministic
linear time classes},
booktitle = proc14 # stacs,
year = {1997},
pages = {nnn--nnn}
}
@article{SeMc76,
author = {J. Seiferas and R. McNaughton},
title = {Regularity-preserving relations},
journal = tcs,
volume = {2},
year = {1976},
pages = {147--154}
}
@article{Sei77,
author = {J. Seiferas},
title = {Iterative arrays with direct central control},
journal = {Acta Informatica},
volume = {8},
year = {1977},
pages = {177--192}
}
@INCOLLECTION{Sei90,
AUTHOR = {J. Seiferas},
TITLE = {Machine-independent complexity theory},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990}
}
@article{SFM78,
author = {J. Seiferas and M. Fischer and A. Meyer},
title = {Separating nondeterministic time complexity classes},
journal = jacm,
volume = {25},
year = {1978},
pages = {146--167}
}
@techreport{Sel01,
author = "K.K. Selig",
title = "Uncertainty principles revisited",
institution = "Technische Universitat Munchen",
number = "http://ww-lit-ma.tum.de/veroeff/quel/010.47001.pdf",
year = 2001
}
@article{Sel79,
author = {A. Selman},
title = {{P}-selective sets, tally languages, and the behavior of
polynomial time reducibilities on {NP}},
journal = mathsys,
volume = {13},
year = {1979},
pages = {55--65}
}
@ARTICLE{Sel82,
AUTHOR = {A. Selman},
TITLE = {Reductions on {$\NP$} and p-selective sets},
JOURNAL = tcs,
YEAR = {1982},
VOLUME = {19},
PAGES = {287--304}
}
@article{SMB83,
author = {A. Selman and X. Mei-Rui and R. Book},
title = {Positive relativizations of complexity classes},
journal = sicomp,
volume = {12},
year = {1983},
pages = {565--579}
}
@article{Sel88,
author = {A. Selman},
title = {Natural self-reducible sets},
journal = sicomp,
volume = {17},
year = {1988},
pages = {989--996}
}
@article{Sel88b,
author = {A. Selman},
title = {Promise problems complete for complexity classes},
journal = infcomp,
volume = {78},
year = {1988},
pages = {87--98}
}
@techreport{Sel91,
author = {A. Selman},
title = {A taxonomy of complexity classes of functions},
institution = {Dept. of Comp. Sci., SUNY / Buffalo},
number = {91--12},
year = {1991},
note = {Revised June 1992, to appear in {\em J. Comp. Sys. Sci.}}
}
@article{Sel94,
author = {A. Selman},
title = {A taxonomy of complexity classes of functions},
journal = jcss,
volume = {48},
year = {1994},
pages = {357--381}
}
@misc{Selke06,
author = {J. Selke},
title = {Autoreducibility and friends: About measuring redundancy
in sets},
year = {2006},
institution = {University of Hannover},
note = {Master's Thesis}
}
@inproceedings{Sen94,
author = {N. Sendrier},
title = {Product codes and the {S}ingleton bound},
booktitle = {Algebraic Coding---First French-Israeli Workshop,
Paris, July 1993},
series = lncs,
volume = {781},
publisher = springer,
year = {1994},
pages = {304--315}
}
@inproceedings{ShBr94,
author = {J. Shallit and Y. Breitbart},
title = {Automaticity: properties of a measure of descriptional
complexity},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {619--630}
}
@article{Sha94,
author = {J. Shallit},
title = {Numeration systems, linear recurrences, and regular sets},
journal = infcomp,
volume = {113},
year = {1994},
pages = {331--347}
}
@techreport{ShSn77,
author = {E. Shamir and M. Snir},
title = {Lower bound on the number of multiplication and the
number of additions in monotone computations},
institution={IBM Thomas J. Watson Research Center},
year = {1977},
note={Research Report RC6757}
}
@article{ShSn80,
author = {E. Shamir and M. Snir},
title={On the depth complexity of formulas},
journal=mst,
year = {1980},
pages = {301-322},
volume = {13}
}
@article{Sha92,
author = {A. Shamir},
title = {{IP = PSPACE}},
journal = jacm,
volume = {39},
year = {1992},
pages = {869--877}
}
@ARTICLE{Sha48,
author = "C.E. Shannon",
title = "A mathematical theory of communication",
journal = "Bell System Technical Journal",
volume = "27",
year = "1948",
pages = "379-423, 623-656"
}
@techreport{Shen91,
author = {A. Shen},
title = {A strange application of {K}olmogorov complexity},
institute = {Centrum voor Wiskunde en Informatik, Amsterdam},
number = {CS-R9328},
year = {1991}
}
@article{Shen92,
author = {A. Shen},
title = {{IP = PSPACE: S}implified proof},
journal = jacm,
volume = {39},
year = {1992},
pages = {878--880}
}
@article{Shen93,
author = {B.-Z. Shen},
title = {A {J}ustesen construction of binary concatenated codes
than asymptotically meet the {Z}yablov bound for low rate},
journal = itit,
volume = {39},
number = {1},
year = {1993},
month = {January},
pages = {239--242}
}
@article{ShLo94,
author = {M.-J. Sheu and T. Long},
title = {The extended low hierarchy is an infinite hierarchy},
journal = sicomp,
volume = {23},
year = {1994},
pages = {488--509}
}
@article{Shi03,
author = {Y. Shi},
title = {Both {T}offoli and {C}ontrolled-{NOT} need little
help to do universal quantum computation},
journal = {Quantum Information and Computation},
volume = {3},
year = {2003},
pages = {84--92},
note = {arXiv:quant-ph/0205115}
}
@article{Shok92,
author = {M.A. Shokrollah},
title = {Optimal algorithms for multiplication in certain finite
fields using elliptic curves},
journal = sicomp,
volume = {21},
year = {1992},
pages = {1993--1998}
}
@inproceedings{Sho88,
author = {V. Shoup},
title = {New algorithms for finding irreducible polynomials over
finite fields},
booktitle = proc29 # focs,
year = {1988},
pages = {283--290}
}
@inproceedings{Sho90,
author = {V. Shoup},
title = {Searching for primitive roots in finite fields},
booktitle = proc22 # stoc,
year = {1990},
pages = {546--554}
}
@article{Sho90b,
author="Victor Shoup",
title="New Algorithms for Finding Irreducible Polynomials over Finite Fields",
journal="Mathematics of Computation",
year="1990",
volume="54",
pages="435--447"
}
@book{Sho08,
author = {Shoup, Victor},
title = {A computational introduction to number theory and algebra},
year = {2008},
publisher = {Cambridge University Press},
address = {New York, NY, USA},
}
@inproceedings{ShSm91,
author = {V. Shoup and R. Smolensky},
title = {Lower bounds for polynomial evaluation and interpolation},
booktitle = proc32 # focs,
year = {1991},
pages = {378--383}
}
@article{Sho92,
author = {V. Shoup},
title = {Searching for primitive roots in finite fields},
journal = {Mathematics of Computation},
volume = {58},
year = {1992},
pages = {369--380}
}
@INPROCEEDINGS{Shor94,
author = "P. W. Shor",
title = "Algorithms for quantum computation: Discrete logarithms and factoring",
booktitle = "Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science",
year = "1994",
pages = "124-134"
}
@ARTICLE{Shor95,
author = "P.W. Shor",
title = "Scheme for reducing decoherence in quantum computer memory",
journal = "Physical Review Letters",
volume = "52(4)",
year = "1995",
pages = "R2493-R2496"
}
@INPROCEEDINGS{Shor96,
author = "P. W. Shor",
title = "Fault-tolerant quantum computation",
booktitle = "Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science",
year = "1996",
pages = "56-65"
}
@ARTICLE{SD96,
author = "P.W. Shor and D. DiVincenzo",
title = "Fault tolerant error correction with efficient quantum codes",
journal = "Physical Review Letters",
volume = "77",
year = "1996",
pages = "3260-3263"
}
@article{Shor97,
author = {P. Shor},
title = {Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer},
journal = sicomp,
volume = {26},
year = {1997},
pages = {1484--1509}
}
@ARTICLE{Shor03,
author = "P.W. Shor",
title = "Why haven't more quantum algorithms been found? ",
journal = "Journal of the ACM",
volume = "50(1)",
year = "2003",
pages = "87-90"
}
@article{Shp00,
author = {I. Shparlinski},
title = {Linear complexity of the {Naor-Reingold}
pseudo-random function},
journal = ipl,
volume = {76},
year = {2000},
pages = {95--99}
}
@techreport{ShWi99,
author = {A. Shpilka and A. Wigderson},
title = {Depth-3 arithmetic formulae over fields of
characteristic zero},
institution = {ECCC},
number = {23},
year = {1999}
}
@article{ShWi01,
author = {A. Shpilka and A. Wigderson},
title = {Depth-3 arithmetic formulae over fields of
characteristic zero},
journal = {Computational Complexity},
volume = {10},
year = {2001},
pages = {1--27}
}
@inproceedings{Shp01,
author = {A. Shpilka},
title = {Affine projections of symmetric polynomials},
booktitle = proc16 # ccc,
year = {2001},
pages = {160--171}
}
@article{Shp02,
author = {A. Shpilka},
title = {Affine projections of symmetric polynomials},
journal = jcss,
volume = {65},
year = {2002},
pages = {639--659}
}
@misc{ShTa10,
author = {A. Shpilka and A. Tal},
title = {On the minimal {F}ourier degree of symmetric {B}oolean
functions},
year = {2010},
note = {http://www.cs.technion.ac.il/{$\sim$}shpilka/publications/ShpilkaTal10.pdf}
}
@article{SAetal92,
author = {H. Siegel and S. Abraham and W. Bain and K. Batcher
and T. Casavant and D. DeGroot and J. Dennis and D. Douglas and T.-Y. Feng
and J. Goodman and A. Huang and H. Jordan and J.R. Jump and Y. Patt
and A.J. Smith and J. Smith and L. Snyder and H. Stone and R. Tuck and B. Wah},
title = {{Report of the Purdue Workshop on Grand Challenges
in Computer Architecture for the Support of High Performance Computing}},
journal = jpdc,
volume = {16},
year = {1992},
pages = {199--211}
}
@article{SiWe93,
author = {D. Sieling and I. Wegener},
title = {Reduction of {OBDD}s in linear time},
journal = ipl,
volume = {48},
year = {1993},
pages = {139--144}
}
@article{SiWe93s,
author = {D. Sieling and I. Wegener},
title = {Reduction of {OBDD}s in linear time},
journal = {IPL},
volume = {48},
year = {1993},
pages = {139--144}
}
@article{Sil90,
author = {R. Silverman},
title = {Parallel polynomial arithmetic over finite rings},
journal = jpdc,
volume = {10},
year = {1990},
pages = {265--270}
}
@phdthesis{Sim75,
author = {J. Simon},
title = {On some central problems in computational complexity},
school = {Cornell University},
year = {1975}
}
@ARTICLE{Sim97,
author = "D.R. Simon",
title = "On the power of quantum computation",
journal = "SIAM Journal on Computing",
volume = "26(5)",
year = "1997",
pages = "1474-1483"
}
@inproceedings{Sip82,
author = {M. Sipser},
title = {On relativization and the existence of complete sets},
booktitle = proc9 # icalp,
series = lncs,
volume = {140},
publisher = springer,
year = {1982},
pages = {523--531}
}
@inproceedings{Sip83,
author = {M. Sipser},
title = {Borel sets and circuit complexity},
booktitle = proc15 # stoc,
year = {1983},
pages = {61--69}
}
@inproceedings{Sip83b,
author = {M. Sipser},
title = {A complexity-theoretic approach to randomness},
booktitle = proc15 # stoc,
year = {1983},
pages = {330--335}
}
@article{Sip88,
author = {M. Sipser},
title = {Expanders, randomness, or time versus space},
journal = jcss,
volume = {36},
year = {1988}
}
@inproceedings{Sip92,
author = {M. Sipser},
title = {The history and status of the {P} versus {NP} question},
booktitle = proc24 # stoc,
year = {1992},
pages = {603--618}
}
@inproceedings{Sit94,
author = {M. Sitharam},
title = {Pseudorandom generators and learning algorithms
for {AC$^0$}},
booktitle = proc26 # stoc,
year = {1994},
pages = {478--486}
}
@phdthesis{Siv96,
author = {D. Sivakumar},
title = {Probabilistic Techniques in Structural Complexity Theory},
school = {Computer Science Department, State Univ.\ of NY at Buffalo},
year = {1996},
month = {August}
}
@article{Sky83,
author = {S. Skyum},
title = {A measure in which {B}oolean negation is exponentially
powerful},
journal = ipl,
volume = {17},
year = {1983},
pages = {125--128}
}
@article{SkVa85,
author = {S. Skyum and L. Valiant},
title = {A complexity theory based on {B}oolean algebra},
journal = jacm,
volume = {32},
year = {1985},
pages = {484--502}
}
@article{Slepian78,
author = "D. Slepian",
title = "Prolate Spheroidal wave functions, {F}ourier analysis, and uncertainty - V: The discrete case",
pages = "1371--1430",
journal = "Bell System Technical Journal",
volume = "57(5)",
year = 1978
}
@ARTICLE{SvEB88,
AUTHOR = {C. Slot and P. van Emde Boas},
TITLE = {The problem of space invariance for sequential machines},
JOURNAL = infcomp,
VOLUME = {77},
YEAR = {1988},
PAGES = {93--122}
}
@inproceedings{Smo87,
author = {R. Smolensky},
title = {Algebraic methods in the theory of lower bounds for
{B}oolean circuit complexity},
booktitle = proc19 # stoc,
year = {1987},
pages = {77--82}
}
@inproceedings{Smo93,
author = {R. Smolensky},
title = {On representations by low-degree polynomials},
booktitle = proc34 # focs,
year = {1993},
pages = {130--138}
}
@article{Smo82,
author = {C. Smory{\'n}ski},
title = {The varieties of arboreal experience},
journal = {Mathematical Intelligencer},
volume = {nnn},
year = {1982},
pages = {182--189}
}
@book{Smo91,
author = {C. Smory{\'n}ski},
title = {Logical Number Theory {I}: An Introduction},
publisher = {Springer Verlag},
year = {1991}
}
@book{Smu61,
author = {R. Smullyan},
title = {Theory of Formal Systems},
series = {Annals of Mathematics Studies},
volume = {47},
publisher = {Princeton University Press},
address = {Princeton, NJ},
year ={1961}
}
@book{Smu78,
author = {R. Smullyan},
title = {What Is the Name of This Book?},
publisher = {Prentice-Hall},
year = {1978}
}
@techreport{Snir80,
author = {M. Snir, M. Jerrum},
title = {Some exact results for straight-line computation over semi-rings} ,
institution={University of Edinburg},
year = {1980},
note={Research Report CRS-58-80}
}
@article{Snir85,
author = {M. Snir},
title = {On parallel searching},
journal = sicomp,
volume = {14},
year = {1985},
pages = {688--708}
}
@book{Soa87,
author = {R. Soare},
title = {Recursively Enumerable Sets and Degrees},
publisher = springer,
address = {New York},
year = {1987}
}
@report{SoHa05,
author = {R. Somaraju and L.W. Hanlen },
title = {Uncertainty Principles for Signal Concentrations},
year = {2005},
note = {at arxiv.org/cs.IT/0512030}
}
@misc{SPECCPU2006,
author = {Spec.org and B. Butscher and H, Weimer},
title = {462.libquantum SPEC CPU2006 Benchmark Description},
year = {2006},
howpublished = {https://www.spec.org/cpu2006/Docs/462.libquantum.html}
}
@incollection{Spe93,
author = {J. Spencer},
title = {The {J}anson inequality},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {421--432}
}
@inproceedings{Spi95,
author = {D. Spielman},
title = {Linear-time encodable and decodable error-correcting codes},
booktitle = proc27 # stoc,
year = {1995},
pages = {388--397}
}
@inproceedings{SpTe96,
author = {D. Spielman and S.-H. Teng},
title = {Spectral partitioning works: Planar graphs and finite element
meshes},
booktitle = proc37 # focs,
year = {1996},
pages = {96--105}
}
@inproceedings{Spi71,
author = {M. Spira},
title = {On time-hardware complexity tradeoffs for {Boolean}
functions},
booktitle = {Proceedings of the Fourth International Symposium
on Systems Sciences},
publisher = {Western Periodicals},
address = {North Hollywood, California},
year = {1971},
pages = {525--527}
}
@inproceedings{Spi71f,
author = {M. Spira},
title = {On complete linear proofs of systems of linear inequalities},
booktitle = proc12 # focs,
year = {1971},
pages = {202--206}
}
@article{Spr76,
author = {F. Springsteel},
title = {On the pre-{AFL} of {$[\log n]$} space and related
families of languages},
journal = tcs,
volume = {2},
year = {1976},
pages = {295--304}
}
@misc{ Sta01,
author = "R. Standish",
title = "On complexity and emergence",
text = "Russell K. Standish. On complexity and emergence. Complexity International,
9, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/standish01complexity.html"
}
@inproceedings{Sta77,
author = {R. Statman},
title = {Complexity of derivations from quantifier-free {Horn}
formulae, mechanical introduction of explicit definitions, and refinement
of completeness theorems},
booktitle = {Proc. Logic Colloquium '76},
publisher = {North-Holland},
year = {1977},
pages = {505--517}
}
@inproceedings{Sta86,
author = {R. Statman},
title = {On translating lambda terms into combinators: the basis
problem},
booktitle = {Proceedings of the 2nd IEEE Conference on Logic in
Computer Science},
year = {1986},
pages = {378--382}
}
@ARTICLE{Ste96,
author = "A.M. Steane",
title = "Error correcting codes in quantum theory",
journal = "Physical Review Letters",
volume = "51(4)",
year = "1996",
pages = "793-797"
}
@INPROCEEDINGS{Ste96b,
author="A.M. Steane",
title = "Multiple particle interference and quantum error correction",
booktitle = "Proceedings of the Royal Society of London",
year = "1996",
volume = "452",
series = "Series A",
pages = "2551-2577"
}
@inproceedings{SHL65,
author = {R. Stearns and J. Hartmanis and P. L{ewis II}},
title = {Hierarchies of memory-limited computations},
booktitle = {Proceedings, 6th Ann. IEEE Symposium on
Switching Circuit Theory and Logical Design (now FOCS)},
year = {1965},
pages = {179--190}
}
@techreport{StHu86,
author = {R. Stearns and H. {Hunt III}},
title = {On the complexity of the satisfiability problem and the
structure of {NP}},
institution = {Dept. of Comp. Sci., SUNY at Albany},
number = {86--21},
year = {1986}
}
@article{StHu90,
author = {R. Stearns and H. {Hunt III}},
title = {Power indices and easier hard problems},
journal = mathsys,
volume = {23},
year = {1990},
pages = {209--225}
}
@incollection{Ste90,
author = {R. Stearns},
title = {Juris {H}artmanis:
the beginnings of computational complexity},
booktitle = {Complexity Theory Retrospective},
editor = {A. Selman},
publisher = springer,
address = {New York},
year = {1990},
pages = {5--18}
}
@techreport{STvEB85,
author = {R. Stegwee and L. Torenvliet and P. van Emde Boas},
title = {The power of your editor},
institution = {IBM Research Lab, San Jose, CA},
number = {RJ 4711},
year = {1985}
}
@inproceedings{SPW06,
author = {R. Steinfeld and J. Pieprzyk and H. Wang},
title = {Higher order universal one-way hash functions from the
subset-sum assumption},
booktitle = {Proceedings of PKC'06},
series = lncs,
publisher = springer,
volume = {3958},
year = {2006},
pages = {157--173}
}
@inproceedings{StSh87,
author = {S. Stepanov and I. Shparlinskiy},
title = {On structure complexity of normal basis of finite field},
booktitle = proc6 # fct,
publisher = springer,
series = lncs,
volume = {nnn},
year = {1987},
pages = {414--416}
}
@article{StLe96,
author = {P. Stevenhagen and H.W. Lenstra Jr},
title = {Chebotar{\"e}v and his density theorem},
journal = {Mathematical Intelligencer},
year = {1996},
volume = {18},
pages = {26--37}
}
@inproceedings{Ste91,
author = {I. Stewart},
title = {Complete problems involving {Boolean} labelled
structures and projection translations},
booktitle = proc11 # fsttcs,
year = {1991},
pages = {nnn--nnn}
}
@article{Ste92,
author = {I. Stewart},
title = {Using the {H}amiltonian path operator to capture {NP}},
journal = jcss,
volume = {45},
year = {1992},
pages = {nnn--nnn}
}
@article{Ste94,
author = {I. Stewart},
title = {On completeness for {NP} using projection translations},
journal = mst,
volume = {27},
year = {1994},
pages = {125--157}
}
@article{Sti88,
author = {H. Stichtenoth},
title = {A note on {H}ermitian codes over {GF($Q^2$)}},
journal = itit,
volume = {34},
year = {1988},
pages = {1345--1348}
}
@article{Sti90,
author = {D. Stinson},
title = {Some observations on parallel algorithms for fast
exponentiation in {GF($2^n$)}},
journal = sicomp,
volume = {19},
year = {1990},
pages = {711--717}
}
@article{Sti94,
author = {D. Stinson},
title = {Combinatorial techniques for universal hashing},
journal = jcss,
volume = {48},
year = {1994},
pages = {337--346}
}
@inproceedings{StMe73,
author = {L. Stockmeyer and A. Meyer},
title = {Word problems requiring exponential time},
booktitle = proc5 # stoc,
year = {1973},
pages = {1--9}
}
@techreport{Sto74,
author = {L. Stockmeyer},
title = {The complexity of decision problems in automata theory
and logic},
institution = {Project MAC, M.I.T.},
address = {Cambridge, Mass.},
number = {MAC-TR-133},
year = {1974}
}
@article{Sto76,
author = {L. Stockmeyer},
title = {The polynomial time hierarchy},
journal = tcs,
volume = {3},
year = {1976},
pages = {1--22}
}
@article{StCh79,
author = {L. Stockmeyer and A. Chandra},
title = {Intrinsically difficult problems},
journal = {Scientific American},
volume = {240},
year = {1979},
pages = {140--159}
}
@InProceedings{Sto83,
author = "L. Stockmeyer",
title = "The Complexity of Approximate Counting",
pages = "118--126",
booktitle = proc15 # stoc,
month = apr,
publisher = "ACM Press",
address = "Baltimore, USA",
year = "1983",
}
@article{StVi84,
author = {L. Stockmeyer and U. Vishkin},
title = {Simulations of parallel random access machines
by circuits},
journal = sicomp,
volume = {13},
year = {1984},
pages = {409--422}
}
@article{Sto87,
author = {L. Stockmeyer},
title = {Classifying the computational complexity of problems},
journal = jsl,
volume = {52},
year = {1987},
pages = {1--43}
}
@article{StMe02,
author = {Stockmeyer, Larry and Meyer, Albert R.},
title = {Cosmological lower bound on the circuit complexity of a small problem in logic},
journal = {J. ACM},
volume = {49},
issue = {6},
month = {November},
year = {2002},
issn = {0004-5411},
pages = {753--784},
numpages = {32},
url = {http://doi.acm.org/10.1145/602220.602223},
doi = {http://doi.acm.org/10.1145/602220.602223},
acmid = {602223},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Circuit complexity, WS1S, computational complexity, decision problem, logic, lower bound, practical undecidability},
}
@inproceedings{Sto91,
author = {P. Stokes},
title = {The domain of covering codes},
booktitle = {nnn},
series = lnm,
volume = {1518},
publisher = springer,
year = {1991},
pages = {170--177}
}
@article{Sto71,
author = {H. Stone},
title = {Parallel processing with the perfect shuffle},
journal = ieeetc,
volume = {C-20},
year = {1971},
pages = {153--161}
}
@phdthesis{Sto10,
author = {A. Stothers},
title = {On the Complexity of Matrix Multiplication},
school = {University of Edinburgh},
year = {2010},
howpublished = {https://www.era.lib.ed.ac.uk/handle/1842/4734}
}
@article{Str69,
author = {V. Strassen},
title = "Gaussian elimination is not optimal",
journal = "Numer. Math.",
pages = "354--356",
year = 1969,
volume = 13,
}
@Article{Str72,
title = "Berechnung und {P}rogramm {I}",
author = "V. Strassen",
journal = "Acta Informatica",
pages = "320--355",
year = "1972",
volume = "1",
}
@Article{Str73,
title = "Berechnung und {P}rogramm {II}",
author = "V. Strassen",
journal = "Acta Informatica",
pages = "64--79",
year = "1973",
volume = "2",
}
@Article{Str73b,
key = "Strassen",
author = "V. Strassen",
title = "Die {B}erechnungskomplexet{\"a}t von elementarysymmetrischen
{F}unktionen und von {I}nterpolations-{K}oeffizienten",
journal = "Numer. Math.",
volume = "20",
year = "1973",
pages = "238--251",
}
@incollection{Str90,
author = {V. Strassen},
title = {Algebraic complexity theory},
booktitle = {Handbook of Theoretical Computer Science},
publisher = {MIT Press},
volume = {A},
year = {1990},
pages = {634--672}
}
@incollection{Str94,
author = {V. Strassen},
title = {Algebra and Complexity},
booktitle = {Proceedings, First European Congress of Mathematics,
Paris, 1992},
publisher = {Birkh{\"a}user Verlag},
year = {1994},
pages = {429--446},
note = {Preprint available online at
http://www.mathe.uni-konstanz.de/mitarbeiter/paris.ps, top Google hit for
``border rank''+``degeneration''}
}
@article{Str88,
author = {H. Straubing},
title = {Semigroups and languages of dot-depth two},
journal = tcs,
volume = {58},
year = {1988},
pages = {361--378}
}
@inproceedings{Str92,
author = {H. Straubing},
title = {Circuit complexity and the expressive power of
generalized first-order formulas},
booktitle = proc19 # icalp,
year = {1992},
pages = {16--27}
}
@article{StWe92,
author = {H. Straubing and P. Weil},
title = {On a conjecture concerning dot-depth two languages},
journal = tcs,
volume = {104},
year = {1992},
pages = {161--183}
}
@book{Str94,
author = {H. Straubing},
title = {Finite Automata, Formal Logic, and Circuit Complexity},
series = {Progress in Theoretical Computer Science},
publisher = {Birkh{\"a}user},
year = {1994}
}
@misc{Str94b,
author = {M. Strauss},
title = {Normal numbers and sources for {BPP}},
year = {1994},
note = {DIMACS TR 94-17, 1994; appeared in the proceedings
of STACS'95}
}
@techreport{Str96,
author = {M. Strauss},
title = {Measure on {P}: strength of the notion},
number = {TR 95--26},
institution = {Department of Computer Science, Iowa State University},
month = {January},
year = {1996}
}
@article{Str97,
author = {M. Strauss},
title = {Measure on {P}---Strength of the notion},
journal = infcomp,
volume = {136},
year = {1997},
pages = {1--23}
}
@article{SBetal89,
author = {N. Striebl and K.-H. Brenner and A. Huang and J. Jahns
and J. Jewell and A. Lohmann and D. Miller and M. Murdocca and M. Prise
and T. Sizer},
title = {Digital optics},
journal = {Proceedings of the IEEE},
volume = {77},
year = {1989},
pages = {1954--1969}
}
@article{Stu90,
author = {B. Sturmfels},
title = {Gr{\"o}bner bases and {S}tanley decompositions of
determinantal rings},
journal = {Mathematische Zeitschrift},
volume = {209},
year = {1990},
pages = {137--144}
}
@phdthesis{Sud92,
author = {M. Sudan},
title = {Efficient checking of polynomials and proofs
and the hardness of approximation problems},
school = {University of California, Berkeley},
year = {1992}
}
@article{Sud76,
author = {I.H. Sudborough},
title = {On tape-bounded complexity clases and multihead
finite automata},
journal = jcss,
volume = {10},
year = {1975},
pages = {62--76}
}
@article{SuZa76,
author = {I.H. Sudborough and A. Zalcberg},
title = {On families of languages defined by time-bounded
random-access machines},
journal = sicomp,
volume = {5},
year = {1976},
pages = {217--230}
}
@article{Sud78,
author = {I.H. Sudborough},
title = {On the tape complexity of deterministic context-free
languages},
journal = jacm,
volume = {25},
year = {1978},
pages = {405--414}
}
@article{SKHN80,
author = {Y. Sugiyama and M. Kasahara and S. Hirasawa and T. Namekawa},
title = {Superimposed concatenated codes},
journal = itit,
volume = {IT-26},
year = {1980},
pages = {735--736}
}
@article{SuGu91,
author = {X.-H. Sun and J. Gustafson},
title = {Toward a better parallel performance metric},
journal = {Parallel Computing},
volume = {17},
year = {1991},
pages = {1093--1109}
}
@inproceedings{Szeg90,
author = {M. Szegedy},
title = {Functions with bounded symmetric communication complexity
and circuits with mod m gates},
booktitle = proc22 # stoc,
year = {1990},
pages = {278--286}
}
@article{Szeg93,
author = {M. Szegedy},
title = {Functions with bounded symmetric communication complexity,
programs over commutative monoids, and {ACC}},
journal = jcss,
volume = {47},
year = {1993},
pages = {405--423}
}
@article{Sze87,
author = {R. Szelepcs{\'e}nyi},
title = {The method of forcing for nondeterministic automata},
journal = beatcs,
volume = {33},
year = {1987},
pages = {96--100}
}
@article{Sze88,
author = {R. Szelepcs{\'e}nyi},
title = {The method of forced enumeration for nondeterministic
automata},
journal = {Acta Informatica},
volume = {26},
year = {1988},
pages = {279--284}
}
@techreport{Sze93,
author = {R. Szelepcs{\'e}nyi},
title = {{$\beta_k$}-complete problems and greediness},
institution = {Computer Science, University of Rochester},
number = {455},
month = {May},
year = {1993}
}
@misc{Tak93,
author = {G. Takeuti},
title = {Separation of theories in weak bounded arithmetic},
year = {1993},
note = {Department of Mathematics, Univ. of Illinois at
Urbana-Champaign}
}
@article{Tao05,
author = {T. Tao},
title = {An uncertainty principle for cyclic groups of prime order},
journal = {Mathematical Research Letters},
volume = {12},
year = {2005},
pages = {121--127}
}
@misc{Tao04pc,
author = {T. Tao},
year = {11/2004},
note = {Personal communication}
}
@inproceedings{TaBa95,
author = {G. Tardos and D. Mix Barrington},
title = {A lower bound on the mod 6 degree of the {OR} function},
booktitle = {Proceedings of the Third Israel Symposium
on the Theory of Computing and Systems (ISTCS'95), Tel Aviv, Israel},
year = {1995},
publisher = {IEEE Computer Society Press},
pages = {52--56}
}
@article{TaTr77,
author = {R. Tarjan and A. Trojanowski},
title = {Finding a maximum independent set},
journal = sicomp,
volume = {6},
year = {1977},
pages = {537--546}
}
@article{Tar79,
author = {J. Tarjan},
title = {A class of algorithms which require nonlinear time
to maintain disjoint sets},
journal = jcss,
volume = {18},
year = {1979},
pages = {110--127}
}
@article{TaVi85,
author = {R. Tarjan and U. Vishkin},
title = {An efficient parallel biconnectivity algorithm},
journal = sicomp,
volume = {14},
year = {1985},
pages = {862--874}
}
@misc{Tar91m,
author = {J. Tarui},
title = {M{\"o}bius inversion, few-accepting {T}uring machines,
and query classes with sparse oracles},
year = {1991}
}
@INPROCEEDINGS{Tar91,
AUTHOR = {J.~Tarui},
TITLE = {Randomized Polynomials, Threshold Circuits, and the Polynomial
Hierarchy},
BOOKTITLE = proc8 # stacs,
YEAR = {1991},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {480},
pages = {238--250}
}
@inproceedings{Tar91b,
author = {J. Tarui},
title = {Degree complexity of {B}oolean functions, and its applications
to relativized separations},
booktitle = proc6 # structures,
year = {1991},
pages = {382--390}
}
@unpublished{Tar92,
author = {J. Tarui},
title = {On singleton selectors and probabilistic polynomials},
year = {1992},
note = {Manuscript}
}
@article{Tar93,
author = {J. Tarui},
title = {Probabilistic polynomials, {$\AC^0$} functions, and the
polynomial-time hierarchy},
journal = tcs,
volume = {113},
year = {1993},
pages = {167--183}
}
@inproceedings{T-Sh96,
author = {A. Ta-Shma},
title = {On extracting randomness from weak random sources},
booktitle = proc28 # stoc,
year = {1996},
pages = {276--285}
}
@incollection{THF90,
author = {S. Tewksbury and L. Hornak and P Franzon},
title = {Future physical environments and concurrent computation},
booktitle = {Concurrent Computations},
editor = {S. Tewksbury and B. Dickinson and S. Schwartz},
publisher = {Plenum},
year = {1990},
pages = {65--86}
}
@inproceedings{TTW94,
author = {T. Thierauf and S. Toda and O. Watanabe},
title = {On sets bounded truth-table reducible to sparse sets},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {427--438}
}
@article{Tho82,
author = {W. Thomas},
title = {Classifying regular events in symbolic logic},
journal = jcss,
volume = {25},
year = {1982},
pages = {360--376}
}
@ARTICLE{Tho72,
AUTHOR = {D. Thompson},
TITLE = {Subrecursiveness: machine-independent notions of computability
in restricted time and storage},
JOURNAL = mathsys,
VOLUME = {6},
YEAR = {1972},
PAGES = {3--15}
}
@inproceedings{Thu06,
author = {M. Thurley},
title = {sharpSAT -- Counting Models with Advanced Component Caching and Implicit BCP},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2006: 9th International Conference, Seattle, WA, USA, August 12-15, 2006. Proceedings},
series = lncs,
publisher = springer,
year = {2006},
volume = {4121},
pages = {424--429}
}
@article{Tie87,
author = {H. Tiersma},
title = {Remarks on codes from {H}ermitian curves},
journal = titi,
volume = {IT-33},
year = {1987},
pages = {605--609}
}
@article{TiYa94,
author = {H. Ting and A. Yao},
title = {A randomized algorithm for finding maximum with
{$O((\log n)^2)$} polynomial tests},
journal = ipl,
volume = {49},
year = {1994},
pages = {39--43}
}
@INPROCEEDINGS{Toda89,
AUTHOR = {S. Toda},
TITLE = {On the computational power of {$\PP$} and {$\parityP$}},
BOOKTITLE = proc30 # focs,
YEAR = {1989},
PAGES = {514--519}
}
@ARTICLE{Toda91,
AUTHOR = {S. Toda},
TITLE = {{$\PP$} is as hard as the polynomial-time hierarchy},
YEAR = 1991,
JOURNAL = sicomp,
VOLUME = {20},
PAGES = {865--877}
}
@techreport{Toda91b,
author = {S. Toda},
title = {Counting problems computationally equivalent to
computing the determinant},
institution = {Dept. of CS and Information Mathematics,
University of Electro-Communications, Chofu-shi, Tokyo 182, Japan},
number = {CSIM 91-07},
year = {1991}
}
@INPROCEEDINGS{ToOg91,
AUTHOR = {S. Toda and M. Ogiwara},
TITLE = {Counting classes are at least as hard as the
polynomial-time hierarchy},
BOOKTITLE = proc6 # structures,
YEAR = {1991},
PAGES = {to appear}
}
@article{Toda92,
author = {S. Toda},
title = {Restricted relativizations of probabilistic polynomial time},
journal = tcs,
volume = {93},
year = {1992},
pages = {265--277}
}
@article{ToOg92,
author = {S. Toda and M. Ogiwara},
title = {Counting classes are at least as hard as the
polynomial-time hierarchy},
journal = sicomp,
volume = {21},
year = {1992},
pages = {316--328}
}
@article{ToWa92,
author = {S. Toda and O. Watanabe},
title = {Polynomial time 1-{T}uring reducibility
from {\#PH} to {\#P}},
journal = tcs,
volume = {100},
year = {1992},
pages = {205--221}
}
@article{Toda94,
author = {S. Toda},
title = {Simple characterizations of {P(\#P)} and complete
problems},
journal = jcss,
volume = {49},
year = {1994},
pages = {1--17}
}
@article{Tom80,
author = {M. Tompa},
title = {Time-space tradeoffs for computing functions, using
connectivity properties of their circuits},
journal = jcss,
volume = {20},
year = {1980},
pages = {118--132}
}
@article{ToTi94,
author = {M. Tompa and P. Tiwari},
title = {A direct version of Shamir and Snir's lower bounds
on monotone circuit depth},
journal = ipl,
volume = {49(5)},
year = {1994},
pages = {243--248}
}
@inproceedings{Tor88,
author = {J. Tor{\'a}n},
title = {An oracle characterization of the counting hierarchy},
booktitle = proc3 # structures,
year = {1988},
pages = {213--223}
}
@inproceedings{Tor88b,
author = {J. Tor{\'a}n},
title = {Succinct representations of counting problems},
booktitle = proc6 # "Conference on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {415--426}
}
@phdthesis{Tor88t,
author = {J. Tor{\'a}n},
title = {Structural Properties of the Counting Hierarchies},
institution = {Universitat Polit{\'e}cnica de Barcelona,
Facultat de Inform{\'a}tica},
year = {1988}
}
@article{Tor91,
author = {J. Tor{\'a}n},
title = {Complexity classes defined by counting quantifiers},
journal = jacm,
volume = {38},
year = {1991},
pages = {753--774}
}
@misc{ToughSAT,
author = {Henry Yuen and Joseph Babel},
title = {Tough {SAT} {P}roject},
year = {2017},
howpublished = {https://toughsat.appspot.com/}
}
@phdthesis{Tra86,
author = {J, Trahan},
title = {Simulations among multi-dimensional iterative arrays,
iterative tree automata, and alternating {T}uring machines},
school = {University of Illinois at Urbana Champaign},
year = {1986},
note = {Tech. Report UILU-ENG-86-2202, ACT-66}
}
@article{TLR92,
author = {J. Trahan and M. Loui and V. Ramachandran},
title = {Multiplication, division, and shift instructions
in parallel random access machines},
journal = tcs,
volume = {100},
year = {1992},
pages = {1--44}
}
@article{Tra64,
author = {B. Trakhtenbrot},
title = {Turing computations with logarithmic delay},
journal = {Algebra i Logika},
volume = {3},
year = {1964},
pages = {33--48}
}
@article{Tra96,
author = {C. Traverso},
title = {Hilbert functions and the {B}uchberger algorithm},
journal = {Journal of Symbolic Computation},
volume = {22},
year = {1996},
pages = {355--376}
}
@inproceedings{Tre86,
author = {C. Tretkoff},
title = {Bounded oracles and complexity classes inside linear
space},
booktitle = proc1 # structures,
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {347--361}
}
@misc{Trev08,
author = {L. Trevisan},
title = {{CS} 278 -- {C}omputational {C}omplexity -- {S}pring 2008, {L}ecture 11: Eigenvalues and random walks; the expander mixing lemma},
howpublished = "http://www.cs.berkeley.edu/~luca/cs278-08/lecture11.pdf",
year = {2008}
}
@misc{Trev11C,
author = {L. Trevisan},
title = {Comment in {G}{\"o}del's {L}ost {L}etter item},
year = {2011},
howpublished = {http://rjlipton.wordpress.com/2011/05/25/finite-compactness/\#comment-11977}
}
@book{Tro73,
author = {A. Troelstra},
title = {Mathematical Investigations of Intuitionistic Arithmetic
and Analysis},
series = lnm,
volume = {344},
publisher = {springer},
year = {1973}
}
@inproceedings{Tsai93,
author = {S.-C. Tsai},
title = {Lower bounds on representing {B}oolean functions
as polynomials in {$Z_m$}},
booktitle = proc8 # structures,
year = {1993},
pages = {96--101}
}
@incollection{Tse68,
author = {G. Tseitin},
title = {On the complexity of derivations in propositional
calculus},
booktitle = {Studies in Mathematics and Mathematical Logic,
Part {II}},
editor = {A. Slisenko},
year = {1968},
pages = {115--125},
note = {English translation}
}
@article{TVZ82,
author = {M. Tsfasman and S. Vladut and T. Zink},
title = {Modular curves, {S}himura curves and {G}oppa codes,
better than {V}arshamov-{G}ilbert bound},
journal = {Mathematische Nachrichten},
volume = {109},
year = {1982},
pages = {21--28}
}
@book{TV91,
author = {M. Tsfasman and S. Vladut},
title = {Algebraic-Geometric Codes},
publisher = {Kluwer Academic},
address = {Dordrecht},
series = {Mathematics and Its Applications (Soviet Series)},
volume = {58},
year = {1991}
}
@article{TIAS77,
author = {S. Tsukiyama and M. Ide and H. Ariyoshi and I. Shirakawa},
title = {A new algorithm for generating all the maximal independent
sets},
journal = sicomp,
volume = {6},
year = {1977},
pages = {505--517}
}
@article{Tur36,
author = {A. Turing},
title = {On computable numbers, with an application to the
{\it Entscheidungsproblem\/}},
journal = {Proceedings of the London Mathematical Society},
volume = {42},
number = {2},
year = {1936},
pages = {230--265}
}
@article{Tur83,
author = {P. Turakainen},
title = {A machine-oriented approach to composition of morphisms
and inverse morphisms},
journal = beatcs,
volume = {20},
month = {June},
year = {1983},
pages = {162--166}
}
@article{Tur79,
author = {D.A. Turner},
title = {A new implementation technique for applicative languages},
journal = {Software---Practice and Experience},
volume = {9:31},
year = {1979}
}
@inproceedings{UCH96,
author = {R. Uehara and Z.-Z. Chen and X. He},
title = {Fast {RNC} and {NC} Algorithms for Finding a Maximal Set
of Paths with an Application},
booktitle = proc2 # "International Computing and Combinatorics
Conference",
series = lncs,
volume = {1090},
publisher = springer,
year = {1996},
pages = {209--218},
note = tcs # ", to appear"
}
@inproceedings{Uhl87,
author = {D. Uhlig},
title = {On reliable networks from unreliable gates},
booktitle = {Proceedings, Parallel Algorithms and Architectures},
series = lncs,
volume = {269},
publisher = springer,
year = {1987},
pages = {155--162}
}
@inproceedings{Uhl87b,
author = {D. Uhlig},
title = {Reliable networks from unreliable gates with almost minimal
complexity},
booktitle = proc6 # fct,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1987},
pages = {462--469}
}
@inproceedings{Uhl88,
author = {D. Uhlig},
title = {Reliable networks for {B}oolean functions with small
complexity},
booktitle = proc4 # "PARCELLA",
series = lncs,
volume = {nnn},
publisher = springer,
year = {1988},
pages = {366--371}
}
@article{UMS82,
author = {H. Umeo and K. Morita and K. Sugata},
title = {Deterministic one-way simulation of two-way real-time
cellular automata and its related problems},
journal = ipl,
volume = {14},
number = {4},
year = {1982},
pages = {158--161}
}
@article{Ung51,
author = {P. Ungar},
title = {A theorem on planar graphs},
journal = {J. London Math. Soc.},
volume = {26},
year = {1951},
pages = {256--262}
}
@article{Urq87,
author = {A. Urquhart},
title = {Hard examples for resolution},
journal = jacm,
volume = {34},
year = {1987},
pages = {209--219}
}
@article{Val75,
author = {L. Valiant},
title = {Parallelism in comparison problems},
journal = sicomp,
volume = {4},
year = {1975},
pages = {348--355}
}
@inproceedings{Val75b,
author = {L. Valiant},
title = {On non-linear lower bounds in computational complexity},
booktitle = proc7 # stoc,
year = {1975},
pages = {45--53}
}
@article{Val76,
author = {L. Valiant},
title = {Relative complexity of checking and evaluating},
journal = ipl,
volume = {5},
year = {1976},
pages = {20--23}
}
@article{Val79,
author = {L. Valiant},
title = {The complexity of computing the permanent},
journal = tcs,
volume = {8},
year = {1979},
pages = {189--201}
}
@misc{Val79b,
author = {L. Valiant},
title = {Universality considerations in {VLSI} circuits},
month = {December},
year = {1979}
}
@techreport{Val79c,
author = {L. Valiant},
title = {Completeness classes in algebra},
institution = {Dept. of Computer Science, University of Edinburgh},
number = {CSR-40-79},
month = {April},
year = {1979}
}
@inproceedings{Val79p,
author = {L. Valiant},
title = {Completeness classes in algebra},
booktitle = proc11 # stoc,
year = {1979},
pages = {nnn--nnn}
}
@article{Val82,
author = {L. Valiant},
title = {Reducibility by algebraic projections},
journal = {L'Enseignement math{\'e}matique},
volume = {28},
year = {1982},
pages = {253--268}
}
@article{VSBR83,
author = {L. Valiant and S. Skyum and S. Berkowitz and C. Rackoff},
title = {Fast parallel computation of polynomials using few
processors},
journal = sicomp,
volume = {12},
year = {1983},
pages = {641--644}
}
@inproceedings{Val77,
author = {L. Valiant},
title = {Graph-theoretic arguments in low-level complexity},
booktitle = proc2 # mfcs,
series = lncs,
volume = {53},
publisher = springer,
year = {1977},
pages = {162--176}
}
@article{Val84,
author = {L. Valiant},
title = {A theory of the learnable},
journal = cacm,
volume = {27},
year = {1984},
month = {November},
pages = {1134--1142}
}
@article{Val84b,
author = {L. Valiant},
title = {Short monotone formulae for the majority function},
journal = {Journal of Algorithms},
volume = {5},
year = {1984},
PAGES = {363?-366}
}
@inproceedings{Val85,
author = {L. Valiant},
title = {Learning disjunctions of conjunctions},
booktitle = {Proceedings of the 9th International
Joint Conference on Artificial Intelligence, Los Angeles, CA},
year = {1985},
pages = {565--569}
}
@ARTICLE{VV86,
AUTHOR = {L. Valiant and V. Vazirani},
TITLE = {{$\NP$} is as easy as detecting unique solutions},
JOURNAL = tcs,
YEAR = {1986},
VOLUME = {47},
PAGES = {85--93}
}
@article{Val88,
author = {L. Valiant},
title = {Optimally universal parallel computers},
journal = {Phil. Trans. R. Soc. Lond. A},
volume = {326},
year = {1988},
pages = {373--376}
}
@article{Val90,
author = {L. Valiant},
title = {A bridging model for parallel computation},
journal = cacm,
volume = {33},
month = {August},
year = {1990},
pages = {103--111}
}
@incollection{Val90b,
author = {L. Valiant},
title = {General-purpose parallel architectures},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990}
}
@incollection{Val92,
author = {L. Valiant},
title = {Why is {B}oolean complexity theory so difficult?},
booktitle = {Boolean Function Complexity},
editor = {M. Paterson},
series = {LMS Lecture Notes},
volume = {169},
publisher = {Cambridge University Press},
year = {1992},
pages = {84--94},
note = {Meeting held July 1990}
}
@inproceedings{Val06,
author = {L. Valiant},
title = {Accidental algorithms},
booktitle = proc47 # focs,
year = {2006},
pages = {509--517}
}
@article{Val08,
author = {L. Valiant},
title = {Holographic algorithms},
journal = sicomp,
volume = {37},
year = {2008},
pages = {1565--1594}
}
@inproceedings{Val10,
author = {L. Valiant},
title = {Some observations on holographic algorithms},
booktitle = proc9 # "LATIN",
publisher = springer,
series = lncs,
volume = {6034},
year = {2010},
pages = {577--590}
}
@inproceedings{GLV11,
author = {H. Guo and P. Lu and L. Valiant},
title = {The complexity of symmetric Boolean parity holant problems},
booktitle = proc38 # icalp,
series = lncs,
publisher = springer,
volume = {3580},
year = {2011},
pages = {712--723}
}
@inproceedings{VGT88,
author = {B. Vall{\'e}e and M. Girault and P. Toffin},
title = {How to guess {$l$}-th roots modulo {$n$} by reducing
lattice bases},
booktitle = proc6 # "Conference on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {427--442}
}
@inproceedings{vEB72,
author = {P. van Emde Boas},
title = {A comparison of the properties of complexity classes
and honesty classes},
booktitle = proc2 # icalp,
year = {1972},
pages = {nnn--nnn}
}
@article{vEB78,
author = {P. van Emde Boas},
title = {Some applications of the {McCreight}-{Meyer} algorithm
in abstract complexity theory},
journal = tcs,
volume = {7},
year = {1978},
pages = {nnn--nnn}
}
@INCOLLECTION{vEB90,
AUTHOR = {P. van Emde Boas},
TITLE = {Machine models and simulations},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {1--66}
}
@book{vLe90,
editor = {J. van Leeuwen},
title = {Handbook of Theoretical Computer Science},
volume = {A},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990}
}
@incollection{vMeOg97,
author = {D. van Melkebeek and M. Ogihara},
title = {Sparse hard sets for {P}},
booktitle = {Advances in Complexity and Algorithms},
editor = {D.~Du and K.~Ko},
publisher = {Kluwer Academic Press},
year = {1997},
note = {In press}
}
@ARTICLE{VBSYSC01,
author = "L.M.K. Vandersypen and G. Breyta and M. Steffen and C.S. Yannoni and M.H. Sherwood and I.L. Chuang",
title = "Experimental realization of Shor?s quantum factoring algorithm using nuclear magnetic resonance",
journal = "Nature",
volume = "414(6866)",
year = "2001",
pages = "883-887"
}
@inproceedings{Var82,
author = {M. Vardi},
title = {Complexity of relational query languages},
booktitle = proc14 # stoc,
year = {1982},
pages = {137--146}
}
@article{VKSA95,
author = {I. Vattulainen and K. Kankaala and J. Saarinen
and T. Ala-Nissila},
title = "A Comparative Study of Some Pseudorandom Number Generators",
journal = {Computer Physics Communications},
volume = {86},
year = {1995}
}
@inproceedings{VaVa85,
author = {U. Vazirani and V. Vazirani},
title = {Random polynomial time is equal to semi-random polynomial
time},
booktitle = proc26 # focs,
year = {1985},
pages = {nnn--nnn}
}
@techreport{VaVa88,
author = {U. Vazirani and V. Vazirani},
title = {Random polynomial time is equal to semi-random polynomial
time},
institution = {Dept. of Computer Science, Cornell University},
number = {88-959},
month = {December},
year = {1988}
}
@article{VeTo89,
author = {H. Venkateswaran and M. Tompa},
title = {A new pebble game that characterizes parallel
complexity classes},
journal = sicomp,
volume = {18},
year = {1989},
pages = {533--549}
}
@article{Ven91,
author = {H. Venkateswaran},
title = {Properties that characterize {LOGCFL}},
journal = jcss,
volume = {43},
year = {1991},
pages = {380--404}
}
@inproceedings{Ver93,
author = {N. Vereshchagin},
title = {Relationships among {NP}-dets, {Co-NP}-sets, and {P}-sets
relative to random oracles},
booktitle = proc8 # structures,
year = {1993},
pages = {132--138}
}
@inproceedings{VRMH03,
author = {G. Viamontes and M. Rajagopalan and I. Markov and J. Hayes},
title = {Gate-level simulation of quantum circuits},
booktitle = {Proceedings, ACM/ IEEE Asia and South-Pacific Design Automation Conf. (ASPDAC), Kitakyushu, Japan, January 2003},
year = {2003},
pages = {295--301},
}
@article{VMH03,
author = {G. Viamontes and I. Markov and J. Hayes},
title = {Improving gate-level simulation of quantum circuits},
journal = {Quantum Information Processing},
volume = {2},
year = {2003},
pages = {347--380},
}
@inproceedings{VVM90,
author = {V. Vinay and H. Venkateswaran and C.E. Veni Madhavan},
title = {Circuits, pebbling, and expressibility},
booktitle = proc5 # structures,
year = {1990},
pages = {223--230}
}
@inproceedings{Vin91,
author = {V. Vinay},
title = {Counting Auxiliary Pushdown Automata and Semi-Unbounded
Arithmetic Circuits},
booktitle = proc6 # structures,
year = {1991},
pages = {270--284}
}
@article{Vio06,
author = {E. Viola},
title = {Pseudorandom bits for constant-depth circuits with few
arbitrary symmetric gates},
journal = sicomp,
volume = {36},
year = {2006},
pages = {1387--1403}
}
@article{Vis85,
author = {U. Vishkin},
title = {On efficient parallel strong orientation},
journal = ipl,
volume = {20},
year = {1985},
pages = {235--240}
}
@inproceedings{Vit86,
author = {P. Vit{\'a}nyi},
title = {Nonsequential computation and laws of nature},
booktitle = {{VLSI} Algorithms and Architectures},
series = {Lecture Notes in Computer Science No.~227},
publisher = springer,
year = {1986},
pages = {108--120}
}
@article{Vit88,
author = {P. Vit{\'a}nyi},
title = {Locality, communication, and interconnect length
in multicomputers},
journal = sicomp,
volume = {17},
year = {1988},
pages = {659--672}
}
@inproceedings{Vit00,
author = {Paul M. B. Vitanyi},
title = {Three approaches to the quantitative definition of information in an individual pure quantum state},
booktitle = proc15 # ccc,
year = {2000},
pages = {263--270}
}
@article{Vit01,
author = {Paul M. B. Vitanyi},
title = {Quantum Kolmogorov Complexity Based on Classical Descriptions},
journal = itit,
volume = {47},
year = {2001},
pages = {2464--2479}
}
@INPROCEEDINGS{Vit91,
AUTHOR = {J. Vitter},
TITLE = {Efficient memory access in large-scale computation},
BOOKTITLE = proc8 # stacs,
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {480},
YEAR = {1991},
PAGES = {26--41}
}
@techreport{ViSh92I,
author = {J. Vitter and E. Shriver\/},
title = {Algorithms for parallel memory {I}: {Two-level} memories},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--04},
month = {August},
year = {1992}
}
@techreport{ViSh92II,
author = {J. Vitter and E. Shriver\/},
title = {Algorithms for parallel memory {II}: hierarchical
multilevel memories\/},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--05},
month = {August},
year = {1992}
}
@techreport{ViNo92,
author = {J. Vitter and M. Nodine},
title = {Large-scale sorting in uniform memory hierarchies},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--02},
month = {August},
year = {1992}
}
@techreport{NoVi92,
author = {M. Nodine and J. Vitter},
title = {Optimal deterministic sorting in parallel memory hierarchies},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--38},
month = {August},
year = {1992}
}
@inproceedings{Vol90,
author = {H. Vollmer},
title = {The gap-language technique revisited},
booktitle = proc3 # csl,
year = {1990},
pages = {389--399}
}
@inproceedings{Voss91,
author = {C. Voss},
title = {On the weights of trace codes},
booktitle = {nnn},
series = lnm,
volume = {1518},
publisher = springer,
year = {1991},
pages = {193--198}
}
@article{WaFi74,
author = {R. Wagner and M. Fischer},
title = {The string-to-string correction problem},
journal = jacm,
volume = {21},
year = {1974},
pages = {168--173}
}
@article{Wag86,
author = {K. Wagner},
title = {The complexity of combinatorial problems with succinct input
representation},
journal = {Acta Informatica},
volume = {23},
year = {1986},
pages = {325--356}
}
@BOOK{WW86,
AUTHOR = {K. Wagner and G. Wechsung},
TITLE = {Computational Complexity},
PUBLISHER = {D. Reidel},
YEAR = {1986}
}
@inproceedings{Wag92,
author = {K. Wagner},
title = {The alternation hierarchy for sublogarithmic space: An
exciting race to {STACS} '93},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
note = {Editorial note},
year = {1993},
pages = {2--4}
}
@misc{Wal64,
author = {C. Wallace},
title = {A suggestion for a fast multiplier},
journal = ieeetc,
volume = {EC-13},
year = {1964},
pages = {14--17}
}
@article{WCS92,
author = {J. Wang and L. Cheng and A. Sawchuk},
title = {Optical two-dimensional perfect shuffles based on a
one-copy algorithm},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5464--5467}
}
% Not Jie Wang
@inproceedings{Wang90,
author = {J. Wang},
title = {Some remarks on polynomial time isomorphisms},
booktitle = proc2 # icci,
series = lncs,
volume = {468},
publisher = springer,
year = {1990},
pages = {144--153}
}
@article{Wang91,
author = {J. Wang},
title = {On p-creative and p-completely creative sets},
journal = tcs,
volume = {85},
year = {1991},
pages = {1--31}
}
@inproceedings{WaBe92,
author = {J. Wang and J. Belanger},
title = {On average {P} vs. average {NP}},
booktitle = proc7 # structures,
year = {1992},
pages = {318--326}
}
@article{Wang92,
author = {J. Wang},
title = {Polynomial time productivity, approximations,
and levelability},
journal = sicomp,
volume = {21},
year = {1992},
pages = {1100--1111}
}
@article{Wang92b,
author = {J. Wang},
title = {A note on two-way probabilistic automata},
journal = ipl,
volume = {43},
year = {1992},
pages = {321--326}
}
@incollection{Wang93,
author = {J. Wang},
title = {On the {E}-isomorphism problem},
booktitle = {Advances in Computational Complexity Theory},
editor = {J.-Y. Cai},
publisher = {American Mathematical Society},
year = {1993},
pages = {195--209}
}
@article{WaBe93,
author = {J. Wang and J. Belanger},
title = {Honest iteration schemes of randomizing algorithms},
journal = ipl,
volume = {45},
year = {1993},
pages = {275--278}
}
@inproceedings{WaBe93b,
author = {J. Wang and J. Belanger},
title = {Isomorphisms of {NP} complete problems on
random instances},
booktitle = proc8 # structures,
year = {1993},
pages = {65--74}
}
@misc{WaBe94,
author = {J. Wang and J. Belanger},
title = {On the {NP}-isomorphism problem with respect to
random instances},
year = {1994},
note = jcss # ", to appear"
}
@misc{Wang94,
author = {J. Wang},
title = {String-rewriting systems have hardest problems in {NP}},
year = {1994}
}
@inproceedings{Wang94i,
author = {J. Wang},
title = {Selectivity and self-reducibility: new characterizations
of complexity classes},
booktitle = proc6 # icci,
year = {1994}
}
@misc{Wang94b,
author = {J. Wang},
title = {Productive functions and isomorphisms},
year = {1994},
note = {{\em Math Sys. Thy.\/}, in press}
}
@inproceedings{Wang95,
author = {J. Wang},
title = {Average-case completeness of a word problem for groups},
booktitle = proc27 # stoc,
year = {1995},
pages = {325--334}
}
@incollection{Wang97,
author = {J. Wang},
title = {Average-case computational complexity theory},
booktitle = {Complexity Theory Retrospective II},
editor = {L. Hemaspaandra and A. Selman},
publisher = springer,
year = {1997},
pages = {295--328}
}
@article{WaBl90,
author = {M. Wang and I. Blake},
title = {Bit serial multiplication in finite fields},
journal = sjdm,
volume = {3},
year = {1990},
pages = {140--148}
}
@article{WaHa84,
author = {M. Warmuth and D. Haussler},
title = {On the complexity of iterated shuffle},
journal = jcss,
volume = {28},
year = {1984},
pages = {345--358}
}
@article{Wat83,
author = {O. Watanabe},
title = {The time-precision trade off problem on on-line
probabilistic {T}uring machines},
journal = tcs,
volume = {24},
year = {1983},
pages = {105--117}
}
@techreport{Wat93,
author = {O. Watanabe},
title = {An {NP} set with no {co-DP} sparse subset},
institution = {Computer Science, University of Rochester},
number = {475},
month = {October},
year = {1993}
}
@article{Wat94,
author = {O. Watanabe},
title = {A framework for polynomial-time query learnability},
journal = mst,
volume = {27},
year = {1994},
pages = {211--230}
}
@inproceedings{Wat94b,
author = {O. Watanabe},
title = {Test instance generation for promised {NP} search problems},
booktitle = proc9 # structures,
year = {1994},
pages = {205--216}
}
@article{WaGa94,
author = {O. Watanabe and R. Gavald{\`a}},
title = {Structural analysis of polynomial-time query learnability},
journal = mst,
volume = {27},
year = {1994},
pages = {231--256}
}
@misc{Wat97pc,
author = {O. Watanabe},
year = {1997},
note = {Personal communication}
}
@book{Weg87,
author = {I. Wegener},
title = {The Complexity of Boolean Functions},
publisher = {Wiley},
address = {New York},
year = {1987}
}
@article{Weg92,
author = {I. Wegener},
title = {How far can we count in constant depth with a
polylogarithmic number of gates?},
journal = {J. Inform. Process. Cybernet.},
volume = {EIK 28},
year = {1992},
pages = {79--82}
}
@INPROCEEDINGS{Wei74,
AUTHOR = {R. Weicker},
TITLE = {Turing machines with associative memory access},
BOOKTITLE = proc2 # icalp,
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {14},
YEAR = {1974},
PAGES = {458--472}
}
@inproceeding{Wei91,
author = {K. Weihrauch},
title = {A simple and powerful approach for studying constructivity,
computability, and complexity},
booktitle = {Constructivity in Computer Science, Proceedings,
San Antonio, Texas, June 1991},
series = lncs,
volume = {613},
publisher = springer,
year = {1991},
pages = {228--246}
}
@article{WMLZB10,
author = {H. Weimer and M. M{\"u}ller and I. Lesanovsky and P. Zoller and H.P. B{\"u}chler},
title = {A {R}ydberg Quantum Simulator},
journal = {Nature Physics},
volume = {6},
year = {2010},
pages = {382--388}
}
@misc{WeBu13,
author = {H. Weimer and B. Butscher},
title = {libquantum 1.1.1: the {C} library for quantum computing and quantum simulation},
year = {2003--2013 (v. 1.1.1)},
howpublished = {http://www.libquantum.de/}
}
@Article{Wei87,
author = "V. Weispfenning",
title = "Admissible orders and linear forms",
journal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
volume = "21",
number = "2",
pages = "16--18",
month = may,
year = "1987",
}
@article{Wel75,
author = {E. Weldon},
title = {Some results on the problem of constructing asymptotically
good error-correcting codes},
journal = itit,
volume = {IT-21},
number = {4},
year = {1975},
month = {July},
pages = {412--417}
}
@article{Wel83,
author = {D.J.A. Welsh},
title = {Randomised algorithms},
journal = {Discrete and Applied Mathematics},
volume = {5},
year = {1983},
pages = {nnn--nnn}
}
@incollection{Wel83,
author = {D.J.A. Welsh},
title = {Problems in computational complexity},
booktitle = {nnn},
year = {1983},
pages = {75--85}
}
@book{Wel88,
author = {D.J.A. Welsh},
title = {Codes and Cryptography},
publisher = {Oxford Univ. Press},
year = {1988}
}
@article{WeBa85,
author = {D. West and P. Banerjee},
title = {Partial matching in degree-restricted bipartite graphs},
journal = {Congressus Numerantium},
volume = {49},
month = {December},
year = {1985},
pages = {259--266}
}
@article{WeBa88,
author = {D. West and P. Banerjee},
title = {On the construction of communication networks satisfying
bounded fan-in of service ports},
journal = ieeetc,
volume = {37},
year = {1988},
pages = {1148--1151}
}
@ARTICLE{Wie87,
author = "D. Wiedemann",
title = "Quantum cryptography",
journal = "Sigact News",
volume = "18(2)",
year = "1987",
pages = "48-51"
}
@inproceedings{Wie83,
author = {J. Wiedermann},
title = {Deterministic and nondeterministic simulations of the
{RAM} by the {T}uring machine},
booktitle = {Information Processing '83: Proc. 9th World
Computer Congress},
editor = {R.E.A. Mason},
publisher = {North-Holland},
year = {1983},
pages = {163--168}
}
@inproceedings{Wie92,
author = {J. Wiedermann},
title = {Weak parallel machines: a new class of physically
feasible parallel machine models},
booktitle = proc16 # mfcs,
series = lncs,
volume = {629},
publisher = springer,
year = {1992},
pages = {95--111}
}
@ARTICLE{Wie83,
author = "S. Wiesner",
title = "Conjugate coding",
journal = "SIGACT News",
volume = "15(1)",
year = "1983",
pages = "78-88"
}
@incollection{Wig93,
author = {A. Wigderson},
title = {The fusion method for lower bounds in circuit complexity},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {453--467}
}
@inproceedings{WiZu93,
author = {A. Wigderson and D. Zuckerman},
title = {Expanders that beat the eigenvalue bound: explicit
construction and applications},
booktitle = proc25 # stoc,
year = {1993},
pages = {245--251}
}
@inproceedings{Wig94,
author = {A. Wigderson},
title = {{NL/poly $\subseteq \oplus$L/poly}},
booktitle = proc9 # structures,
year = {1994},
pages = {59--62}
}
@misc{WiRe02,
author = {A. Wigderson and O. Regev},
title = {Arithmetic complexity - a survey},
year = {2002},
note = {Online at http://www.math.ias.edu/{$\sim$}avi/TALKS/arithmetic\_complexity.pdf}
}
@article{Wil92,
author = {D. Willard},
title = {A density control algorithm for doing insertions
and deletions in a sequentially ordered file in a good
worst-case time},
journal = infcomp,
volume = {97},
year = {1992},
pages = {150--204}
}
@article{Wil06,
author = {R. Williams},
title = {Better time-space lower bounds for {SAT} and related
problems},
journal = compcomp,
year = {2006},
volume = {15},
pages = {}
}
@misc{Wil10b,
author = {R. Williams},
title = {Improving exhaustive search implies superpolynomial
lower bounds},
booktitle = proc40 # stoc,
year = {2010}
}
@inproceedings{Wil10a,
author = {R. Williams},
title = {Alternation-trading proofs, linear programming,
and lower bounds},
booktitle = proc27 # stacs,
year = {2010},
publisher = springer,
series = lncs,
note = {to appear}
}
@misc{Wil10pc,
author = {R. Williams},
year = {2010},
note = {Personal communication}
}
@misc{Wil10d,
author = {R. Williams},
title = {Non-uniform {ACC} lower bounds},
month = {November},
day = {23},
year = {2010},
note = {http://www.cs.cmu.edu/{$\sim$}ryanw/acc-lbs.pdf}
}
@misc{Wil10se,
author = {R. Williams},
title = {Is `{E}xperimental {C}omplexity {T}heory' being used to solve open problems? (reply)},
year = {2010},
publisher = {Theoretical Computer Science StackExchange},
howpublished = {https://cstheory.stackexchange.com/questions/524/is-experimental-complexity-theory-being-used-to-solve-open-problems}
}
@inproceedings{Wil11,
author = {R. Williams},
title = {Non-uniform {ACC} lower bounds},
booktitle = proc26 # ccc,
year = {2011},
pages = {231--240}
}
@inproceedings{Wil12,
author = {V.V. Williams},
title = {Multiplying matrices faster than {C}oppersmith-{W}inograd},
booktitle = proc44 # stoc,
year = {2012},
pages = {887--898}
}
@article{Wil85,
author = {C. Wilson},
title = {Relativized circuit complexity},
journal = jcss,
volume = {31},
year = {1985},
pages = {169--181}
}
@article{Wil87,
author = {C. Wilson},
title = {Relativized {NC}},
journal = mst,
volume = {20},
year = {1987},
pages = {13--29}
}
@article{Wil88,
author = {C. Wilson},
title = {A measure of relativized space which is faithful
with respect to depth},
journal = jcss,
volume = {36},
year = {1988},
pages = {303--312}
}
@article{Wil90,
author = {C. Wilson},
title = {On the decomposability of {AC} and {NC}},
journal = sicomp,
volume = {19},
year = {1990},
pages = {384--396}
}
@article{Wis92,
author = {J. Wiseman},
title = {New binary codes from a generalization of {Zinoviev's}
technique},
journal = infcomp,
voluem = {98},
year = {1992},
pages = {132--139}
}
@article{WoCh76,
author = {C. Wong and A. Chandra},
title = {Bounds for the string editing problem},
journal = jacm,
volume = {23},
year = {1976},
pages = {13--16}
}
@phdthesis{Wra75,
author = {C. Wrathall},
title = {Subrecursive predicates and automata},
school = {Harvard University},
year = {1975},
note = {Reprinted and available via the Department of
Mathematics, Univ. of CA at Santa Barbara}
}
@article{Wra76,
author = {C. Wrathall},
title = {Complete sets and the polynomial-time hierarchy},
journal = tcs,
volume = {3},
year = {1976},
pages = {23--33}
}
@article{Wra78,
author = {C. Wrathall},
title = {Rudimentary predicates and relative computation},
journal = sicomp,
volume = {7},
year = {1978},
pages = {194--209}
}
@inproceedings{WuKu91,
author = {I.-C. Wu and H.T. Kung},
title = {Communication complexity for parallel divide-and-conquer},
booktitle = proc32 # focs,
year = {1991},
pages = {151--162}
}
@article{WuTa92,
author = {L. Wu and C. Tang},
title = {Solving the satisfiability problem by using randomized
approach},
journal = ipl,
volume = {41},
year = {1992},
pages = {187--190}
}
@inproceedings{YaMa10,
author = {S. Yamashita and I. Markov},
title = {Fast Equivalence-checking for Quantum Circuits},
booktitle = {Proceedings of the 2010 IEEE/ACM Symposium on Nanoscale Architectures, Anaheim, CA USA},
year = {2010},
note = {May 2013 update at https://arxiv.org/pdf/0909.4119.pdf}
}
@inproceedings{Yan88,
author = {T. Yamakami},
title = {Computational complexity of languages counting random
oracles},
booktitle = {nnn},
year = {1988},
pages = {189--202}
}
@inproceedings{Yao77,
author = {A. Yao},
title = {Probabilistic computations: Toward a unified measure
of complexity},
booktitle = proc18 # focs,
year = {1977},
pages = {222--227}
}
@inproceedings{Yao79,
author = {A.~Yao},
title = {Some complexity questions related to distributive computing},
booktitle = proc11 # stoc,
year = {1979},
pages = {209--213}
}
@inproceedings{Yao81,
author = {A. Yao},
title = {The entropic limits of {VLSI} computations},
booktitle = proc13 # stoc,
year = {1981},
pages = {308--311}
}
@inproceedings{Yao82,
author = {A. Yao},
title = {Theory and applications of trapdoor functions},
booktitle = proc23 # focs,
year = {1982},
pages = {80--91}
}
@inproceedings{Yao85,
author = {A.~Yao},
title = {Separating the polynomial-time hierarchy by oracles},
booktitle = proc26 # focs,
year = {1985},
pages = {1--10}
}
@inproceedings{Yao88,
author = {A. Yao},
title = {Near-optimal time-space tradeoff for element distinctness},
booktitle = proc29 # focs,
year = {1988},
pages = {91--97}
}
@inproceedings{Yao89,
author = {A. Yao},
title = {Circuits and local computation},
booktile = proc21 # stoc,
year = {1989},
pages = {186--196}
}
@inproceedings{Yao90,
author = {A. Yao},
title = {On {ACC} and threshold circuits},
booktitle = proc31 # focs,
year = {1990},
pages = {619--627}
}
@article{Yao92,
author = {X. Yao},
title = {Finding approximate solutions to {NP}-hard problems by
neural networks is hard},
journal = ipl,
volume = {41},
year = {1992},
pages = {93--98}
}
@INPROCEEDINGS{Yao93,
author="A.C-C. Yao",
title = "Quantum circuit complexity",
booktitle = "Proceedings of 34th Annual IEEE Symposium on Foundations of Computer Science",
year = "1993",
pages = "352-361"
}
@inproceedings{Yao94,
author = {A. Yao},
title = {Decision tree complexity and {B}etti numbers},
booktitle = proc26 # stoc,
year = {1994},
pages = {615--624}
}
@techreport{Yap88,
author = {C. Yap},
title = {A Double Exponential Lower Bound for Degree-compatible
Grobner Bases},
institution = {NYU Computer Science},
year = {1988}
}
@INPROCEEDINGS{Yao03,
author="A.C-C. Yao",
title = "On the power of quantum fingerprinting",
booktitle = "35th ACM STOC",
year = "2003",
pages = "77-81",
note = "[STOC:780542.780554, ECCC:TR02-074]"
}
@article{Yap91,
author = {C. Yap},
title = {A new lower bound construction for commutative {T}hue
systems with applications},
journal = {Journal of Symbolic Computation},
volume = {12},
year = {1991},
pages = {1--27}
}
@article{Yat66,
author = {C. Yates},
title = {On the degrees of index sets},
journal = trans-ams,
volume = {121},
year = {1966},
pages = {309--328}
}
@article{Yat69,
author = {C. Yates},
title = {On the degrees of index sets {II}},
journal = trans-ams,
volume = {135},
year = {1969},
pages = {249--266}
}
@article{Yes84,
author = {Y. Yesha},
title = {Time-space tradeoffs for matrix multiplication
and the discrete Fourier transform on any general sequential
random-access computer},
journal = jcss,
volume = {29},
year = {1984},
pages = {183--197}
}
@article{You77,
author = {P. Young},
title = {Optimization among provably equivalent programs},
journal = jacm,
volume = {24},
year = {1977},
pages = {693--700}
}
@ARTICLE{Zac82,
AUTHOR = {S. Zachos},
TITLE = {Robustness of probabilistic computational complexity
classes under definitional perturbations},
JOURNAL = infcomp,
YEAR = {1982},
VOLUME = {54},
PAGES = {143--154}
}
@ARTICLE{ZaHe86,
AUTHOR = {S. Zachos and H. Heller},
TITLE = {A decisive characterization of {$\BPP$}},
JOURNAL = infcomp,
YEAR = {1986},
VOLUME = {69},
PAGES = {125--135}
}
@InProceedings{ZaFu87,
author = "S. Zachos and M. F{\"u}rer",
title = "Probabilistic Quantifiers vs. Distrustful
Adversaries",
pages = "443--455",
booktitle = "Proceedings of the 7th Conference on Foundations of
Software Technology and Theoretical Computer Science",
address = "Pune, India",
month = dec,
year = "1987",
series = "LNCS",
volume = "287",
publisher = "Springer",
}
@article{Zak83,
author = {S. Zak},
title = {A {T}uring machine time hierarchy},
journal = tcs,
volume = {26},
year = {1983},
pages = {327--333}
}
@ARTICLE{Zac88,
AUTHOR = {S. Zachos},
TITLE = {Probabilistic quantifiers and games},
JOURNAL = jcss,
YEAR = {1988},
VOLUME = {36},
PAGES = {433--451}
}
@misc{ZaimiMO09,
author = {G. Zaimi},
title = {Local-global approach to graph theory},
note = {MathOverflow item},
howpublished = "http://mathoverflow.net/questions/10241/local-global-approach-to-graph-theory",
year = {2009}
}
@inproceedings{Zar94,
author = {C. Zarowski},
title = {A divisionless form of the {S}chur-{B}erlekamp-{M}assey
algorithm},
booktitle = {Information Theory and Applications---Proceedings,
Third Canadian Workshop, May/June 1993},
series = lncs,
volume = {793},
year = {1994},
pages = {38--44}
}
@inproceedings{Zem94,
author = {G. Z{\'e}mor},
title = {Threshold effects in codes},
booktitle = {Algebraic Coding---First French-Israeli Workshop,
Paris, July 1993},
series = lncs,
volume = {781},
publisher = springer,
year = {1994},
pages = {278--286}
}
@article{Zha91,
author = {W. Zhang},
title = {Cut elimination and automatic proof procedures},
journal = tcs,
volume = {91},
year = {1991},
pages = {265--284}
}
@article{Zha13,
author = {Y. Zhang},
title = {Bounded gaps between primes},
journal = {Annals of Mathematics},
year = {2013},
note = {to appear in 2014}
}
@inproceedings{ZBT93,
author = {Z.-L. Zhang and D. Mix Barrington and J. Tarui},
title = {Computing symmetric functions with {\it AND/OR\/}
circuits and a single {\it MAJORITY\/} gate},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {535--544}
}
@article{ZiRa07,
author = {Z. Zilic and K. Radecka},
title = {Scaling and Better Approximating Quantum
{F}ourier Transform by Higher Radices},
journal = {IEEE Trans. Comp.},
year = {2007},
volume = {56},
pages = {202--207}
}
@article{Zim92,
author = {M. Zimand},
title = {Pr{\'e}cisions sur la m{\'e}thode topologique en
complexit{\'e} algorithmique},
journal = {Singularit{\'e}},
volume = {3},
number = {7},
year = {1992},
pages = {25--27}
}
@techreport{Zim93,
author = {M. Zimand},
title = {On the topological size of p-m-complete degrees},
institution = {Computer Science, University of Rochester},
number = {459},
month = {May},
year = {1993}
}
@TechReport{Zim95,
author = "Marius Zimand",
title = "On Randomized Cryptographic Primitives",
institution = "University of Rochester, Computer Science Department",
number = "TR586",
month = nov,
year = "1995",
}
@inproceedings{Zip79,
author = {R. Zippel},
title = {Probabilistic algorithms for sparse polynomials},
booktitle = {Proceedings of the International Symposium on Symbolic
and Algebraic Manipulation ({EUROSAM} '79)},
editor = {Edward W. Ng},
series = lncs,
volume = {72},
publisher = springer,
address = {Marseilles},
year = {1979},
month = jun,
pages = {216--226}
}
@inproceedings{Zuc91,
author = {D. Zuckerman},
title = {Simulating {BPP} using a general weak random source},
booktitle = proc32 # focs,
year = {1991},
pages = {79--89}
}
@inproceedings{Zuc96,
author = {D. Zuckerman},
title = {Randomness-optimal sampling, extractors, and constructive
leader election},
booktitle = proc28 # stoc,
year = {1996},
pages = {286--295}
}
@article{Zuc07,
author = {D. Zuckerman},
title = {Linear degree extractors and inapproximability of {M}ax {C}lique and {C}hromatic {N}umber},
journal = {Theory of Computing},
volume = {3},
year = {2007},
pages = {103--128}
}
@article{AIK06,
author = {B. Applebaum and Y. Ishai and E. Kushilevitz},
title = {Cryptography in {NC}$^0$},
journal = sicomp,
year = 2006,
note = "to appear; previous version in FOCS 2004"
}
@inproceedings{AIK06b,
author = {B. Applebaum and Y. Ishai and E. Kushilevitz},
title = {On pseudorandom generators with linear stretch in {NC}$^0$},
booktitle = proc10 # "Random",
year = 2006
}
@inproceedings{IsKu00},
author = {Y. Ishai and E. Kushilevitz},
title = {Randomizing polynomials: A new representation with
applications to round-efficient secure computation},
booktitle = proc41 # focs,
year = {2000},
pages = {294--304}
}
@article{NaRe04,
author = {M. Naor and O. Reingold},
title = {Number=theoretic constructions of efficient pseudo-random
functions},
journal = jacm,
volume = {51},
year = {2004},
pages = {231--262}
}
@inproceedings{CrMi01,
author = {M. Cryan and P. Miltersen},
title = {On pseudorandom generators in {NC}$^0$},
booktitle = proc26 # mfcs,
year = {2001},
}
@inproceedings{AIK05,
author = {B. Applebaum and Y. Ishai and E. Kushilevitz},
title = {Computationally private randomizing polynomials and their
applications},
booktitle = proc20 # ccc,
year = {2005},
pages = {260--274}
}
@article{LMN93,
author = {N. Linial and Y. Mansour and N. Nisan},
title = {Constant depth circuits, {F}ourier transform, and
learnability},
journal = jacm,
year = {1993},
volume = {40},
pages = {607--620}
}
@article{Zuc96b,
author = {D. Zuckerman},
title = {Simulating {BPP} using a general weak random source},
journal = {Algorithmica},
volume = {16},
year = {1996},
pages = {367--391}
}
% ----------------------------- Publishers ------------------------------
@string{AW = "Addison Wesley"}
@string{KAP = "Kluwer Academic Publishers"}
@string{LEA = "Lawrence Erlbaum Associates"}
@string{MK = "Morgan Kaufmann"}
@string{MP = "MIT Press"}
@string{N-H = "North-Holland"}
@string{W = "Wiley"}
@string{SLNiCS = "Springer Lecture Notes in Computer Science"}
@string{S-V = "Springer-Verlag"}
% ----------------------------- Conferences ------------------------------
@string{FOCS = "Symposium on Foundations of Computer Science"}
@string{ICANN = "International Conference on Artificial Neural Networks"}
@string{ICNN = "IEEE International Conference on Neural Networks"}
@string{ISPP = "IEEE Symposium on Parallel Processing"}
@string{IJCNN = "International Joint Conference on Neural Networks"}
@string{NIPS = "Advances in Neural Information Processing Systems"}
@string{SNOWBIRD = "Neural Networks for Computing"}
@string{STACS = "Symposium on Theoretical Aspects of Computer Science"}
@string{ICPR = "International Conference on Pattern Recognition"}
@string{IPFWC = "Conference on Neural Networks and PDP, Indiana-Purdue"}
% -------------------------------- Books ---------------------------------
@string{EoAI = "Encyclopedia of Artificial Intelligence, Second Edition"}
%@string{inAR = "Reprinted in \cite{Anderson88}"}
@string{inAR = ""}
%@string{partinAR = "Partially reprinted in \cite{Anderson88}"}
@string{partinAR = ""}
@string{pdp = "Parallel Distributed Processing"}
% ------------------------------- Journals ---------------------------------
@string{AO = "Applied Optics"}
@string{BC = "Biological Cybernetics"}
@string{CACM = "Communications of the Association of Computing Machinery"}
@string{CSy = "Complex Systems"}
@string{CogSc = "Cognitive Science"}
@string{ConSc = "Connection Science"}
@string{IEEEAM = "IEEE ASSP Magazine"}
@string{IEEEE = "IEEE Expert"}
@string{IEEETIT = "IEEE Transactions on Information Theory"}
@string{IEEETCS = "IEEE Transactions on Circuits and Systems"}
@string{IEEETC = "IEEE Transactions on Computers"}
@string{IEEETPAMI = "IEEE Transactions on Pattern Analysis and Machine Intelligence"}
@string{IEEETSMC = "IEEE Transactions on Systems, Man, and Cybernetics"}
@string{IJNS = "International Journal of Neural Systems"}
@string{IPL = "Information Processing Letters"}
@string{JACM = "Journal of the Association of Computing Machinery"}
@string{JANN = "Journal of Artificial Neural Networks"}
@string{JPL = "Journal Physique Letters"}
@string{Ne = "Network"}
@string{Na = "Nature"}
@string{NC = "Neural Computation"}
@string{NN = "Neural Networks"}
@string{OR = "Operations Research"}
@string{PNAS = "Proceedings of the National Academy of Sciences, USA"}
@string{PR = "Pattern Recognition"}
@string{PRL = "Pattern Recognition Letters"}
@string{SA = "Scientific American"}
@string{S = "Science"}
@string{SIAMJC = "SIAM Journal on Computing"}
@string{TCS = "Theoretical Computer Science"}
% ----------------------------- main entries -------------------------------
@article{AbJ85,
author = "Abu-Mostafa, Y.S. and J.S. Jacques",
title = "Information Capacity of the Hopfield Model",
pages = "461--464",
journal = IEEETIT,
volume = 31,
number = 4,
month = "July",
year = 1985
}
@article{AbP87,
author = "Abu-Mostafa, Y.S. and D. Psaltis",
title = "Optical Neural Computers",
pages = "88--95",
journal = SA,
volume = 256,
month = "March",
year = 1987
}
@article{Abu89,
author = "Abu-Mostafa, Y.S.",
title = "The Vapnik-Chervonenkis Dimension: Information versus Complexity in Learning",
pages = "312--317",
journal = NC,
volume = 1,
year = 1989
}
@techreport{Aetal92,
author = "Arora, S. and C. Lund and R. Motwani and M. Sudan and M. Szegedy",
title = "On the Intractability of Approximation Problems",
note = "Manuscript (early draft)",
year = 1992
}
@article{Ama77,
author = "Amari, S.",
title = "Neural Theory of Association and Concept-formation",
pages = "175--185",
journal = BC,
volume = 26,
year = 1977
}
@article{Ama89,
author = "Amari, S.",
title = "Characteristics of Sparsely Encoded Associative Memory",
pages = "--",
journal = NN,
volume = 2,
number = 6,
year = 1989
}
@article{AHS85,
author = "Ackley, D.H. and G.E. Hinton and T.J. Sejnowski",
title = "A Learning Algorithm for Boltzmann Machines",
journal = CogSc,
volume = 9,
note = inAR,
year = 1985
}
@article{AuM70,
author = "Augustson, G. and J. Minker",
title = "An analysis of some graph-theoretical clustering techniques",
pages = "571--588",
journal = JACM,
volume = 17,
number = 4,
month = "October",
year = 1970
}
@article{BaB76,
author = "Barrow, H. and R. Burstall",
title = "Subgraph isomorphism, matching relational structures and maximal cliques",
pages = "83--84",
journal = IPL,
volume = 4,
year = 1976
}
@techreport{BaD,
author = "Baram, Y. and R. Dechter",
title = "Processing Constraints by Neural Networks",
institution = "Department of Computer and Information Science, University of California, Irvine",
address = "Irvine, CA",
note = "Unpublished",
month= "June",
year = 1989
}
@article{BaY86,
author = "Balas, E. and C.S. Yu",
title = "Finding a maximum clique in an arbitrary graph",
journal = SIAMJC,
volume = 15,
number = 4,
month = "November",
year = 1986
}
@inproceedings{BeS89,
author = "Berman, P. and G. Schnitger",
title = "On the Complexity of Approximating the Independent Set Problem",
pages = "256--267",
editor = "",
booktitle = STACS,
organization = "(Snowbird 1986)",
publisher = "Springer Lecture Notes in Computer Science",
address = "",
year = 1989
}
%MFA Betal89
@inproceedings{Betal89,
author = "Bilbro, G. and R. Mann and T.K. Miller and W.E. Snyder and D.E. Van den Bout and M. White",
title = "Optimization by Mean Field Annealing",
pages = "91--98",
editor = "D.S. Touretzky",
booktitle = NIPS,
volume = 1,
organization = "(Denver 1988)",
publisher = "Morgan Kaufmann",
address = "San Mateo",
year = 1989
}
%MFA Betal92
@article{Betal92,
author = "Bilbro, G. and W.E. Snyder and S.J. Garnier and J.W. Gault",
title = "Mean Field Annealing: A Formalism for Constructing GNC-Like Algorithms",
pages = "131--138",
journal = IEEETNN,
volume = 3,
number = 1,
month = "January",
year = 1992
}
%MFA Bil89
@inproceedings{Bil89,
author = "Bilbro, G.",
title = "Range Image Restoration using Mean Field Annealing",
editor = "D.S. Touretzky",
booktitle = NIPS,
volume = 1,
organization = "(Denver 1988)",
publisher = "Morgan Kaufmann",
address = "San Mateo",
year = 1989
}
%MFA BiS91
@article{BiS91,
author = "Bilbro, G.L. and W.E. Snyder",
title = "Optimization of Functions with Many Minima",
pages = "840--849",
journal = IEEETSMC,
volume = 21,
year = 1991
}
@inproceedings{BlB59,
author = "Bledsoe, W.W. and J. Browning",
title = "Pattern recognition and reading by machine",
pages = "225--232",
booktitle = "1959 Proceedings Eastern Joint Computer Conference",
publisher = "National Joint Computer Committee",
address = "New York",
month = "December",
year = 1959
}
@book{BoM76,
author = "Bondy, J.A. and U.S.R Murty",
title = "Graph Theory with Applications",
publisher = "North-Holland",
address = "New York",
year = 1976
}
%MFA BuA91
@inproceedings{BuA91,
author = "Bultan, T. and C. Aykanat",
title = "Parallel mean field algorithms for the solution of combinatorial optimization problems",
editor = "T. Kohonen and O. Simula and K. Makisara and J. Kangas",
pages = "129--139",
booktitle = ICANN,
volume = 1,
publisher = N-H,
address = "Amsterdam",
year = 1991
}
%MFA BuA
@inproceedings{BuA,
author = "Bultan, T. and C. Aykanat",
title = "Circuit Partitioning using Parallel mean field annealing algorithms",
booktitle = ISPP
}
@article{CFS91,
author = "Crescenzi, P. and C. Fiorini and R. Silvestri",
title = "A Note on the Approximation of the MAXCLIQUE Problem",
pages = "281--298",
journal = IPL,
volume = 40,
number = 1,
month = "October",
year = 1991
}
@article{CoG83,
author = "Cohen, M.A. and S. Grossberg",
title = "Absolute Stability of Global Pattern Formation and Parallel Memory Storage by Competitive Neural Networks",
pages = "815--826",
journal = IEEETSMC,
volume = 13,
year = 1983
}
@article{Dam64,
author = "Damerau, F.J.",
title = "A Technique for Computer Detection and Correction of Spelling Errors",
pages = "171--176",
journal = CACM,
volume = 7,
number = 5,
month = "March",
year = 1964
}
@inproceedings{Dec92,
author = "Dechter, R.",
title = "Constraint Networks",
pages = "276--285",
editor = "S.C. Shapiro",
booktitle = EoAI,
publisher = "John Wiley and Sons",
address = "New York",
year = 1992
}
@article{Dem89,
author = "Dembo, A.",
title = "On the Capacity of Associative Memories with Linear Threshold Functions",
pages = "709--720",
journal = IEEETIT,
volume = 35,
number = 4,
year = 1989
}
@article{ElL90,
author = "Elliman, D.G. and I.T. Lancaster",
title = "A Review of Segmentation and Contextual Analysis Techniques for Text Recognition",
pages = "337--346",
journal = PR,
volume = 23,
number = "3/4",
year = 1990
}
@article{Fetal85,
author = "Farhat, N.H. and D. Psaltis and A. Prata and E. Paek",
title = "Optical Implementation of the Hopfield Model",
journal = AO,
volume = 24,
note = inAR,
year = 1985
}
@inproceedings{Fetal91,
author = "Feige, U. and S. Goldwasser and L. Lov{\'a}sz
and S. Safra and M. Szegedy",
title = "Approximating CLIQUE is almost NP-complete",
pages = "",
editor = "",
booktitle = FOCS,
organization = "(Snowbird 1986)",
publisher = "",
address = "",
year = 1991
}
@article{FlO89,
author = "Floreen, P. and P. Orponen",
title = "On the Computational Complexity of Analyzing Hopfield Nets",
pages = "577-587",
journal = CSy,
volume = 3,
year = 1989
}
@book{GaJ79,
author = "Garey, M.R. and D.S. Johnson",
title = "Computers and Intractability: A Guide to the Theory of NP-Completeness",
publisher = "Freeman",
address = "New York",
year = 1979
}
@inproceedings{Getal86,
author = "Graf, H.P. and L.D. Jackel and R.E. Howard and B. Straughn and J.S. Denker and W. Hubbard and D.M. Tennant and D. Schwartz",
title = "VLSI Implementation of a Neural Network Memory with Several Hundreds of Neurons",
pages = "182--187",
editor = "J.S. Denker",
booktitle = SNOWBIRD,
organization = "(Snowbird 1986)",
publisher = "American Institute of Physics",
address = "New York",
year = 1986
}
@article{GoE88,
author = "Goshtasby, A. and R.W. Ehrich",
title = "Contextual Word Recognition Using Probabilistic Relaxation Labeling",
pages = "455--462",
journal = PR,
volume = 21,
number = 5,
year = 1988
}
@article{Gri83,
author = "Griggs, J.R.",
title = "Lower bounds on the independence number in terms of the degrees",
pages = "22--39",
journal = "Journal of Combinatorial Theory, Series B",
volume = 34,
year = 1983
}
@inproceedings{GuS89,
author = "Gurevich, Y. and S. Shelah",
title = "Nearly Linear Time",
year = 1989
}
@inproceedings{GrJ92,
author = "Grossman, T. and A. Jagota",
title = "On the Equivalence of Two Hopfield-type Networks",
booktitle = NIPS,
note = "Submitted to",
year = 1992
}
@article{GPS89,
author = "Gislen, L. and C. Peterson and B. Soderberg",
title = "``Teachers and Classes'' with Neural Networks",
pages = "167--176",
journal = IJNS,
volume = 1,
number = 2,
year = 1989
}
@techreport{GLL88,
author = "Godbeer, G.H. and J. Lipscomb and M. Luby",
title = "On the Computational Complexity of Finding Stable State Vectors in Connectionist Models (Hopfield Nets)",
institution = "Department of Computer Science, University of Toronto",
volume = "208/88",
address = "Toronto, Ontario",
year = 1988
}
@article{HaD80,
author = "Hall, P.A.V. and G.R. Dowling",
title = "Approximate String Matching",
pages = "17--38",
journal = "ACM Computing Surveys",
volume = 12,
month = "December",
year = 1980
}
@inproceedings{HaJ90,
author = "Hans-Martin, A. and M.D. Johnston",
title = "A Discrete Stochastic Neural Network For Constraint Satisfaction Problems",
pages = "",
booktitle = IJCNN,
volume = 1,
organization = "San Diego, June",
publisher = "IEEE",
address = "New York",
year = 1990
}
@book{Hebb49,
author = "Hebb, D.O.",
title = "The Organization of Behavior",
note = partinAR,
publisher = "Wiley",
address = "New York",
year = 1949
}
@book{HKP91,
author = "Hertz, J. and A. Krogh and R.G. Palmer",
title = "Introduction to the Theory of Neural Computation",
publisher = "Addison-Wesley",
address = "",
year = 1991
}
@article{Hop82,
author = "Hopfield, J.J.",
title = "Neural Networks and Physical Systems with Emergent Collective Computational Abilities",
journal = PNAS,
volume = 79,
note = inAR,
year = 1982
}
@phdthesis{Hot92,
author = "Ho, T.K.",
title = "A Theory of Multiple Classifier Systems and Its Application to Visual Word Recognition",
school = "State University of New York at Buffalo",
year = 1992
}
@inproceedings{HHS89,
author = "Ho, T. and J.J. Hull and S.N. Srihari",
title = "Recognition of Degraded Text Images",
pages = "",
editor = "",
booktitle = ICPR,
organization = "Pattern Recognition Systems and Applications Conference",
note = "Submitted",
publisher = "",
address = "",
year = 1989
}
@article{HFP83,
author = "Hopfield, J.J. and D.I. Feinstein and R.G. Palmer",
title = "``Unlearning'' Has a Stabilizing Effect in Collective Memories",
pages = "158--159",
journal = Na,
volume = 304,
year = 1983
}
@article{Hop84,
author = "Hopfield, J.J.",
title = "Neurons with Graded Responses Have Collective Computational Properties Like Those of Two-State Neurons",
journal = PNAS,
volume = 81,
note = inAR,
year = 1984
}
@article{HoT85,
author = "Hopfield, J.J. and D.W. Tank",
title = "``Neural'' Computation of Decisions in Optimization Problems",
pages = "141--152",
journal = BC,
volume = 52,
year = 1985
}
@article{HoT86,
author = "Hopfield, J.J. and D.W. Tank",
title = "Computing with Neural Circuits: A Model",
pages = "625--633",
journal = S,
volume = 233,
year = 1986
}
@article{HKP:Jetal89,
author = "Johnson, D.S. and C.R. Aragon and L.A. McGeoch and C. Schevon",
title = "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning",
pages = "865--891",
note = "Parts II and III expected to appear in 1990",
journal = OR,
volume = 37,
year = 1989
}
@inproceedings{JaO89,
author = "Jagota, A. and O. Jakubowicz",
title = "Knowledge Representation in a Multi-layered Hopfield Network",
pages = "",
booktitle = IJCNN,
volume = 1,
organization = "Washington-DC, June",
publisher = "IEEE",
address = "New York",
year = 1989
}
@inproceedings{JaH90,
author = "Jagota, A. and Y.S. Hung",
title = "A Neural Lexicon in a Hopfield-style Network",
pages = "",
booktitle = IJCNN,
volume = 1,
organization = "Washington-DC, January",
publisher = "IEEE",
address = "New York",
year = 1990
}
@techreport{Jag90a,
author = "Jagota, A.",
title = "A New Hopfield-style Network for Content-addressable Memories",
institution = "Department of Computer Science, SUNY at Buffalo",
number = "90-02",
address = "Buffalo, NY",
year = 1990
}
@inproceedings{Jag90b,
author = "Jagota, A.",
title = "Applying a Hopfield-style Network to Degraded Printed Text Restoration",
pages = "20--30",
booktitle = IPFWC,
organization = "Fort Wayne, April",
publisher = "Purdue Research Foundation",
address = "West Lafayette, Indiana",
year = 1990
}
@inproceedings{Jag90c,
author = "Jagota, A.",
title = "Applying a Hopfield-style Network to Degraded Text Recognition",
pages = "",
booktitle = IJCNN,
volume = 1,
organization = "San Diego, July",
publisher = "IEEE",
address = "New York",
year = 1990
}
@techreport{Jag90d,
author = "Jagota, A.",
title = "A Hopfield-style Network as a Maximal Clique Graph Machine",
institution = "Department of Computer Science, SUNY at Buffalo",
number = "90-25",
address = "Buffalo, NY",
year = 1990
}
@inproceedings{Jag91a,
author = "Jagota, A.",
title = "Backtracking Dynamics in a Hopfield-style Network",
booktitle = IJCNN,
organization = "Seattle, July",
publisher = "IEEE",
note = "Abstract in Proceedings",
address = "New York",
year = 1991
}
@inproceedings{Jag91b,
author = "Jagota, A.",
title = "Novelty Detection on a very large number of memories stored in a Hopfield-style Network",
booktitle = IJCNN,
organization = "Seattle, July",
publisher = "IEEE",
note = "Abstract in Proceedings",
address = "New York",
year = 1991
}
@article{Jag91c,
author = "Jagota, A.",
title = "Information Capacity of a Hopfield-style Memory",
pages = "",
journal = "Unpublished",
year = 1991
}
@incollection{Jag91d,
author = "Jagota, A.",
title = "Representing Discrete Structures in a Hopfield-style Network",
pages = "",
editor = "Levine, D.S. and M. Aparicio",
booktitle = "Neural Networks in Knowledge Representation and Inference",
note = "To be Published",
publisher = LEA,
year = 1992
}
@inproceedings{Jag92a,
author = "Jagota, A.",
title = "Efficiently Approximating Max-Clique in a Hopfield-style Network",
pages = "",
booktitle = IJCNN,
volume = 1,
organization = "Baltimore, June",
publisher = "IEEE",
address = "New York",
year = 1992
}
@article{Jag92b,
author = "Jagota, A.",
title = "A Hopfield-style Network with a Graph-theoretic Characterization",
pages = "",
journal = JANN,
note = "To Appear",
year = 1992
}
@article{Jag92c,
author = "Jagota, A.",
title = "Error-detection in an Overloaded Hopfield-style Memory",
pages = "",
note = "To Be Submitted",
year = 1992
}
@book{KaH90,
author = "Kamp, Y. and M. Hasler",
title = "Recursive Neural Networks for Associative Memory",
publisher = "Wiley",
address = "New York",
year = 1990
}
@article{KaO84,
author = "Kashyap, R.L. and B.J. Oommen",
title = "Spelling Correction Using Probabilistic Methods",
pages = "147--154",
journal = PRL,
volume = 2,
number = 4,
year = 1984
}
@incollection{Kar72,
author = "Karp, R.M.",
title = "Reducibility among combinatorial problems",
pages = "85--103",
editor= "Miller, R.E. and J.W. Thatcher",
booktitle = "Complexity of Computer Computations",
publisher = "Plenum Press",
address = "New York",
year = 1972
}
@incollection{Kar76,
author = "Karp, R.M.",
title = "The probabilistic analysis of some combinatorial search algorithms",
pages = "1--19",
editor= "Traub, J.F.",
booktitle = "Algorithms and Complexity: New Directions and Recent Results",
publisher = "Academic Press",
address = "New York",
year = 1976
}
@article{KGV83,
author = "Kirkpatrick, S. and C.D. Gelatt Jr. and and M.P. Vecchi",
title = "Optimization by Simulated Annealing",
journal = S,
volume = 220,
note = inAR,
year = 1983
}
@techreport{Lau91,
author = "Lautrup, B.",
title = "Lecture notes on the Theory of The Hopfield Model",
institution = "NBI Preprint",
month = "May",
year = 1991
}
@article{Lip87,
author = "Lippmann, R.P.",
title = "An Introduction to Computing with Neural Nets",
pages = "4--22",
journal = IEEEAM,
month = "April",
year = 1987
}
@article{LiV92,
author = "Li, M. and P.M.B. Vitanyi",
title = "Average case complexity under the universal distribution equals worst-case complexity",
pages = "145--149",
journal = IPL,
volume = 42,
month = "May",
year = 1992
}
@article{LoW75,
author = "Lowrance, R. and R.A. Wagner",
title = "An Extension of the String-to-String Correction Problem",
pages = "177--183",
journal = JACM,
volume = 22,
number = 2,
month = "April",
year = 1975
}
@inproceedings{Mac92,
author = "Mackworth, A.K.",
title = "Constraint Satisfaction",
pages = "285--290",
editor = "S.C. Shapiro",
booktitle = EoAI,
publisher = "John Wiley and Sons",
address = "New York",
year = 1992
}
@book{McR86,
author = "J.L. McClelland and Rumelhart, D.E. and the PDP Research Group",
title = "Parallel Distributed Processing: Explorations in the Microstructure of Cognition",
volume = 2,
publisher = "MIT Press",
address = "Cambridge",
year = 1986
}
@book{McR88,
author = "McClelland, J.L. and D.E. Rumelhart",
title = "Explorations in Parallel Distributed Processing",
publisher = "MIT Press",
address = "Cambridge",
year = 1988
}
@article{HKP:McP43,
author = "McCulloch, W.S. and W. Pitts",
title = "A Logical Calculus of Ideas Immanent in Nervous Activity",
journal = BMBIOPHYS,
volume = 5,
note = inAR,
year = 1943
}
@article{MeP85,
author = "Mezard, M. and G. Parisi",
title = "Mean Field Equations for the Matching and Travelling Salesman Problems",
journal = JPL,
volume = 46,
year = 1985
}
@article{Metal87,
author = "McEliece, R.J. and E.C. Posner and E.R. Rodemich and S.S. Venkatesh",
title = "The Capacity of the Hopfield Associative Memory",
pages = "461--482",
journal = IEEETIT,
volume = 33,
year = 1987
}
@book{Mea89,
author = "Mead, C.",
title = "Analog VLSI and Neural Systems",
publisher = "Addison Wesley",
address = "Reading",
year = 1989
}
@article{Metal53,
author = "Metropolis, N. and A.W. Rosenbluth and M.N. Rosenbluth and A.H. Teller and E. Teller",
title = "Equation of State Calculations for Fast Computing Machines",
pages = "1087--1092",
journal = JCP,
volume = 21,
year = 1953
}
@book{MiP69,
author = "Minsky, M.L. and S.A. Papert",
title = "Perceptrons",
note = partinAR,
publisher = "MIT Press",
address = "Cambridge",
year = 1969
}
@article{Nad90,
author = "Nadel, B.A.",
title = "Representation Selection for Constraint Satisfaction: A Case Study using n-queens",
pages = "16--23",
journal = IEEEE,
volume = 2,
number = 6,
year = 1989
}
@InProceedings{NeWo06,
title = "{P}-completeness of Cellular Automaton Rule 110",
author = "Turlough Neary and Damien Woods",
bibdate = "2006-07-10",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/icalp/icalp2006-1.html#NearyW06",
booktitle = "Automata, Languages and Programming, 33rd
International Colloquium, {ICALP} 2006, Venice, Italy,
July 10-14, 2006, Proceedings, Part {I}",
publisher = "Springer",
year = "2006",
volume = "4051",
editor = "Michele Bugliesi and Bart Preneel and Vladimiro
Sassone and Ingo Wegener",
pages = "132--143",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11786986_13",
}
@article{Neu75,
author = "Neuhoff, D.L.",
title = "The Viterbi Algorithm as an Aid in Text Recognition",
pages = "222-226",
journal = IEEETIT,
volume = 21,
year = 1975
}
@article{Orl85,
author = "Orland, H.",
title = "Mean-Field Theory for Optimization Problems",
pages = "763--770",
journal = JPPL,
volume = 46,
year = 1985
}
@book{Pal85,
author = "Palmer, E.M.",
title = "Graphical evolution",
publisher = W,
address = "New York",
note = "Matula's theorem on page 76",
year = 1985
}
@incollection{Pal88,
author = "Palmer, R.G.",
title = "Statistical Mechanics Approaches to Complex Optimization Problems",
pages = "177--193",
editor = "P.W. Anderson and K.J. Arrow and D. Pines",
booktitle = "The Economy As an Evolving Complex System",
series = "SFI Studies in the Sciences of Complexity: Proceedings",
volume = 5,
publisher = "Addison-Wesley",
address = "Redwood City",
year = 1988
}
%MFA Par91
@inproceedings{Par91,
author = "Park, C.I.",
title = "Predicting the Annealing Range by Computing Critical Temperature in MFA for TSP in ``Artificial Neural Networks''",
editor = "T. Kohonen and O. Simula and K. Makisara and J. Kangas",
booktitle = ICANN,
publisher = N-H,
address = "Amsterdam",
year = 1991
}
@article{HKP:Peretto84,
author = "Peretto, P.",
title = "Collective Properties of Neural Networks: A Statistical Physics Approach",
pages = "51--62",
journal = BC,
volume = 50,
year = 1984
}
@inproceedings{HKP:Peretto86,
author = "Peretto, P. and J.J. Niez",
title = "Collective Properties of Neural Networks",
pages = "171--185",
editor = "E. Bienenstock and F. Fogelman-Souli\'e and G. Weisbuch",
booktitle = "Disordered Systems and Biological Organization",
organization = "(Les Houches 1985)",
publisher = "Springer-Verlag",
address = "Berlin",
year = 1986
}
@article{HKP:Peretto88,
author = "Peretto, P.",
title = "On Learning Rules and Memory Storage Abilities of Asymmetrical Neural Networks",
pages = "711--726",
journal = JPP,
volume = 49,
year = 1988
}
@article{HKP:Personnaz85,
author = "Personnaz, L. and I. Guyon and G. Dreyfus",
title = "Information Storage and Retrieval in Spin-Glass-Like Neural Networks",
pages = "359--365",
journal = JPPL,
volume = 46,
year = 1985
}
@article{HKP:Personnaz86,
author = "Personnaz, L. and I. Guyon and G. Dreyfus",
title = "Collective Computational Properties of Neural Networks: New Learning Mechanisms",
pages = "4217--4228",
journal = PRA,
volume = 34,
year = 1986
}
@article{PeA87,
author = "Peterson, C. and J.R. Anderson",
title = "A Mean Field Theory Learning Algorithm for Neural Networks",
pages = "995--1019",
journal = CSy,
volume = 1,
year = 1987
}
%MFA PeA88
@article{PeA88,
author = "Peterson, C. and J.R. Anderson",
title = "Neural Networks and NP-complete optimization problems; a performance study on the graph bisection problem",
journal = CSy,
volume = 59,
year = 1988
}
%MFA PeS89
@article{PeS89,
author = {Peterson, C. and B. S\"oderberg},
title = "A New Method for Mapping Optimization Problems onto Neural Networks",
pages = "3--22",
journal = IJNS,
volume = 1,
year = 1989
}
@article{Pet80,
author = "Peterson, J.L.",
title = "Computer programs for detecting and correcting spelling errors",
pages = "676--687",
journal = CACM,
volume = 23,
number = 12,
month = "December",
year = 1980
}
%MFA Pet91
@article{Pet91,
author = "Peterson, C.",
title = "Mean Field Theory Neural Networks for Feature Recognition, Content Addressable Memory and Optimization",
journal = ConSc,
volume = 3,
number = 1,
year = 1991
}
@article{Pin,
author = "Pinkas, G.",
title = "Symmetric Neural Nets and Propositional Logic Satisfiability",
pages = "",
journal = NC,
volume = 3,
number = 2,
note = "To Appear"
}
@inproceedings{RaS88,
author = "Ramanujam, J. and P. Sadayappan",
title = "Optimization by Neural Networks",
pages = "325--332",
booktitle = ICNN,
volume = 2,
organization = "(San Diego 1988)",
publisher = "IEEE",
address = "New York",
year = 1988
}
@article{RiE71,
author = "Riseman, E.M. and R.W. Ehrich",
title = "Contextual Word Recognition Using Binary Digrams",
pages = "397--403",
journal = IEEETC,
volume = 20,
number = 4,
month = "April",
year = 1971
}
@article{RiE74,
author = "Riseman, E.M. and R.W. Ehrich",
title = "A Contextual Postprocessing System for Error Correction Using Binary N-grams",
pages = "480--493",
journal = IEEETC,
volume = 23,
number = 5,
month = "May",
year = 1974
}
@phdthesis{HKP:Romeo89,
author = "Romeo, F.I.",
title = "Simulated Annealing: Theory and Applications to Layout Problems",
school = "University of California at Berkeley",
note = "Memorandum UCB/ERL--M89/29",
year = 1989
}
@book{HKP:Rosenblatt62,
author = "Rosenblatt, F.",
title = "Principles of Neurodynamics",
publisher = "Spartan",
address = "New York",
year = 1962
}
@book{RMc86,
author = "Rumelhart, D.E. and J.L. McClelland and the PDP Research Group",
title = "Parallel Distributed Processing: Explorations in the Microstructure of Cognition",
volume = "1",
publisher = "MIT Press",
address = "Cambridge",
year = 1986
}
@article{RHW86a,
author = "Rumelhart, D.E. and G.E. Hinton and R.J. Williams",
title = "Learning Representations by Back-Propagating Errors",
pages = "533--536",
journal = Na,
volume = 323,
note = inAR,
year = 1986
}
@incollection{RHW86b,
author = "Rumelhart, D.E. and G.E. Hinton and R.J. Williams",
title = "Learning Internal Representations by Error Propagation",
pages = "318--362",
editor = "Rumelhart, D.E. and J.L. McClelland",
booktitle = pdp,
volume = 1,
chapter = 8,
note = inAR,
publisher = "MIT Press",
address = "Cambridge",
year = 1986
}
@inproceedings{Setal90,
author = "Shariv, I. and T. Grossman and E. Domany and A.A. Friesem",
title = "All-optical implementation of the inverted neural network model",
pages = "",
editor = "",
booktitle = "Optics in Complex Systems",
publisher = "SPIE",
volume = 1319,
address = "",
year = 1990
}
@article{ShT79,
author = "Shinghal, R. and G.T. Toussaint",
title = "Experiments in Text Recognition with the Modified Viterbi Algorithm",
pages = "184--193",
journal = IEEETPAMI,
volume = 2,
year = 1979
}
@article{Sim90,
author = "Simic, P.D.",
title = "Statistical Mechanics As the Underlying Theory of ``Elastic'' and ``Neural'' Optimizations",
pages = "89--103",
journal = Ne,
volume = 1,
year = 1990
}
@article{SHC83,
author = "Srihari, S.N. and J.J. Hull and R. Choudhari",
title = "Integrating Diverse Knowledge Sources in Text Recognition",
pages = "68--87",
journal = "ACM Transactions on Office Information Systems",
volume = 1,
number = 1,
month = "January",
year = 1983
}
@inproceedings{Szu86,
author = "Szu, H.",
title = "Fast Simulated Annealing",
pages = "420--425",
editor = "J.S. Denker",
booktitle = SNOWBIRD,
organization = "(Snowbird 1986)",
publisher = "American Institute of Physics",
address = "New York",
year = 1986
}
@article{TaH86,
author = "Tank, D.W. and J.J. Hopfield",
title = "Simple ``Neural'' Optimization Networks: An A/D Converter, Signal Decision Circuit, and a Linear Programming Circuit",
pages = "533--541",
journal = IEEETCS,
volume = 33,
year = 1986
}
@incollection{Tak92a,
author = "Takefuji, Y.",
title = "Neural Network Models and N-queen Problems",
pages = "1--26",
editor = "Takefuji, Y.",
booktitle = "Neural Network Parallel Computing",
chapter = 1,
publisher = KAP,
address = "Boston",
year = 1992
}
@article{Tetal87,
author = "Thakoor, A.P. and A. Moopenn and J. Lambe and S.K. Khanna",
title = "Electronic Hardware Implementations of Neural Networks",
pages = "5085--5092",
journal = AO,
volume = 26,
year = 1987
}
@article{Val79r,
author = "Valiant, L.G.",
title = "The Complexity of Enumeration and Reliability Problems",
pages = "410--421",
journal = SIAMJC,
volume = 8,
number = 3,
year = 1979
}
%MFA VaM89
@article{VaM89,
author = "Van den Bout, D.E. and T.K. Miller",
title = "Improving the Performance of the Hopfield-Tank Neural Network Through Normalization and Annealing",
pages = "129--139",
journal = BC,
volume = 62,
year = 1989
}
%MFA VaM90
@article{VaM90,
author = "Van den Bout, D.E. and T.K. Miller",
title = "Graph Partitioning Using Annealed Neural Networks",
pages = "192--203",
journal = IEEETNN,
volume = 1,
number = 2,
month = "June",
year = 1990
}
@article{HKP:Vapnik71,
author = "Vapnik, V.N. and A.Y. Chervonenkis",
title = "On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities",
pages = "264--280",
journal = tprobapp,
volume = 16,
year = 1971
}
%MFA VeP91
@inproceedings{Vep91,
author = "Vepralainen, A.M.",
title = "Annealing with Chaotic Neurons in ``Artificial Neural Networks''",
editor = "T. Kohonen and O. Simula and K. Makisara and J. Kangas",
pages = "181--186",
booktitle = ICANN,
volume = 1,
publisher = N-H,
address = "Amsterdam",
year = 1991
}
@article{WaF74,
author = "Wagner, R.A. and M.J. Fischer",
title = "The String-to-String Correction Problem",
pages = "168--173",
journal = JACM,
volume = 21,
number = 1,
year = 1974
}
@article{Wie91,
author = "Wiedermann, J.",
title = "On the Computational Efficiency of Symmetric Neural Networks",
pages = "337--345",
journal = TCS,
volume = 80,
year = 1991
}
@article{HKP:Weisbuch85,
author = "Weisbuch, G. and F. Fogelman-Souli\'e",
title = "Scaling Laws for the Attractors of Hopfield Networks",
pages = "623--630",
journal = jppl,
volume = 46,
year = 1985
}
@phdthesis{HKP:Werbos74,
author = "Werbos, P.",
title = "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences",
school = "Harvard University",
year = 1974
}
@article{HKP:Willshaw69,
author = "Willshaw, D.J. and O.P. Buneman and H.C. Longuet-Higgins",
title = "Non-Holographic Associative Memory",
journal = Na,
volume = 222,
note = inAR,
year = 1969
}
@article{HKP:Wilson88,
author = "Wilson, G.V. and G.S. Pawley",
title = "On the Stability of the Travelling Salesman Problem Algorithm of Hopfield and Tank",
pages = "63--70",
journal = BC,
volume = 58,
year = 1988
}
@misc{ORT07,
author = {M. Ogihara and K. Regan and S. Toda},
title = {Graded self-reducibility},
year = {2007},
note = {Submitted to COCOON'07},
url = "{\tt www.cse.buffalo.edu/$\sim$regan/papers/pdf/ORT07.pdf}"
}
@misc{Danailov041006,
author = {S. Danailov},
title = {Coincidence Statistics of the moves of GM Kramnik
with recommendations of the chess program Fritz 9},
year = {2006},
month = {October~4},
url = {http://www.chessbase.com/newsdetail.asp?newsid=3401}
}
@misc{ChessBase070103,
author = {ChessBase News},
title = {Scandal in Lampertsheim---cheating in the loo},
year = {2006},
month = {July~1},
url = {http://www.chessbase.com/newsprint.asp?newsid=693}
}
@misc{ChessBase281206,
author = {ChessBase News},
title = {India: player gets ten year ban for cheating},
year = {2006},
month = {December~28},
url = {http://www.chessbase.com/newsdetail.asp?newsid=3573}
}
@inproceedings{GGV06,
author = {S. Guha and A. McGregor and S. Venkatasubramanian},
title = {Streaming and sublinear approximation of entropy and
information distance},
booktitle = {Proceedings, 2006 Symposium on Discrete Algorithms},
year = {2006}
}
@article{GuBr06,
author = {M. Guid and I. Bratko},
title = {Computer analysis of world chess champions},
journal = {ICGA Journal},
volume = {29},
number = {2},
year = {2006},
pages = {65--73}
}
@Article{HaTo01,
title = "Inequalities between entropy and index of coincidence
derived from information diagrams",
author = "Peter Harremo{\"e}s and Flemming Tops{\o}e",
journal = "IEEE Transactions on Information Theory",
year = "2001",
number = "7",
volume = "47",
bibdate = "2004-07-26",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/tit/tit47.html#HarremoesT01",
pages = "2944--2960",
}
@misc{Jac06,
author = {Jon Jacobs},
title = {Results of ``Chess Cheating Town Meeting''},
year = {2006},
month = {December},
url = {http://www.seniorchess.zoomshare.com/2.html}
}
@inproceedings{KoKr02,
author = {Anna Korhonen and Yuval Krymolowski},
title = {On the robustness of entropy-based similarity measures in evaluation of subcategorization acquisition systems},
booktitle = {COLING-02: proceeding of the 6th conference on Natural language learning},
year = {2002},
pages = {1--7},
publisher = {Association for Computational Linguistics},
address = {Morristown, NJ, USA},
}
@InProceedings{Lee01,
author = {Lillian Lee},
title = {On the Effectiveness of the Skew Divergence for
Statistical Language Analysis},
booktitle = "Artificial Intelligence and Statistics 2001",
pages = {65--72},
year = 2001
}
@InProceedings{Lee99,
author = {Lillian Lee},
title = {Measures of Distributional Similarity},
booktitle = "37th Annual Meeting of the Association for Computational Linguistics",
pages={25--32},
year = 1999,
}
@article{Lin91,
author = {J. Lin},
title = {Divergence measures based on the {S}hannon entropy},
journal = {IEEE Trans.\ Info.\ Thy.},
volume = {37},
year = {1991},
pages = {145--151}
}
@misc{Regan1006,
author = {K. Regan},
title = {Measuring Fidelity to a Computer Agent:
Testing {T}eam {T}opalov's Claims of Cheating at Chess},
year = {2006},
month = {October},
url = {http://www.cse.Buffalo.EDU/~regan/chess/fidelity/}
}
@misc{ReganTK2,
author = {K. Regan},
year = {2006},
month = {October 10},
url = {http://www.cse.Buffalo.EDU/~regan/chess/fidelity/KT2results.txt}
}
@misc{Sensei06,
author = {Sensei's Library},
title = {Elo Rating: Depth of something ranked with {Elo}},
note = {Last edited Nov. 21, 2006},
url={http://senseis.xmp.net/?EloRating#toc7}
}
@Article{Top00,
title = "Some inequalities for information divergence and
related measures of discrimination",
author = "Flemming Tops{\o}e",
journal = "IEEE Transactions on Information Theory",
year = "2000",
number = "4",
volume = "46",
bibdate = "2004-09-22",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/tit/tit46.html#Topsoe00",
pages = "1602--1609",
}
@article{Top02,
author = {F. Tops{\o}e},
title = {Maximum entropy verusu minimum risk and applications to
some classical discrete distributions},
journal = {IEEE Trans. Info. Thy.},
volume = {48},
year = {2002},
pages = {2368--2376}
}
@misc{wiki:KvW04,
author = "Wikipedia",
title = "Kasparov versus The World",
month = {June},
year = "2004",
url = "http://en.wikipedia.org/wiki/Kasparov_versus_The_World",
note = "[Online; accessed 09-February-2007, last rev.\ was 18-January-2007]"
}
@misc{LiRe10post,
author = {R. Lipton and K. Regan},
title = {Sorting out chess endgames},
note = {Blog post, {G\"o}del's Lost Letter and P=NP},
year = {2010},
month = {May 20},
howpublished = {http://rjlipton.wordpress.com/2010/05/20/sorting-out-chess-endgames/}
}
@misc{Regan1006,
author = {K. Regan},
title = {Measuring Fidelity to a Computer Agent:
Testing {T}eam {T}opalov's Claims of Cheating at Chess},
year = {2006},
month = {October},
howpublished = {http://www.cse.Buffalo.EDU/~regan/chess/fidelity/}
}
@misc{ReganTK2,
author = {K. Regan},
year = {2006},
month = {October 10},
howpublished = {http://www.cse.Buffalo.EDU/~regan/chess/fidelity/KT2results.txt}
}
@inproceedings{RMH11,
author = {K. Regan and B. Macieja and G. Haworth},
title = {Understanding distributions of chess performances},
booktitle = {Proceedings of the 13th ICGA Conference on Advances in Computer Games, Tilburg, Netherlands},
month = {November 2011},
year = {2011}
}
@misc{ReLi10post,
author = {K. Regan and R. Lipton},
title = {Can we solve chess one day?},
note = {Blog post, {G\"o}del's Lost Letter and P=NP},
year = {2010},
month = {May 12},
howpublished = {http://rjlipton.wordpress.com/2010/05/12/can-we-solve-chess-one-day/}
}
@inproceedings{ReBi13,
author = {K. Regan and T. Biswas},
title = {Psychometric Modeling of Decision Making Via Game Play},
booktitle = {Proceedings,IEEE Conference on Computational Intelligence in Games, Niagara Falls, Canada},
month = {August},
year = {2013},
}
@inproceedings{HBR15,
author = {G.~Haworth and T.~Biswas and K.~Regan},
title = {A Comparative Review of Skill Assessment: Performance, Prediction and Profiling},
booktitle = {Proceedings of the 14th ICGA {\em Advances in Computer Games\/} conference, Leiden, Netherlands, July 2015},
series = {Lect. Notes Comp. Sci.},
publisher = {Springer-Verlag},
year = {2015},
note = {to appear}
}
@inproceedings{Biswas15,
author = {T. Biswas},
title = {Designing Intelligent Agents to Judge Intrinsic Quality of Human Decisions},
booktitle = {Proceedings, International Conference on Agents and Artificial Intelligence (ICAART), Lisbon, Portugal},
month = {January},
year = {2015},
}
@inproceedings{BiRe15a,
author = {T. Biswas and K. Regan},
title = {Quantifying Depth and Complexity of Thinking and Knowledge},
booktitle = {Proceedings, International Conference on Agents and Artificial Intelligence (ICAART), Lisbon, Portugal},
month = {January},
year = {2015},
}
@misc{BiRe15b,
author = {T. Biswas and K. Regan},
title = {Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data},
month = {July},
year = {2015},
note = {{S}ubmitted}
}
@inproceedings{RBZ14,
author = {K. Regan and T. Biswas and J. Zhou},
title = {Human and Computer Preferences at Chess},
booktitle = {Proceedings of the 8th Multidisciplinary Workshop on Advances in Preference Handling (MPref 2014)},
month = {July},
year = {2014}
}
@inproceedings{BR14,
author = {T. Biswas and
K. Regan},
title = {Efficient Memoization for Approximate Function Evaluation over Sequence
Arguments.},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014.},
year = {2014},
pages = {185--196},
}
@inproceedings{ABV15a,
author = {Amir Abboud and Arturs Backurs and Virginia Vassilevska Williams},
title = {If the Current Clique Algorithms are Optimal, so is Valiant's Parser},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{AlWi15,
author = {Josh Alman and Ryan Williams},
title = {Probabilistic Polynomials and Hamming Nearest Neighbors},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{ABV15b,
author = {Amir Abboud and Arturs Backurs and Virginia Vassilevska Williams},
title = {Tight Hardness Results for {LCS} and other Sequence Similarity Measures},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{BrKu15,
author = {Karl Bringmann and Marvin K{\"u}nnemann},
title = {Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{CFGW15,
author = {Jin-Yi Cai and Zhiguo Fu and Heng Guo and Tyson Williams},
title = {A Holant Dichotomy: Is the {FKT} Algorithm Universal?},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{SSS15,
author = {Leonard Schulman and Alistair Sinclair and Piyush Srivastava},
title = {Symbolic integration and the complexity of computing averages},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{RST15,
author = {Benjamin Rossman and Rocco A. Servedio and Li-Yang Tan},
title = {An average-case depth hierarchy theorem for {B}oolean circuits},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{Ros15,
author = {Benjamin Rossman},
title = {The Average Sensitivity of Bounded-Depth Formulas},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{She15,
author = {Alexander Sherstov},
title = {The Power of Asymmetry in Constant-Depth Circuits},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{For15,
author = {M. Forbes},
title = {Deterministic Divisibility Testing via Shifted Partial Derivatives},
booktitle = proc56 # focs,
year = {2015},
}
@inproceedings{GrSc15,
author = {Martin Grohe and Pascal Schweitzer},
title = {Computing with Tangles},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{ODoWr15,
author = {Ryan O'Donnell and John Wright},
title = {Quantum Spectrum Testing},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{GLOS15,
author = {Sanjam Garg and Steve Lu and Rafail Ostrovsky and Alessandra Scafuro},
title = {Garbled {RAM} From One-Way Functions},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{DSS15,
author = {Jian Ding and Allan Sly and Nike Sun},
title = {Proof of the satisfiability conjecture for large k},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{BaIn15,
author = {Arturs Backurs and Piotr Indyk},
title = {Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless {SETH} is false)},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{CDST15,
author = {Xi Chen and Anindya De and Rocco Servedio and Li-Yang Tan},
title = {Boolean function monotonicity testing requires (almost) {$n^{1/2}$} non-adaptive queries},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{AVY15,
author = {Amir Abboud and Virginia Vassilevska Williams and Huacheng Yu (Stanford)
},
title = {Matching triangles and basing hardness on an extremely popular conjecture},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{FPV15,
author = {Vitaly Feldman and Will Perkins and Santosh Vempala},
title = {On the Complexity of Random Satisfiability Problems with Planted Solutions},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{GKR15,
author = {Anat Ganor and Gillat Kol and Ran Raz},
title = {Exponential Separation of Information and Communication for {B}oolean Functions},
booktitle = proc47 # stoc,
year = {2015},
}
@inproceedings{CGW14,
author = {Jin-Yi Cai and Heng Guo and Tyson Williams},
title = {The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{AbVa14,
author = {Amir Abboud and Virginia Vassilevska Williams},
title = {Popular conjectures imply strong lower bounds for dynamic problems},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{Bri14,
author = {Karl Bringmann},
title = {Why walking the dog takes time: {F}rechet distance has no strongly subquadratic algorithms unless {SETH} fails},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{Saha14,
author = {Barna Saha},
title = {The {D}yck Language Edit Distance Problem in Near-linear Time},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{GrPi14,
author = {Joshua A. Grochow and Toniann Pitassi},
title = {Circuit Complexity, Proof Complexity, and Polynomial Identity Testing},
booktitle = proc55 # focs,
year = {2014},
}
(KTH Royal Institute of Technology)
@inproceedings{AGH14,
author = {Per Austrin and Venkatesan Guruswami and Johan H{\aa}stad},
title = {{$(2+\epsilon)$}-{SAT} is {NP}-hard},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{BrEf14,
author = {Mark Braverman and Klim Efremenko},
title = {List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{LRR14,
author = {Yuan Li and Alexander Razborov and Benjamin Rossman},
title = {On the {AC$^0$} Complexity of Subgraph Isomorphism},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{GKR14,
author = {Anat Ganor and Gillat Kol and Ran Raz},
title = {Exponential Separation of Information and Communication},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{KLSS14,
author = {Neeraj Kayal and Nutan Limaye and Chandan Saha and Srikanth Srinivasan},
title = {An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas},
booktitle = proc55 # focs,
year = {2014},
}
@inproceedings{RuWo14,
author = {Atri Rudra and Mary Wootters},
title = {Every list-decodable code for high noise has abundant near-optimal rate puncturings},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{Kane14,
author = {Daniel Kane},
title = {The Average Sensitivity of an Intersection of Half Spaces},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{KRR14,
author = {Yael Tauman Kalai and Ran Raz and Ron D. Rothblum},
title = {How to Delegate Computations: The Power of No-Signaling Proofs},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{KTW14,
author = {Subhash Khot and Madhur Tulsiani and Pratik Worah},
title = {A Characterization of Approximation Resistance},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{Rot14b,
author = {Thomas Rothvoss},
title = {The matching polytope has exponential extension complexity},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{BCCKS14,
author = {Dominic Berry and Andrew Childs and Richard Cleve and Robin Kothari and Rolando D. Somma},
title = {Exponential improvement in precision for simulating sparse {H}amiltonians},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{Wil14a,
author = {Ryan Williams},
title = {Faster all-pairs shortest paths via circuit complexity},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{Wil14b,
author = {Ryan Williams},
title = {New algorithms and lower bounds for circuits with linear threshold gates},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{GoWi14,
author = {Oded Goldreich and Avi Wigderson},
title = {On Derandomizing Algorithms that Err Extremely Rarely},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{LSS14,
author = {Nutan Limaye and Chandan Saha and Srikanth Srinivasan},
title = {Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{FLMS14,
author = {Herv{\'e} Fournier and Nutan Limaye and Guillaume Malod and Srikanth Srinivasan},
title = {Lower bounds for depth 4 formulas computing iterated matrix multiplication},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{KuSa14,
author = {Mrinal Kumar and Shubhangi Saraf},
title = {The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{Ris14,
author = {Benjamin Rossman},
title = {Formulas vs. Circuits for Small Distance Connectivity},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{Rot14a,
author = {Thomas Rothvoss},
title = {The matching polytope has exponential extension complexity},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{KSS14,
author = {Neeraj Kayal and Chandan Saha and Ramprasad Saptharishi},
title = {A super-polynomial lower bound for regular arithmetic formulas},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{BCPR14,
author = {Nir Bitansky and Ran Canetti and Omer Paneth and Alon Rosen},
title = {On the Existence of Extractable One-Way Functions},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{She14,
author = {Alexander Sherstov},
title = {Breaking the {M}insky-{P}apert Barrier for Constant-Depth Circuits},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{BCKLS14,
author = {Harry Buhrman and Richard Cleve and Michal Koucky and Bruno Loff and Florian Speelman},
title = {Computing with a full memory},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{DiSt14,
author = {Irit Dinur and David Steurer},
title = {Analytical Approach to Parallel Repetition},
booktitle = proc46 # stoc,
year = {2014},
}
@inproceedings{GKKS13,
author = {Ankit Gupta and Pritish Kamath and Neeraj Kayal and Ramprasad Saptharishi},
title = {Arithmetic circuits: A chasm at depth three},
booktitle = proc54 # focs,
year = {2013},
}
@inproceedings{Vid13,
author = {Thomas Vidick},
title = {Three-player entangled {XOR} games are {NP}-hard to approximate},
booktitle = proc54 # focs,
year = {2013},
}
@inproceedings{IPS13,
author = {Russell Impagliazzo and Ramamohan Paturi and Stefan Schneider},
title = {A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits},
booktitle = proc54 # focs,
year = {2013},
}
@inproceedings{Dru13,
author = {Andrew Drucker},
title = {Nondeterministic Direct Product Reductions and the Success Probability of {SAT} Solvers},
booktitle = proc54 # focs,
year = {2013},
}
@inproceedings{KoRa13,
author = {Ilan Komargodski and Ran Raz},
title = {Average-Case Lower Bounds for Formula Size},
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{KRR13,
author = {Yael Tauman Kalai and Ran Raz and Ron Rothblum},
title = {Delegation for Bounded Space },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{KoRa13,
author = {Gillat Kol and Ran Raz},
title = {Interactive Channel Capacity },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{Wil13,
author = {Ryan Williams},
title = {Natural Proofs, Derandomization, and Lower Bounds},
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{RoVW13,
author = {Liam Roditty and Virginia Vassilevska Williams},
title = {Fast approximation algorithms for the diameter and radius of sparse graphs },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{CGW13,
author = {Jin-Yi Cai and Heng Guo and Tyson Williams},
title = {A Complete Dichotomy Rises from the Capture of Vanishing Signatures},
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{KiSa13,
author = {Valerie King and Jared Saia},
title = {Byzantine Agreement in Polynomial Expected Time},
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BGJ13,
author = {Stanislav Bohm and Stefan G{\"o}ller and Petr Jancar},
title = {Equivalence of Deterministic One-Counter Automata is {NL}-complete },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{Ajt13,
author = {Miklos Ajtai},
title = {Lower bounds for {RAM}s and quantifier elimination },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{Ta-Shma13,
author = {Amnon Ta-Shma},
title = {Inverting well-conditioned matrices in Quantum Logspace },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BaWi13,
author = {Laszlo Babai and John Wilmes},
title = {Quasipolynomial-time Canonical Form for {S}teiner Designs },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BuIk13,
author = {Peter B{\"u}rgisser and Christian Ikenmeyer},
title = {Explicit Lower Bounds via {G}eometric {C}omplexity {T}heory },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BNT13,
author = {Chris Beck and Jakob Nordstrom and Bangsheng Tang},
title = {Some Trade-off Results for {P}olynomial {C}alculus },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{CoPa13,
author = {Amin Coja-Oghlan and Konstantinos Panagiotou },
title = {Going After the k-{SAT} Threshold },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BCGT13,
author = {Eli Ben-Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer},
title = {On the Concrete Efficiency of Probabilistically Checkable Proofs },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{COW13,
author = {Ventsislav Chonev and Joel Ouaknine and James Worrell},
title = {The Orbit Problem in Higher Dimensions },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BrMo13,
author = {Mark Braverman and Ankur Moitra},
title = {An Information Complexity Approach to Extended Formulations },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{BeIm13,
author = {Chris Beck and Russell Impagliazzo},
title = {Strong {ETH} Holds For Regular Resolution },
booktitle = proc45 # stoc,
year = {2013},
}
@inproceedings{Hir15,
author = {Shuichi Hirahara},
title = {Identifying an honest {EXP}{$^NP$} oracle among many},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{KaSa15,
author = {Neeraj Kayal and Chandan Saha},
title = {Lower bounds for depth three arithmetic circuits with small bottom fanin},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{OSV15,
author = {Rafael Oliveira and Amir Shpilka and Ben Lee Volk},
title = {Subexponential size hitting sets for bounded depth multilinear formulas},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{MuWi15,
author = {Cody Murray and Ryan Williams},
title = {On the (non) {NP}-hardness of computing circuit complexity},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{BhLo15,
author = {Abhishek Bhowmick and Shachar Lovett},
title = {Nonclassical polynomials as a barrier to polynomial lower bounds},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{BaCh15,
author = {Suman Bera and Amit Chakrabarti},
title = {A depth-five lower bound for iterated matrix multiplication},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{OlSa15,
author = {Igor Oliveira and Rahul Santhanam},
title = {Majority is incompressible by {AC}{$^0$}[p] circuits},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{MiNo15,
author = {Mladen Miksa and Jakob Nordstrom},
title = {A generalized method for proving polynomial calculus degree lower bounds},
booktitle = proc30 # ccc,
year = {2015},
}
@inproceedings{Gro14,
author = {Joshua Grochow},
title = {Unifying known lower bounds via geometric complexity theory},
booktitle = proc29 # ccc,
year = {2014},
}
@inproceedings{GKKS13,
author = {Ankit Gupta and Pritish Kamath and Neeraj Kayal and Ramprasad Saptharishi},
title = {Approaching the chasm at depth four},
booktitle = proc28 # ccc,
year = {2013},
}
ITCS2015
@inproceedings{ChWi15,
author = {Brynmor Chapman and Ryan Williams},
title = {The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data},
booktitle = {Proceedings, 2015 Conference on Innovations in Theoretical Computer Science, Rehovot, Israel},
publisher = acm,
year = {2015},
pages = {263--270}
}
ITCS 2013
(IBM Research)
@inproceedings{RRV15,
author = {Swapnoneel Roy and Atri Rudra and Akshat Verma},
title = {An Energy Complexity Model for Algorithms},
booktitle = {Proceedings, 2013 Conference on Innovations in Theoretical Computer Science, Berkeley, California},
publisher = acm,
year = {2013},
pages = {283--304}
}
@inproceedings{BDH15,
author = {Andreas Bj{\"o}rklund and Holger Dell and Thore Husfeldt},
title = {The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems},
booktitle = proc42 # icalp,
series = lncs,
volume = {9134},
publisher = springer,
year = {2015},
}
@inproceedings{Cur15,
author = {Radu Curticapean},
title = {Block interpolation: A framework for tight exponential-time counting complexity},
booktitle = proc42 # icalp,
series = lncs,
volume = {9134},
publisher = springer,
year = {2015},
}
@inproceedings{CGW14b,
author = {Jin-Yi Cai and Heng Guo and Tyson Williams},
title = {Holographic Algorithms Beyond Matchgates},
booktitle = proc41 # icalp,
series = lncs,
volume = {8572},
publisher = springer,
year = {2014},
}
@article{CGW18,
author = {Jin-Yi Cai and Heng Guo and Tyson Williams},
title = {Clifford gates in the holant frameqwork},
journal = tcs,
year = {2018},
volume = {75},
pages = {163--171}
}
@inproceedings{BPVZ14,
author = {Andreas Bj{\"o}rklund and Rasmus Pagh and Virginia Vassilevska Williams and Uri Zwick},
title = {Listing Triangles},
booktitle = proc41 # icalp,
series = lncs,
volume = {8572},
publisher = springer,
year = {2014},
}
@inproceedings{AVW14,
author = {Amir Abboud and Virginia Vassilevska Williams and Oren Weimann},
title = {Consequences of Faster Alignment of Sequences},
booktitle = proc41 # icalp,
series = lncs,
volume = {8572},
publisher = springer,
year = {2014},
}
@inproceedings{AABB14,
author = {Scott Aaronson and Andris Ambainis and Kaspars Balodis and Mohammad Bavarian},
title = {Weak Parity},
booktitle = proc41 # icalp,
series = lncs,
volume = {8572},
publisher = springer,
year = {2014},
}
@inproceedings{DHLS14,
author = {Erik Demaine and Yamming Huang and Chung-Shou Liao and Kunihiko Sadakane},
title = {Canadians Should Travel Randomly},
booktitle = proc41 # icalp,
series = lncs,
volume = {8572},
publisher = springer,
year = {2014},
}
@inproceedings{KLPRRSS13,
author = {Eun Jung Kim and Alexander Langer and Christophe Paul and Felix Reidl and Peter Rossmanith and Ignasi Sau and Somnath Sikdar},
title = {Linear kernels and single-exponential algorithms via protrusion decompositions},
booktitle = proc40 # icalp,
series = lncs,
volume = {7965},
publisher = springer,
year = {2013},
}
@inproceedings{BCKN13,
author = {Hans Bodlaender and Marek Cygan and Stefan Kratsch and Jesper Nederlof},
title = {Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth},
booktitle = proc40 # icalp,
series = lncs,
volume = {7965},
publisher = springer,
year = {2013},
}
@inproceedings{CyPi13,
author = {Marek Cygan and Marcin Pilipczuk},
title = {Faster exponential-time algorithms in graphs of bounded average degree},
booktitle = proc40 # icalp,
series = lncs,
volume = {7965},
publisher = springer,
year = {2013},
}
@inproceedings{Bla13,
author = {Markus Blaeser},
title = {Noncommutativity makes determinants hard},
booktitle = proc40 # icalp,
series = lncs,
volume = {7965},
publisher = springer,
year = {2013},
}
@inproceedings{AlHo15,
author = {Eric Allender and Dhiraj Holden},
title = {The Minimum Oracle Circuit Size Problem},
booktitle = proc32 # stacs,
year = {2015},
}
@inproceedings{Nies14,
author = {Andre Nies},
title = {Differentiability of polynomial time computable functions},
booktitle = proc31 # stacs,
year = {2014},
}
@inproceedings{NgSe14,
author = {Dung Nguyen and Alan Selman},
title = {Non-autoreducible sets for {NEXP}},
booktitle = proc31 # stacs,
year = {2014},
}
@inproceedings{CaLu13,
author = {Adam Case and Jack Lutz},
title = {Mutual Dimension},
booktitle = proc30 # stacs,
year = {2013},
}
@inproceedings{AtOl13,
author = {Albert Atserias and Sergi Oliva},
title = {Bounded-width {QBF} is PSPACE-complete},
booktitle = proc30 # stacs,
year = {2013},
}
@inproceedings{HHM13,
author = {Edith Hemaspaandra and Lane Hemaspaandra and Curtis Menton},
title = {Search versus Decision for Election Manipulation Problems},
booktitle = proc30 # stacs,
year = {2013},
}
@article{Sho10,
author = {F. Shokrieh},
title = {The monodromy pairing and discrete logarithm on the Jacobian of finite graphs},
journal = {Journal of Mathematical Cryptology},
volume = {4},
number = {1},
year = {2010},
pages = {43--56}
}
@article{BaSh13,
author = {M. Baker and F. Shokrieh},
title = {Chip-firing games, potential theory on graphs, and spanning trees},
journal = {Journal of Combinatorial Theory, Series A},
volume = {120},
number = {1},
year = {2013},
pages = {164--182}
}
@inproceedings{Wil04,
author = {R. Williams},
title = {A new algorithm for optimal constraint satisfaction and its implications},
booktitle = proc31 # icalp,
publisher = springer,
series = lncs,
volume = {3142},
year = {2004},
pages = {1227--1237}
}
@inproceedings{DGW92,
author = {A. Dhagat and P. G{\'a}cs and P. Winkler},
title = {On playing `{T}wenty {Q}uestions' with a liar},
booktitle = {Proceedings of the 3rd ACM Symposium on Discrete Algorithms},
year = {1992},
pages = {16--22}
}
@techreport{DGW04,
author = {A. Dhagat and P. G{\'a}cs and P. Winkler},
title = {On playing `{T}wenty {Q}uestions' with a liar},
instutiton = {Boston University},
number = {BUCS Tech Report 91-006},
month = {November},
day = {24},
year = {2004}
}
@book{Cra95,
title={Topics in Advanced Scientific Computation},
author={R. Crandall},
year={1995},
publisher={Springer-Verlag},
address = {New York}
}
@article{Dil00,
title={Nested squares and evaluations of integer products},
author={K. Dilcher},
journal={Experimental Mathematics},
volume={9},
number={3},
pages={369--372},
year={2000}
}
@book{CP06,
title={Prime Numbers: a Computational Perspective},
author={R. Crandall and C. Pomerance},
volume={182},
year={2006},
series={Springer Science \& Business Media},
publisher = {Springer-Verlag}
}
@article{Bre08,
title = {When can {$(((X^2-P)^2-Q)^2-R)^2-S^2$} split into linear factors?},
author = "A. Bremner",
journal = "Experiment. Math.",
number = "4",
pages = "385--390",
volume = "17",
year = "2008"
}
@article{BMR13,
title={Few Product Gates but Many Zeroes},
author={B. Borchert and P. McKenzie and K. Reinhardt},
journal={Chicago Journal of Theoretical Computer Science},
volume={2013},
pages={2},
year={2013}
}
@article{ShSm95,
author={M. Shub and S. Smale},
title={On the intractability of {H}ilbert's {N}ullstellensatz and an algebraic version of ``{NP= P}?''},
journal = {Duke Math. J.},
volume = {81},
year={1995},
pages = {47--54}
}
@book{BCSS12,
title={Complexity and Real Computation},
author={L. Blum and F. Cucker and M. Shub and S. Smale},
year={2012},
series={Springer Science \& Business Media},
publisher = {Springer-Verlag}
}
@article{ADF95iv,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {IV}: On completeness for {W[P]} and {PSPACE} analogs},
journal = {Annals of Pure and Applied Logic},
volume = {73},
year = {1995},
pages = {235--276}
}
@article{ChGr07,
author = {Y. Chen and M. Grohe},
title = {An isomorphism between subexponential and parameterized complexity},
journal = sicomp,
volume = {37},
year = {2007},
pages = {1228--1258}
}
@article{KLV03,
author = {G. Karakostas and R. Lipton and A. Viglas},
title = {On the complexity of intersecting finite state automata and {NL} versus {NP}},
journal = tcs,
volume = {302},
year = {2003},
pages = {257--274}
}
@inproceedings{SwWe15,
author = {J. Swernofsky and M. Wehar},
title = {On the Complexity of Intersecting Regular, Context-Free, and Tree Languages},
booktitle = proc42 # icalp,
series = lncs,
volume = {9134},
publisher = springer,
year = {2015},
pages = {414--426}
}
@inproceedings{Weh14,
author = {M. Wehar},
title = {Hardness Results for Intersection Non-Emptiness},
booktitle = proc41 # icalp,
series = lncs,
volume = {8572},
publisher = springer,
year = {2014},
pages = {354--362},
note = {Best student paper award, Track B}
}
@inproceedings{LeGall14,
author = {F. Le Gall},
title = {Powers of tensors and fast matrix multiplication},
booktitle = {Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014)},
year = {2014}
}
@inproceedings{AFPS07,
author = {L. Antunes and L. Fortnow and A. Pinto and A. Souto},
title = {Low-depth witnesses are easy to find},
booktitle = proc22 # ccc,
year = {2007},
pages = {46--51}
}
@inproceedings{AFvM01,
author = {L. Antunes and L. Fortnow and D. van Melkebeek},
title = {Computational depth},
booktitle = proc16 # ccc,
year = {2001},
pages = {266--273}
}
@misc{GLR16,
author = {C. Guan and R. Lipton and K. Regan},
title = {Status of an Attack on Factoring Via Polynomials},
year = {2016}
}
@article{AlphaGo16,
author = {David Silver and others},
title = {Mastering the game of {G}o with deep neural networks and tree search},
journal = {Nature},
volume = {529},
year = {2016},
pages = {484--489}
}
@article{ZaMa13,
author = {Victor Zakharov and Vladimir Makhnychev},
title = {Creating tables of chess 7-piece endgames on the {L}omonosov supercomputer},
journal = {Superkomp’yutery},
volume = {15},
year = {2013}
}
@article{ZMS16,
author = {Victor Zakharov and Mikhail Malkovsky and Vladislav Shchukin},
title = {Compression of underdetermined data in a 7-piece chess table},
journal = {Moscow University Computational Mathematics and Cybernetics},
volume = {40},
number = {1},
year = {2016}
}
@article{SBBKMLLS07,
author = {J. Schaeffer and N. Burch and Y. Bj{\"o}rnsson and A. Kishimoto and M. M{\"u}ller and R. Lake and P. Lu and S. Sutphen},
title = {Checkers is solved},
journal = {Science},
volume = {317},
number = {5844},
year = {2007},
pages = {1518--1522}
}
@misc{WyHw12,
author = {D. Wybiral and J. Hwang},
title = {Quantum Circuit Simulator},
year = {2012},
howpublished = {http://www.davyw.com/quantum/}
}