The Computational Complexity of Equivalence and Isomorphism Problems
暂无分享,去创建一个
[1] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[2] George Pólya,et al. Sur les types des propositions composées , 1940, Journal of Symbolic Logic.
[3] E. Berlekamp. Factoring polynomials over large finite fields* , 1971, SYMSAC '71.
[4] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[5] Christopher Umans. The minimum equivalent DNF problem and shortest implicants , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Ingo Wegener,et al. On the complexity of branching programs and decision trees for clique functions , 1988, JACM.
[7] Alberto L. Sangiovanni-Vincentelli,et al. Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions , 1996, Proceedings of International Conference on Computer Aided Design.
[8] Christoph M. Hoffmann,et al. Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.
[9] Marek Karpinski,et al. On the Power of Randomized Branching Programs , 1996, ICALP.
[10] Michael A. Harrison,et al. COUNTING THEOREMS AND THEIR APPLICATIONS TO CLASSIFICATION OF SWITCHING FUNCTIONS , 1971 .
[11] Marek Karpinski,et al. A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs , 1998, Electron. Colloquium Comput. Complex..
[12] Harry Buhrman,et al. The Complexity of Generating and Checking Proffs of Membership , 1996, STACS.
[13] Christoph Meinel,et al. Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams , 1996, Formal Methods Syst. Des..
[14] Oded Goldreich,et al. Another proof that bpp?ph (and more) , 1997 .
[15] Christoph Meinel,et al. Modified Branching Programs and Their Computational Power , 1989, Lecture Notes in Computer Science.
[16] Endre Szemerédi,et al. A Lower Bound for Read-Once-Only Branching Programs , 1987, J. Comput. Syst. Sci..
[17] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[18] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[19] C. Y. Lee. Representation of switching circuits by binary-decision programs , 1959 .
[20] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .
[21] Steven Lindell. A Logspace Algorithm for Tree Canonization , 1992 .
[22] Zhi-Zhong Chen,et al. Reducing randomness via irrational numbers , 1997, STOC '97.
[23] Ingo Wegener. Efficient data structures for Boolean functions , 1994, Discret. Math..
[24] Martin Sauerhoff,et al. Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract) , 1998, STACS.
[25] Michael Sipser,et al. The history and status of the P versus NP question , 1992, STOC '92.
[26] William Joseph Masek,et al. A fast algorithm for the string editing problem and decision graph complexity , 1976 .
[27] Jan Behrens,et al. Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering , 1998, STACS.
[28] Uwe Schöning. Complexity and Structure , 1986, Lecture Notes in Computer Science.
[29] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[30] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[31] Uwe Schöning. Probabilistic Complexity Classes and Lowness , 1989, J. Comput. Syst. Sci..
[32] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[33] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[34] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[35] Stanislav Zák,et al. An Exponential Lower Bound for One-Time-Only Branching Programs , 1984, MFCS.
[36] Randal E. Bryant,et al. On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.
[37] Beate Bollig,et al. Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams , 1997, Theory of Computing Systems.
[38] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[39] Stephan Waack. On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams , 1997, STACS.
[40] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[41] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[42] Ingo Wegener,et al. Parity OBDDs Cannot be Handled Efficiently Enough , 1998, Inf. Process. Lett..
[43] Beate Bollig,et al. Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.
[44] Richard Chang,et al. On Unique Satisfiability and the Threshold Behavior of Randomized Reductions , 1995, J. Comput. Syst. Sci..
[45] Janos Simon,et al. A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications , 1992, Advances In Computational Complexity Theory.
[46] C. Meinel,et al. Case Study: Manipulating -obdds by Means of Signatures , 1997 .
[47] Thomas Thierauf. The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits , 1998, Chic. J. Theor. Comput. Sci..
[48] Edith Hemaspaandra,et al. The minimization problem for Boolean formulas , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[49] Larry J. Stockmeyer,et al. On Approximation Algorithms for #P , 1985, SIAM J. Comput..
[50] Petr Savický. A probabilistic nonequivalence test for syntactic (1,+k)-branching programs , 1998, Electron. Colloquium Comput. Complex..
[51] Oscar H. Ibarra,et al. Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs , 1983, JACM.
[52] Rusins Freivalds,et al. Probabilistic Machines Can Use Less Running Time , 1977, IFIP Congress.
[53] J. Köbler,et al. The Graph Isomorphism Problem: Its Structural Complexity , 1993 .
[54] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[55] Leonard M. Adleman,et al. NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..
[56] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.
[57] Meinel,et al. Separating the eraser Turing machine classes , 2001 .
[58] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[59] Uwe Schöning. Perlen der theoretischen Informatik , 1995 .
[60] Christoph Meinel,et al. On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams , 1994, MFCS.
[61] Christoph Meinel,et al. Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.
[62] Sampath Kannan,et al. Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..
[63] Manuel Blum,et al. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..
[64] Uwe Schöning. Graph Isomorphism is in the Low Hierarchy , 1988, J. Comput. Syst. Sci..
[65] Mihir Bellare,et al. Uniform Generation of NP-Witnesses Using an NP-Oracle , 2000, Inf. Comput..
[66] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[67] Stephen Ponzio,et al. Restricted branching programs and hardware verification , 1995 .
[68] Desh Ranjan,et al. On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions , 1998, Theory of Computing Systems.
[69] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[70] Farid M. Ablayev. Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs , 1997, ICALP.
[71] V. Rich. Personal communication , 1989, Nature.
[72] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[73] Erik Meineche Schmidt,et al. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes , 1978, ICALP.
[74] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[75] Matthias Krause. Lower Bounds for Depth-Restricted Branching Programs , 1991, Inf. Comput..
[76] Christos H. Papadimitriou,et al. Two remarks on the power of counting , 1983, Theoretical Computer Science.
[77] Clemens Lautemann,et al. BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..
[78] Ingo Wegener,et al. Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..
[79] Ingo Wegener,et al. Efficient algorithms for the transformation between different types of binary decision diagrams , 1997, Acta Informatica.
[80] Detlef Sieling. A separation of syntactic and nonsyntactic (1,+k)-branching programs , 2000, computational complexity.
[81] Ronald V. Book. What is Structural Complexity Theory , 1989 .
[82] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[83] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[84] Peter Clote. Boolean functions, invariance groups and parallel complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[85] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[86] Samuel R. Buss. Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization , 1997, Kurt Gödel Colloquium.
[87] Michael A. Harrison,et al. On Asymptotic Estimates in Switching and Automata Theory , 1966, JACM.
[88] Andreas Blass,et al. On the Unique Satisfiability Problem , 1982, Inf. Control..
[89] Stasys Jukna. The Effect of Null-Chains on the Complexity of Contact Schemes , 1989, FCT.
[90] Manindra Agrawal,et al. The Boolean isomorphism problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[91] Lance Fortnow,et al. Are There Interactive Protocols for CO-NP Languages? , 1988, Inf. Process. Lett..
[92] Manindra Agrawal,et al. The satisfiability problem for probabilistic ordered branching programs , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).
[93] Alan Cobham,et al. The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.
[94] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..
[95] Ingo Wegener,et al. Reduction of OBDDs in Linear Time , 1993, Inf. Process. Lett..
[96] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[97] Harry B. Hunt,et al. On the Size of Binary Decision Diagrams Representing Boolean Functions , 1995, Theor. Comput. Sci..
[98] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[99] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..