Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/cc/AllenderBO99,
  author       = {Eric Allender and
                  Robert Beals and
                  Mitsunori Ogihara},
  title        = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {2},
  pages        = {99--126},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050023},
  doi          = {10.1007/S000370050023},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/AllenderBO99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BarringtonS99,
  author       = {David A. Mix Barrington and
                  Howard Straubing},
  title        = {Lower bounds for modular counting by circuits with modular gates},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {3},
  pages        = {258--272},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050030},
  doi          = {10.1007/S000370050030},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BarringtonS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BaurH99,
  author       = {Walter Baur and
                  Karin Halupczok},
  title        = {On lower bounds for the complexity of polynomials and their multiples},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {4},
  pages        = {309--315},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050001},
  doi          = {10.1007/S000370050001},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BaurH99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BergU99,
  author       = {Christer Berg and
                  Staffan Ulfberg},
  title        = {Symmetric Approximation Arguments for Monotone Lower Bounds Without
                  Sunflowers},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {1},
  pages        = {1--20},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050017},
  doi          = {10.1007/S000370050017},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BergU99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Blaser99,
  author       = {Markus Bl{\"{a}}ser},
  title        = {Lower bounds for the multiplicative complexity of matrix multiplication},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {3},
  pages        = {203--226},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050028},
  doi          = {10.1007/S000370050028},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Blaser99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BlundoSPV99,
  author       = {Carlo Blundo and
                  Alfredo De Santis and
                  Giuseppe Persiano and
                  Ugo Vaccaro},
  title        = {Randomness Complexity of Private Computation},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {2},
  pages        = {145--168},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050025},
  doi          = {10.1007/S000370050025},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/BlundoSPV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/DietzfelbingerH99,
  author       = {Martin Dietzfelbinger and
                  Martin H{\"{u}}hne},
  title        = {Matching upper and lower bounds for simulations of several linear
                  tapes on one multidimensional tape},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {4},
  pages        = {371--392},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050006},
  doi          = {10.1007/S000370050006},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/DietzfelbingerH99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GoldreichP99,
  author       = {Oded Goldreich and
                  Erez Petrank},
  title        = {Quantifying Knowledge Complexity},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {1},
  pages        = {50--98},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050019},
  doi          = {10.1007/S000370050019},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GoldreichP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Grigoriev99,
  author       = {Dima Grigoriev},
  title        = {Complexity lower bounds for randomized computation trees over zero
                  characteristic fields},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {4},
  pages        = {316--329},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050002},
  doi          = {10.1007/S000370050002},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Grigoriev99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/HuangW99,
  author       = {Ming{-}Deh A. Huang and
                  Yiu{-}Chung Wong},
  title        = {Solvability of systems of polynomial congruences modulo a large prime},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {3},
  pages        = {227--257},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050029},
  doi          = {10.1007/S000370050029},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/HuangW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/ImpagliazzoPS99,
  author       = {Russell Impagliazzo and
                  Pavel Pudl{\'{a}}k and
                  Jir{\'{\i}} Sgall},
  title        = {Lower Bounds for the Polynomial Calculus and the Gr{\"{o}}bner
                  Basis Algorithm},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {2},
  pages        = {127--144},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050024},
  doi          = {10.1007/S000370050024},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/ImpagliazzoPS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Ishihara99,
  author       = {Hajime Ishihara},
  title        = {Function algebraic characterizations of the polytime functions},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {4},
  pages        = {346--356},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050004},
  doi          = {10.1007/S000370050004},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Ishihara99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/IvanovR99,
  author       = {Sergei Ivanov and
                  Michel de Rougemont},
  title        = {Interactive protocols over the reals},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {4},
  pages        = {330--345},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050003},
  doi          = {10.1007/S000370050003},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/IvanovR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/JuknaRSW99,
  author       = {Stasys Jukna and
                  Alexander A. Razborov and
                  Petr Savick{\'{y}} and
                  Ingo Wegener},
  title        = {On {P} versus {NP} cap co-NP for decision trees and read-once branching
                  programs},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {4},
  pages        = {357--370},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050005},
  doi          = {10.1007/S000370050005},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/JuknaRSW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Kapron99,
  author       = {Bruce M. Kapron},
  title        = {Feasibly Continuous Type-Two Functionals},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {2},
  pages        = {188--201},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050027},
  doi          = {10.1007/S000370050027},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Kapron99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/KremerNR99,
  author       = {Ilan Kremer and
                  Noam Nisan and
                  Dana Ron},
  title        = {On Randomized One-Round Communication Complexity},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {1},
  pages        = {21--49},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050018},
  doi          = {10.1007/S000370050018},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/KremerNR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/LiskiewiczR99,
  author       = {Maciej Liskiewicz and
                  R{\"{u}}diger Reischuk},
  title        = {On small space complexity classes of stochastic Turing machines and
                  Arthur-Merlin-games},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {3},
  pages        = {273--307},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050031},
  doi          = {10.1007/S000370050031},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/LiskiewiczR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/NaikS99,
  author       = {Ashish V. Naik and
                  Alan L. Selman},
  title        = {Adaptive Versus Nonadaptive Queries to {NP} and p-Selective Sets},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {2},
  pages        = {169--187},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050026},
  doi          = {10.1007/S000370050026},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/NaikS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.