default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChicago Journal of Theoretical Computer Science, 1999
Volume 1999, 1999
- Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán:
On Finding the Number of Graph Automorphisms. - Jie Wang:
Randomized Reductions and Isomorphisms. - Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. - Christoph Karg, Johannes Köbler, Rainer Schuler:
The Complexity of Generating Test Instances. - Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan:
The Complexity of Problems on Graphs Represented as OBDDs. - Arun K. Jagota:
Hopfield Neural Networks and Self-Stabilization. - Eric Allender:
The Permanent Requires Large Uniform Threshold Circuits. - Jeff Erickson:
Bounds for Linear Satisfiability Problems. - Martha J. Kosa:
Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types. - Zeev Collin, Rina Dechter, Shmuel Katz:
Self-Stabilizing Distributed Constraint Satisfaction. - Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. - Adnan Aziz, Felice Balarin, Vigyan Singhal, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli:
Equivalences for Fair Kripke Structures.
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.
last updated on 2024-12-26 00:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
