Search dblp for Publications

export results for "toc:db/journals/cc/cc2.bht:"

 download as .bib file

@article{DBLP:journals/cc/AurenhammerHI92,
  author       = {Franz Aurenhammer and
                  Johann Hagauer and
                  Wilfried Imrich},
  title        = {Cartesian Graph Factorization at Logarithmic Cost per Edge},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {331--349},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01200428},
  doi          = {10.1007/BF01200428},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/AurenhammerHI92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BabaiFL92,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Lance Fortnow and
                  Carsten Lund},
  title        = {Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive
                  Protocols},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {374},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01200430},
  doi          = {10.1007/BF01200430},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/BabaiFL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BeigelF92,
  author       = {Richard Beigel and
                  Joan Feigenbaum},
  title        = {On Being Incoherent Without Being Very Hard},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {1--17},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01276436},
  doi          = {10.1007/BF01276436},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BeigelF92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BellantoniC92,
  author       = {Stephen J. Bellantoni and
                  Stephen A. Cook},
  title        = {A New Recursion-Theoretic Characterization of the Polytime Functions},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {97--110},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01201998},
  doi          = {10.1007/BF01201998},
  timestamp    = {Thu, 09 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/BellantoniC92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BerkmanMV92,
  author       = {Omer Berkman and
                  Yossi Matias and
                  Uzi Vishkin},
  title        = {Randomized Range-Maxima in Nearly-Constant Parallel Time},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {350--373},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01200429},
  doi          = {10.1007/BF01200429},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BerkmanMV92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BshoutyMST92,
  author       = {Nader H. Bshouty and
                  Yishay Mansour and
                  Baruch Schieber and
                  Prasoon Tiwari},
  title        = {Fast Exponentiation Using the Truncation Operation},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {244--255},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01272076},
  doi          = {10.1007/BF01272076},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BshoutyMST92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/CosterJLOSS92,
  author       = {Matthijs J. Coster and
                  Antoine Joux and
                  Brian A. LaMacchia and
                  Andrew M. Odlyzko and
                  Claus{-}Peter Schnorr and
                  Jacques Stern},
  title        = {Improved Low-Density Subset Sum Algorithms},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {111--128},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01201999},
  doi          = {10.1007/BF01201999},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/CosterJLOSS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GathenS92,
  author       = {Joachim von zur Gathen and
                  Victor Shoup},
  title        = {Computing Frobenius Maps and Factoring Polynomials},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {187--224},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01272074},
  doi          = {10.1007/BF01272074},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GathenS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GoldmannHR92,
  author       = {Mikael Goldmann and
                  Johan H{\aa}stad and
                  Alexander A. Razborov},
  title        = {Majority Gates {VS.} General Weighted Threshold Gates},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {277--300},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01200426},
  doi          = {10.1007/BF01200426},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GoldmannHR92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GoldsmithHK92,
  author       = {Judy Goldsmith and
                  Lane A. Hemachandra and
                  Kenneth Kunen},
  title        = {Polynomial-Time Compression},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {18--39},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01276437},
  doi          = {10.1007/BF01276437},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GoldsmithHK92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GrigoryevV92,
  author       = {D. Yu. Grigoryev and
                  Nicolai N. Vorobjov Jr.},
  title        = {Counting Connected Components of a Semialgebraic Set in Subexponential
                  Time},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {133--186},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01202001},
  doi          = {10.1007/BF01202001},
  timestamp    = {Mon, 22 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GrigoryevV92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GuimaraesGP92,
  author       = {Katia S. Guimar{\~{a}}es and
                  William I. Gasarch and
                  James M. Purtilo},
  title        = {Selection Problems via M-Ary Queries},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {256--276},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01272077},
  doi          = {10.1007/BF01272077},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GuimaraesGP92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/KoblerST92,
  author       = {Johannes K{\"{o}}bler and
                  Uwe Sch{\"{o}}ning and
                  Jacobo Tor{\'{a}}n},
  title        = {Graph Isomorphism is Low for {PP}},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {301--330},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01200427},
  doi          = {10.1007/BF01200427},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/KoblerST92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Lynch92,
  author       = {James F. Lynch},
  title        = {The Quantifier Structure of Sentences That Characterize Nondeterministic
                  Time Complexity},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {40--66},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01276438},
  doi          = {10.1007/BF01276438},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Lynch92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Ronyai92,
  author       = {Lajos R{\'{o}}nyai},
  title        = {Algorithmic Properties of Maximal Orders in Simple Algebras over {Q}},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {225--243},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01272075},
  doi          = {10.1007/BF01272075},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Ronyai92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Shokrollahi92,
  author       = {Mohammad Amin Shokrollahi},
  title        = {Efficient Randomized Generation of Optimal Algorithms for Multiplication
                  in Certain Finite Fields},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {67--96},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01276439},
  doi          = {10.1007/BF01276439},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Shokrollahi92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Shparlinski92,
  author       = {Igor E. Shparlinski},
  title        = {A Deterministic Test for Permutation Polynomials},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {129--132},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01202000},
  doi          = {10.1007/BF01202000},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Shparlinski92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.