Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Yosi Ben-Asher, Ilan Newman |
Decision Trees with AND, OR Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 74-81, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Martin Kummer |
The Instance Complexity Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 111-124, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | James S. Royer |
Semantics versus Syntax versus Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 37-48, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Stephen A. Fenner |
Resource-Bounded Baire Category: A Stronger Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 182-192, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Jack H. Lutz |
A Small Span Theorem for P/Poly-Turing Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 324-330, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | John D. Rogers |
The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 90-101, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Stephen A. Fenner |
Inverting the Turing Jump in Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 102-110, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Kousha Etessami |
Counting Quantifiers, Successor Relations, and Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 2-11, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo |
A Personal View of Average-Case Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 134-147, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | |
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![IEEE Computer Society, 0-8186-7052-5 The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
1 | Richard Chang 0001, William I. Gasarch, Jacobo Torán |
On Finding the Number of Graph Automorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 288-298, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Anna Gál, Mario Szegedy |
Fault Tolerant Circuits and Probabilistically Checkable Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 65-73, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Marius Zimand |
Weighted NP Optimization Problems: Logical Definability and Approximation Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 12-28, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Köbler |
On the Structure of Low Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 246-261, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Elvira Mayordomo |
An Excursion to the Kolmogorov Random Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 197-203, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Sameet Agarwal, Anne Condon |
On Approximation Algorithms for Hierarchical MAX-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 214-226, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | José L. Balcázar, Elvira Mayordomo |
A Note on Genericity and Bi-Immunity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 193-196, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Richard Beigel, William I. Gasarch, Efim B. Kinber |
Frequency Computation and Bounded Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 125-132, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Richard Beigel, Howard Straubing |
The Power of Local Self-Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 277-285, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Kazuo Iwama, Eiji Miyano |
Intractability of Read-Once Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 29-36, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Yenjo Han, Thomas Thierauf |
Restricted Information from Nonadaptive Queries to NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 206-213, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Chih-Long Lin |
Optimizing TRIEs for Ordered Pattern Matching is PiP2-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 238-244, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner |
On the Power of Number-Theoretic Operations with Respect to Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 299-314, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Joan Feigenbaum, Daphne Koller, Peter W. Shor |
A Game-Theoretic Classification of Interactive Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 227-237, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Nicholas Q. Trân |
On P-Immunity of Nondeterministic Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 262-263, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Rainer Schuler, Osamu Watanabe 0001 |
Towards Average-Case Complexity Analysis of NP Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 148-159, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Anna Gál |
Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 82-87, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Ambos-Spies |
Resource-Bounded Genericity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 162-181, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Manindra Agrawal |
DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 315-323, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth W. Regan |
On Superlinear Lower Bounds in Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 50-64, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Manindra Agrawal, Vikraman Arvind |
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995, pp. 264-276, 1995, IEEE Computer Society, 0-8186-7052-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
1 | Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns |
Generalized CNF Satisfiability Problems and Non-Efficient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 356-366, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Avi Wigderson |
NL/poly <= +/poly (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 59-62, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Richard J. Lipton |
Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 79-87, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Manindra Agrawal |
On the Isomorphism Problem for Weak Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 338-355, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Leen Torenvliet |
On the Structure of Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 118-133, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Lance Fortnow, Tomoyuki Yamakami |
Generic Separations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 139-145, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Mitsunori Ogihara |
Polynomial-Time Membership Comparable Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 2-11, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Osamu Watanabe 0001 |
Test Instance Generation for Promise NP Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 205-216, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Kevin J. Compton, Erich Grädel |
Logical Definability of Counting Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 255-266, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Maciej Liskiewicz, Rüdiger Reischuk |
The Complexity World below Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 64-78, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Jim Kadin, Thomas Thierauf |
On Functions Computable with Nonadaptive Queries to NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 43-52, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Manindra Agrawal, Vikraman Arvind |
Polynomial Time Truth-Table Reductions to P-Selective Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 24-30, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Klaus-Jörn Lange, Peter Rossmanith |
Unambiguous Polynomial Hierarchies and Exponential Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 106-115, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor |
Random Debaters and the Hardness of Approximating Stochastic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 280-293, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Deborah Joseph, Randall Pruim, Paul Young |
Collapsing Degrees in Subexponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 367-382, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz |
On Ultrafilters and NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 97-105, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Jack H. Lutz |
Weakly Hard Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 146-161, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Steven M. Kautz, Peter Bro Miltersen |
Relative to a Random Oracle, NP is Not Small. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 162-174, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | David A. Mix Barrington, Neil Immerman |
Time, Hardware, and Uniformity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 176-185, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Gábor Tardos |
Multi-Prover Encoding Schemes and Three-Prover Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 308-317, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Richard Beigel, Martin Kummer, Frank Stephan 0001 |
Approximable Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 12-23, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo, Ran Raz, Avi Wigderson |
A Direct Product Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 88-96, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram |
Alternation in Interaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 294-303, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Oleg Verbitsky 0001 |
Towards the Parallel Repetition Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 304-307, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Sarah Mocas |
Using Bounded Query Classes to Separate Classes in the Exponential Time Hierarchy from Classes in PH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 53-58, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Eric Allender, Mitsunori Ogihara |
Relationships Among PL, #L, and the Determinant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 267-278, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Christos H. Papadimitriou, John N. Tsitsiklis |
The Complexity of Optimal Queueing Network Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 318-322, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Bernd Borchert |
Predicate Classes and Promise Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 235-241, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Richard Chang 0001 |
On the Query Complexity of Clique Size and Maximum Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 31-42, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Bernd Meyer 0002 |
Constructive Separation of Classes of Indistinguishable Ensembles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 198-204, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 242-254, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Richard Beigel, Judy Goldsmith |
Downward separation fails catastrophically for limited nondeterminism classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 134-138, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Pekka Orponen |
Random Strings Make Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 217-222, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich Hertrampf |
Complexity Classes Defined via k-valued Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 224-234, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | |
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![IEEE Computer Society, 0-8186-5670-0 The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
1 | Pavel Pudlák |
Complexity Theory and Genetics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 383-395, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Ricard Gavaldà |
The Complexity of Learning with Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 324-337, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Xiangdong Yu, Moti Yung |
Space Lower-Bounds for Pseudorandom-Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 186-197, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
1 | Birgit Jenner, Jacobo Torán |
Computing Functions with Parallel Queries to NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 280-291, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Phokion G. Kolaitis, Madhukar N. Thakur |
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 31-41, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Sanjay Gupta |
Alternating Time Versus Deterministic Time: A Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 266-277, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Manindra Agrawal, Somenath Biswas |
Polynomial Isomorphism of 1-L-Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 75-80, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Pierluigi Crescenzi, Riccardo Silvestri |
Sperner's Lemma and Robust Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 194-199, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann, Eduardo D. Sontag |
Some Structural Complexity Aspects of Neural Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 253-265, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Jay Belanger, Jie Wang 0002 |
Isomorphisms of NP Complete Problems on Random Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 65-74, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Richard Beigel |
The Polynomial Method in Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 82-95, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe 0001 |
On Closure Properties of #P in the Context of PF°#P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 139-146, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | |
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![IEEE Computer Society, 0-8186-4070-7 The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
1 | Zhi-Zhong Chen, Seinosuke Toda |
The Complexity of Selecting Maximal Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 313-325, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner |
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 200-207, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li |
An Oarcle Builder's Toolkit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 120-131, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Nikolai K. Vereshchagin |
Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 132-138, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Jack H. Lutz |
The Quantitative Structure of Exponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 158-175, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo |
Pointers versus Arithmetic in PRAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 239-252, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Suresh Chari, Pankaj Rohatgi |
On Completeness under Random Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 176-184, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Köbler, Seinosuke Toda |
On the Power of Generalized MOD-Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 147-155, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Sanjeev Saluja |
Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 215-222, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Mauricio Karchmer |
On Proving Lower Bounds for Circuit Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 112-118, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao |
Towards Uncheatable benchmarks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 2-11, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Shi-Chun Tsai |
Lower Bounds on Representing Boolean Functions as Polynomials in Zm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 96-101, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Bin Fu |
With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 185-191, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi |
On Monadic NP vs. Monadic co-NP (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 19-30, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Klaus-Jörn Lange |
Complexity and Structure in Formal Language Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 224-238, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Christos H. Papadimitriou, Mihalis Yannakakis |
On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 12-18, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Peter van Helden, Leen Torenvliet |
P-Selective Self-reducibles Sets: A New Characterization of P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 44-51, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | David Zuckerman |
NP-Complete Problems Have a Version That's Hard to Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 305-312, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Mauricio Karchmer, Avi Wigderson |
On Span Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 102-111, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Luc Longpré, Edith Spaan |
SPARSE reduces conjunctively to TALLY. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 208-214, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
1 | Tirza Hirst, David Harel |
Taking it to the Limit: On Infinite Variants of NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pp. 292-304, 1993, IEEE Computer Society, 0-8186-4070-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|