Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
108 | Wolfgang Merkle, Yongge Wang |
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 179-190, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
79 | Marcus Schaefer 0001, Frank Stephan 0001 |
Strong Reductions and Immunity for Exponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 559-570, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
hardness for exponential time, polynomial time reducibilities, Computational and structural complexity |
74 | Victor L. Selivanov |
Some Reducibilities on Regular Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 430-439, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
68 | Patrizio Cintioli, Riccardo Silvestri |
Polynomial Time Introreducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(1), pp. 1-15, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
57 | David R. Bélanger |
Structures of Some Strong Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 21-30, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
57 | Wolfgang Merkle |
Exact Pairs for Abstract Bounded Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 349-368, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
57 | Montserrat Hermo |
Degrees and Reducibilities of Easy Tally Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 403-412, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
57 | Alan L. Selman |
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 546-555, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
51 | Ravi Kumar 0001, D. Sivakumar 0001 |
Proofs, Codes, and Polynomial-Time Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 46-53, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
reducibilities, proof systems, partial solutions |
51 | Wolfgang Merkle |
The Global Power of Additional Queries to p-Random Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 914-925, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
51 | Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng |
A Comparison of Weak Completeness Notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 171-178, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Weak Completeness, Measure, Genericity, Completeness |
46 | Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang 0004 |
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 33(5), pp. 1060-1088, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
45 | Jacobo Torán |
Reductions to Graph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 158-167, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, reducibilities, graph isomorphism |
45 | Klaus Ambos-Spies, Levke Bentzien |
Separating NP-Completeness Notions under Strong Hypotheses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 121-127, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure |
40 | Andrea Sorbi |
Strong Positive Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 29-38, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Johann A. Makowsky |
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 403-406, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Roland Sh. Omanadze, Andrea Sorbi |
Strong Enumeration Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(7), pp. 869-912, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03D30 |
40 | Steven Homer |
Minimal degrees for polynomial reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 34(2), pp. 480-491, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
34 | Alexey Stukachev |
On Mass Problems of Presentability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 772-782, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte |
Randomness and Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 316-327, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Bernd Borchert, Riccardo Silvestri |
The General Notion of a Dot-Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 36-44, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Pierluigi Crescenzi |
A Short Guide to Approximation Preserving Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 262-273, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
approximation preserving reductions, computational complexity, complexity, combinatorial optimization |
34 | Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman |
On Using Oracles That Compute Values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 398-407, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Miroslaw Kowaluk, Klaus W. Wagner |
Vector Language: Simple Description of Hard Instances (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 378-384, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Robert I. Soare |
Computability and Incomputability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 705-715, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Turing a-machine, Church-Turing Thesis, Kurt Gödel, Turing o-machine, computable approximations, effectively continuous functions on reals, computability in analysis, strong reducibilities reexamined, computability, Alan Turing |
23 | Klaus Ambos-Spies, Rod Downey, Martin Monath |
Lowness properties for strong reducibilities and the computational power of maximal sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 13(1), pp. 1-56, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Bjørn Kjos-Hanssen, David J. Webb |
Strong Medvedev Reducibilities and the KL-Randomness Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 151-161, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Masaki Kobayashi |
Reducibilities of hyperbolic neural networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neurocomputing ![In: Neurocomputing 378, pp. 129-141, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Roland Sh. Omanadze |
On the connections between wttwttwttwttwtt- and QQ[Math Processing Error]Q-reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 29(1), pp. 37-51, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Kenshi Miyabe |
Coherence of Reducibilities with Randomness Notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 62(7), pp. 1599-1619, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Nadine Losert |
Multiple permitting and bounded turing reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2018 |
RDF |
|
23 | Alex Gavryushkin, Bakhadyr Khoussainov, Frank Stephan 0001 |
Reducibilities among equivalence relations induced by recursively enumerable structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 612, pp. 137-152, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Kenshi Miyabe |
Reducibilities Relating to Schnorr Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 58(3), pp. 441-462, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov |
Wadge-like reducibilities on arbitrary quasi-Polish spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 25(8), pp. 1705-1754, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Luca Motto Ros, Philipp Schlicht |
Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic, Computation, Hierarchies ![In: Logic, Computation, Hierarchies, pp. 213-258, 2014, De Gruyter, 978-1-61451-804-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Tomoyuki Yamakami |
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, pp. 514-525, 2014, Springer, 978-3-319-04297-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan 0001, Guohua Wu |
Anti-complex sets and reducibilities with tiny use. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 78(4), pp. 1307-1327, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya |
On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 96-D(3), pp. 465-471, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Klaus Ambos-Spies, Timur Bakibayev |
Nontriviality for exponential time w.r.t. weak reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 494, pp. 2-12, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Tomoyuki Yamakami |
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1303.1717, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Iskander Sh. Kalimullin |
Algorithmic reducibilities of algebraic structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 22(4), pp. 831-843, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Barbara F. Csima, Rod Downey, Keng Meng Ng |
Limits on jump inversion for strong reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 76(4), pp. 1287-1296, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi |
Immunity properties and strong positive reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 50(3-4), pp. 341-352, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Luca Motto Ros |
Baire reductions and good Borel reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 75(1), pp. 323-345, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Arno Pauly |
On the (semi)lattices induced by continuous reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 56(5), pp. 488-502, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Luca Motto Ros |
Beyond Borel-amenability: Scales and superamenable reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 161(7), pp. 829-836, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Klaus Ambos-Spies, Timur Bakibayev |
Nontriviality for Exponential Time w.r.t. Weak Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, pp. 84-93, 2010, Springer, 978-3-642-13561-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Luca Motto Ros |
Borel-amenable reducibilities for sets of reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 74(1), pp. 27-49, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Arno Pauly |
On the (semi)lattices induced by continuous reducibilities ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0903.2177, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
23 | Victor L. Selivanov |
Hierarchies and reducibilities on regular languages related to modulo counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 43(1), pp. 95-132, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Victor L. Selivanov |
Fine hierarchies and m-reducibilities in theoretical computer science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 405(1-2), pp. 116-163, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Sebastian Bab, Arfst Nickelsen |
One query reducibilities between partial information classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 345(2-3), pp. 173-189, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Felipe Cucker |
On sparseness, reducibilities, and complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 134(1), pp. 53-61, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Sebastian Bab, Arfst Nickelsen |
One Query Reducibilities Between Partial Information Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 404-415, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Valeriy K. Bulitko, Vadim Bulitko |
On existence of complete sets for bounded reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 49(6), pp. 567-575, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Valeriy K. Bulitko |
Post's Problem for Reducibilities of Bounded Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 48(3), pp. 367-373, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001 |
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 35(4), pp. 449-463, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Merkle |
Lattice Embeddings for Abstract Bounded Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 31(4), pp. 1119-1155, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Merkle, Yongge Wang |
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 47(2), pp. 249-269, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001 |
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 51-62, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Timothy H. McNicholl |
Intrinsic Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 46(3), pp. 393-407, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001 |
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR00, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
23 | Wolfgang Merkle |
Exact Pairs for Abstract Bounded Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 45, pp. 343-360, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Klaus Ambos-Spies |
Polynomial Time Reducibilities and Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 683-705, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Piergiorgio Odifreddi |
Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 89-119, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Cristian Calude, André Nies |
Chaitin Omega Numbers and Strong Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Univers. Comput. Sci. ![In: J. Univers. Comput. Sci. 3(11), pp. 1162-1166, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Phil Watson |
Embeddings in the Strong Reducibilities Between 1 and npm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 43, pp. 559-568, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Merkle |
A generalized account of resource bounded reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1997 |
RDF |
|
23 | Manindra Agrawal |
On the Isomorphism Conjecture for Weak Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 53(2), pp. 267-282, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Anuj Dawar |
Generalized Quantifiers and Logical Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 5(2), pp. 213-226, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Pavol Duris, José D. P. Rolim |
Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 5(3/4), pp. 319-328, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | Judy Goldsmith, Deborah Joseph, Paul Young |
Using Self-Reducibilities to Characterize Polynomial Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 104(2), pp. 288-308, June 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | K. Ganesan 0001, Steven Homer |
Complete Problems and Strong Polynomial Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 21(4), pp. 733-742, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Jianer Chen |
Characterizing Parallel Hierarchies by Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 39(6), pp. 303-307, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | Ricard Gavaldà, José L. Balcázar |
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 88(1), pp. 1-14, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | Shouwen Tang, Ronald V. Book |
Polynomial-Time Reducibilities and "Almost All" Oracle Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 81(1), pp. 35-47, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | Shouwen Tang, Ronald V. Book |
Reducibilities on tally and sparse sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 25, pp. 293-302, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | José L. Balcázar |
Adaptive Logspace and Depth-Bounded Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991, pp. 240-254, 1991, IEEE Computer Society, 0-8186-2255-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | Ronald V. Book, Shouwen Tang |
Characterizing Polynomial Complexity Classes by Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 23(3), pp. 165-174, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Andrzej Orlicki |
Correction to "Strong Reducibilities of Enumerations and Partial Enumerated Algebras". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 35(1), pp. 95, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Klaus Ambos-Spies |
Honest Polynomial Time Reducibilities and the P = ? NP Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 39(3), pp. 250-281, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Richard Beigel, William I. Gasarch, James C. Owings |
Nondeterministic Bounded Query Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 41(2), pp. 107-118, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Ker-I Ko |
Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 81(1), pp. 62-87, April 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | K. Ganesan 0001, Steven Homer |
Complete Problems and Strong Polynomial Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, pp. 240-250, 1989, Springer, 3-540-50840-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Andrzej Orlicki |
Strong Reducibilities of Enumerations and Partial Enumerated Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 34(2), pp. 143-162, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Ronald V. Book |
Sparse Sets, Tally Sets, and Polynomial Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 1-13, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Ricard Gavaldà, José L. Balcázar |
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 300-308, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Ker-I Ko |
Distinguishing bounded reducibilities by sparse sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988, pp. 181-191, 1988, IEEE Computer Society, 0-8186-0794-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Luc Longpré, Paul Young |
Cook is faster than Karp: a study of reducibilities in NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988, pp. 293-302, 1988, IEEE Computer Society, 0-8186-0794-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Jim Kadin |
Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1988 |
RDF |
|
23 | Klaus Ambos-Spies |
Minimal Pairs for Polynomial Time Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computation Theory and Logic ![In: Computation Theory and Logic, In Memory of Dieter Rödding, pp. 1-13, 1987, Springer, 3-540-18170-9. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
23 | Klaus Ambos-Spies |
Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987, pp. 60-68, 1987, IEEE Computer Society, 978-0-8186-0794-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP BibTeX RDF |
|
23 | Richard Beigel |
Query-limited reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1987 |
RDF |
|
23 | Klaus Ambos-Spies |
Randomness, Relativizations, and Polynomial Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, USA, June 2-5, 1986, pp. 23-34, 1986, Springer, 3-540-16486-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
23 | Ker-I Ko |
Reducibilities on Real Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 31, pp. 101-123, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
23 | Steven Homer |
Minimal Degrees for Honest Polynomial Reducibilities ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24-26 October 1984, pp. 300-307, 1984, IEEE Computer Society, 0-8186-0591-X. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
23 | Piergiorgio Odifreddi |
Forcing and Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 48(2), pp. 288-310, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
23 | Piergiorgio Odifreddi |
Forcing and Reducibilities. III. Forcing in Fragments of Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 48(4), pp. 1013-1034, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
23 | Piergiorgio Odifreddi |
Forcing and Reducibilities. II. Forcing in Fragments of Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 48(3), pp. 724-743, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|