Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/cc/BarringtonBR94,
  author       = {David A. Mix Barrington and
                  Richard Beigel and
                  Steven Rudich},
  title        = {Representing Boolean Functions as Polynomials Modulo Composite Numbers},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {367--382},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263424},
  doi          = {10.1007/BF01263424},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BarringtonBR94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BarringtonS94,
  author       = {David A. Mix Barrington and
                  Howard Straubing},
  title        = {Complex Polynomials and Circuit Lower Bounds for Modular Counting},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {325--338},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263421},
  doi          = {10.1007/BF01263421},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BarringtonS94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Beigel94,
  author       = {Richard Beigel},
  title        = {When do Extra Majority Gates Help? Polylog(\emph{N}) Majority Gates
                  Are Equivalent to One},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {314--324},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263420},
  doi          = {10.1007/BF01263420},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Beigel94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Beigel94a,
  author       = {Richard Beigel},
  title        = {Perceptrons, PP, and the Polynomial Hierarchy},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {339--349},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263422},
  doi          = {10.1007/BF01263422},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Beigel94a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BeigelT94,
  author       = {Richard Beigel and
                  Jun Tarui},
  title        = {On {ACC}},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {350--366},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263423},
  doi          = {10.1007/BF01263423},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BeigelT94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Bloch94,
  author       = {Stephen A. Bloch},
  title        = {Function-Algebraic Characterizations of Log and Polylog Parallel Time},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {175--205},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01202288},
  doi          = {10.1007/BF01202288},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Bloch94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BshoutyHHK94,
  author       = {Nader H. Bshouty and
                  Thomas R. Hancock and
                  Lisa Hellerstein and
                  Marek Karpinski},
  title        = {An Algorithm to Learn Read-Once Threshold Formulas, and Transformations
                  Between Learning Models},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {37--61},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01205054},
  doi          = {10.1007/BF01205054},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BshoutyHHK94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Condon94,
  author       = {Anne Condon},
  title        = {A Theory of Strict P-Completeness},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {220--241},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01206637},
  doi          = {10.1007/BF01206637},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Condon94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/FeigenbaumFLS94,
  author       = {Joan Feigenbaum and
                  Lance Fortnow and
                  Carsten Lund and
                  Daniel A. Spielman},
  title        = {The Power of Adaptiveness and Additional Queries in Random-Self-Reductions},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {158--174},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01202287},
  doi          = {10.1007/BF01202287},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/FeigenbaumFLS94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/FriezeT94,
  author       = {Alan M. Frieze and
                  Shang{-}Hua Teng},
  title        = {On the Complexity of Computing the Diameter of a Polytope},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {207--219},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01206636},
  doi          = {10.1007/BF01206636},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/FriezeT94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Grandjean94,
  author       = {Etienne Grandjean},
  title        = {Invariance Properties of Rams and Linear Time},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {62--106},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01205055},
  doi          = {10.1007/BF01205055},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Grandjean94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/HemaspaandraOT94,
  author       = {Lane A. Hemaspaandra and
                  Mitsunori Ogihara and
                  Seinosuke Toda},
  title        = {Space-Efficient Recognition of Sparse Self-Reducible Languages},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {262--296},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01206639},
  doi          = {10.1007/BF01206639},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/HemaspaandraOT94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/McKenzieT94,
  author       = {Pierre McKenzie and
                  Denis Th{\'{e}}rien},
  title        = {Special Issue on Circuit Complexity: Foreword},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {297--300},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263418},
  doi          = {10.1007/BF01263418},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/McKenzieT94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/MontanaPR94,
  author       = {Jos{\'{e}} Luis Monta{\~{n}}a and
                  Luis Miguel Pardo and
                  Tom{\'{a}}s Recio},
  title        = {A Note on Rabin's Width of a Complete Proof},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {12--36},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01205053},
  doi          = {10.1007/BF01205053},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/MontanaPR94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Nisan94,
  author       = {Noam Nisan},
  title        = {{RL} {\textless}= {SC}},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {1--11},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01205052},
  doi          = {10.1007/BF01205052},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Nisan94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/NisanS94,
  author       = {Noam Nisan and
                  Mario Szegedy},
  title        = {On the Degree of Boolean Functions as Real Polynomials},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {301--313},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263419},
  doi          = {10.1007/BF01263419},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/NisanS94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Patrank94,
  author       = {Erez Petrank},
  title        = {The Hardness of Approximation: Gap Location},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {133--157},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01202286},
  doi          = {10.1007/BF01202286},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Patrank94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/RoyV94,
  author       = {Marie{-}Fran{\c{c}}oise Roy and
                  Nicolai N. Vorobjov Jr.},
  title        = {Finding Irreducible Components of Some Real Transcendental Varieties},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {107--132},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01202285},
  doi          = {10.1007/BF01202285},
  timestamp    = {Mon, 22 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/RoyV94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Therien94,
  author       = {Denis Th{\'{e}}rien},
  title        = {Circuits Constructed with Mod{\_}q Gates Cannot Compute "And" in Sublinear
                  Size},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {383--388},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01263425},
  doi          = {10.1007/BF01263425},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Therien94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/ThieraufTW94,
  author       = {Thomas Thierauf and
                  Seinosuke Toda and
                  Osamu Watanabe},
  title        = {On Closure Properties of GapP},
  journal      = {Comput. Complex.},
  volume       = {4},
  pages        = {242--261},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01206638},
  doi          = {10.1007/BF01206638},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/ThieraufTW94.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.