Conferences in DBLP
D. Sivakumar On Membership Comparable Sets. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:2-7 [Conf ] Harry Buhrman , Lance Fortnow , Thomas Thierauf Nonrelativizing Separations. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:8-12 [Conf ] Harry Buhrman , Lance Fortnow Two Queries. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:13-0 [Conf ] Oded Goldreich , Madhu Sudan Computational Indistinguishability: A Sample Hierarchy. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:24-33 [Conf ] Giovanni Di Crescenzo , Russell Impagliazzo Proofs of Membership vs. Proofs of Knowledge. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:34-45 [Conf ] Jin-yi Cai , Ajay Nerurkar Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:46-0 [Conf ] Ran Raz , Gábor Tardos , Oleg Verbitsky , Nikolai K. Vereshchagin Arthur-Merlin Games in Boolean Decision Trees. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:58-67 [Conf ] Amos Beimel , Anna Gál On Arithmetic Branching Programs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:68-80 [Conf ] Manindra Agrawal , Thomas Thierauf The Satisfiability Problem for Probabilistic Ordered Branching Programs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:81-0 [Conf ] Eric Allender , Klaus Reinhardt Isolation, Matching, and Counting. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:92-100 [Conf ] Birgit Jenner , Pierre McKenzie , Jacobo Torán A Note on the Hardness of Tree Isomorphism. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:101-105 [Conf ] Madhav V. Marathe , Harry B. Hunt III , Daniel J. Rosenkrantz , Richard Edwin Stearns Theory of Periodically Specified Problems: Complexity and Approximability. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:106-0 [Conf ] Daniel A. Spielman Models of Computation in Coding Theory. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:120-0 [Conf ] Helmut Veith How to Encode a Logical Structure by an OBDD. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:122-131 [Conf ] Johannes Köbler , Jochen Messner Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:132-140 [Conf ] Hartmut Klauck Lower Bounds for Computation with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:141-0 [Conf ] Richard Beigel , Bin Fu Solving Intractable Problems with DNA Computing. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:154-0 [Conf ] Harry Buhrman , Dieter van Melkebeek Hard Sets are Hard to Find. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:170-181 [Conf ] Johannes Köbler , Wolfgang Lindner On the Resource Bounded Measure of P/poly. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:182-185 [Conf ] Kenneth W. Regan , D. Sivakumar Probabilistic Martingales and BPTIME Classes. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:186-0 [Conf ] Lance Fortnow , John D. Rogers Complexity Limitations on Quantum Computation. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:202-209 [Conf ] John Watrous Relationships Between Quantum and Classical Space-Bounded Complexity Classes. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:210-227 [Conf ] Rodney G. Downey , Lance Fortnow Uniformly Hard Languages. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:228-0 [Conf ] Jack H. Lutz Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:236-248 [Conf ] Harry Buhrman , Leen Torenvliet Randomness is Hard. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:249-260 [Conf ] Wolfgang Lindner , Rainer Schuler , Osamu Watanabe Resource Bounded Measure and Learnability. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:261-0 [Conf ] Judy Goldsmith , Martin Mundhenk Complexity Issues in Markov Decision Processes. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1998, pp:272-280 [Conf ]