default search action
Search dblp for Publications
export results for "toc:db/journals/cc/cc6.bht:"
@article{DBLP:journals/cc/BarnesR97, author = {Greg Barnes and Walter L. Ruzzo}, title = {Undirected s-t Connectivity in Polynomial Time and Sublinear Space}, journal = {Comput. Complex.}, volume = {6}, number = {1}, pages = {1--28}, year = {1997}, url = {https://doi.org/10.1007/BF01202039}, doi = {10.1007/BF01202039}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BarnesR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BeigelM97, author = {Richard Beigel and Alexis Maciel}, title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {235--255}, year = {1997}, url = {https://doi.org/10.1007/BF01294257}, doi = {10.1007/BF01294257}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BeigelM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BeimelGP97, author = {Amos Beimel and Anna G{\'{a}}l and Mike Paterson}, title = {Lower Bounds for Monotone Span Programs}, journal = {Comput. Complex.}, volume = {6}, number = {1}, pages = {29--45}, year = {1997}, url = {https://doi.org/10.1007/BF01202040}, doi = {10.1007/BF01202040}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BeimelGP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Borodin97, author = {Allan Borodin}, title = {Tribute to Roman Smolensky}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {195--198}, year = {1997}, url = {https://doi.org/10.1007/BF01294252}, doi = {10.1007/BF01294252}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Borodin97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Bruck97, author = {Jehoshua Bruck}, title = {Reflections on "Representations of Sets of Boolean Functions by Commutative Rings" by Roman Smolensky}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {209--212}, year = {1997}, url = {https://doi.org/10.1007/BF01294254}, doi = {10.1007/BF01294254}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Bruck97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Bshouty97, author = {Nader H. Bshouty}, title = {Simple Learning Algorithms Using Divide and Conquer}, journal = {Comput. Complex.}, volume = {6}, number = {2}, pages = {174--194}, year = {1997}, url = {https://doi.org/10.1007/BF01262930}, doi = {10.1007/BF01262930}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Bshouty97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BussIPRS97, author = {Samuel R. Buss and Russell Impagliazzo and Jan Kraj{\'{\i}}cek and Pavel Pudl{\'{a}}k and Alexander A. Razborov and Jir{\'{\i}} Sgall}, title = {Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {256--298}, year = {1997}, url = {https://doi.org/10.1007/BF01294258}, doi = {10.1007/BF01294258}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/BussIPRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/ChandraRRST97, author = {Ashok K. Chandra and Prabhakar Raghavan and Walter L. Ruzzo and Roman Smolensky and Prasoon Tiwari}, title = {The Electrical Resistance of a Graph Captures its Commute and Cover Times}, journal = {Comput. Complex.}, volume = {6}, number = {4}, pages = {312--340}, year = {1997}, url = {https://doi.org/10.1007/BF01270385}, doi = {10.1007/BF01270385}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/ChandraRRST97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Feige97, author = {Uriel Feige}, title = {Collecting Coupons on Trees, and the Cover Time of Random Walks}, journal = {Comput. Complex.}, volume = {6}, number = {4}, pages = {341--356}, year = {1997}, url = {https://doi.org/10.1007/BF01270386}, doi = {10.1007/BF01270386}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Feige97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/FeigeL97, author = {Uriel Feige and Carsten Lund}, title = {On the Hardness of Computing the Permanent of Random Matrices}, journal = {Comput. Complex.}, volume = {6}, number = {2}, pages = {101--132}, year = {1997}, url = {https://doi.org/10.1007/BF01262928}, doi = {10.1007/BF01262928}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/FeigeL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GathenKS97, author = {Joachim von zur Gathen and Marek Karpinski and Igor E. Shparlinski}, title = {Counting Curves and Their Projections}, journal = {Comput. Complex.}, volume = {6}, number = {1}, pages = {64--99}, year = {1997}, url = {https://doi.org/10.1007/BF01202042}, doi = {10.1007/BF01202042}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GathenKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GrigorievKHS97, author = {Dima Grigoriev and Marek Karpinski and Friedhelm Meyer auf der Heide and Roman Smolensky}, title = {A Lower Bound for Randomized Algebraic Decision Trees}, journal = {Comput. Complex.}, volume = {6}, number = {4}, pages = {357--375}, year = {1997}, url = {https://doi.org/10.1007/BF01270387}, doi = {10.1007/BF01270387}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GrigorievKHS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GrigorievKS97, author = {Dima Grigoriev and Marek Karpinski and Roman Smolensky}, title = {Randomization and the Computational Power of Analytic and Algebraic Decision Trees}, journal = {Comput. Complex.}, volume = {6}, number = {4}, pages = {376--388}, year = {1997}, url = {https://doi.org/10.1007/BF01270388}, doi = {10.1007/BF01270388}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GrigorievKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GuptaM97, author = {Arvind Gupta and Sanjeev Mahajan}, title = {Using Amplification to Compute Majority with Small Majority Gates}, journal = {Comput. Complex.}, volume = {6}, number = {1}, pages = {46--63}, year = {1997}, url = {https://doi.org/10.1007/BF01202041}, doi = {10.1007/BF01202041}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GuptaM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/NisanW97, author = {Noam Nisan and Avi Wigderson}, title = {Lower Bounds on Arithmetic Circuits Via Partial Derivatives}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {217--234}, year = {1997}, url = {https://doi.org/10.1007/BF01294256}, doi = {10.1007/BF01294256}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/NisanW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/ReischukS97, author = {R{\"{u}}diger Reischuk and Christian Schindelhauer}, title = {An Average Complexity Measure that Yields Tight Hierarchies}, journal = {Comput. Complex.}, volume = {6}, number = {2}, pages = {133--173}, year = {1997}, url = {https://doi.org/10.1007/BF01262929}, doi = {10.1007/BF01262929}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/ReischukS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/ShoupS97, author = {Victor Shoup and Roman Smolensky}, title = {Lower Bounds for Polynomial Evaluation and Interpolation Problems}, journal = {Comput. Complex.}, volume = {6}, number = {4}, pages = {301--311}, year = {1997}, url = {https://doi.org/10.1007/BF01270384}, doi = {10.1007/BF01270384}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/ShoupS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Smolensky97, author = {Roman Smolensky}, title = {Representations of Sets of Boolean Functions by Commutative Rings}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {199--208}, year = {1997}, url = {https://doi.org/10.1007/BF01294253}, doi = {10.1007/BF01294253}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Smolensky97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Smolensky97a, author = {Roman Smolensky}, title = {Easy Lower Bound for a Strange Computational Model}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {213--216}, year = {1997}, url = {https://doi.org/10.1007/BF01294255}, doi = {10.1007/BF01294255}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Smolensky97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Smolensky97b, author = {Roman Smolensky}, title = {Well-Known Bound for the VC-Dimension Made Easy}, journal = {Comput. Complex.}, volume = {6}, number = {4}, pages = {299--300}, year = {1997}, url = {https://doi.org/10.1007/BF01270383}, doi = {10.1007/BF01270383}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Smolensky97b.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.