The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for reducibilities with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1968-1983 (17) 1984-1988 (15) 1989-1992 (15) 1993-1997 (20) 1999-2002 (16) 2003-2006 (15) 2007-2010 (16) 2011-2019 (15) 2020-2024 (4)
Publication types (Num. hits)
article(69) incollection(3) inproceedings(56) phdthesis(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 19 occurrences of 16 keywords

Results
Found 133 publication records. Showing 133 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
108Wolfgang Merkle, Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
79Marcus Schaefer 0001, Frank Stephan 0001 Strong Reductions and Immunity for Exponential Time. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF hardness for exponential time, polynomial time reducibilities, Computational and structural complexity
74Victor L. Selivanov Some Reducibilities on Regular Sets. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
68Patrizio Cintioli, Riccardo Silvestri Polynomial Time Introreducibility. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
57David R. Bélanger Structures of Some Strong Reducibilities. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
57Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. Search on Bibsonomy CSL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
57Montserrat Hermo Degrees and Reducibilities of Easy Tally Sets. Search on Bibsonomy MFCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
57Alan L. Selman P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. Search on Bibsonomy ICALP The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
51Ravi Kumar 0001, D. Sivakumar 0001 Proofs, Codes, and Polynomial-Time Reducibilities. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF reducibilities, proof systems, partial solutions
51Wolfgang Merkle The Global Power of Additional Queries to p-Random Oracles. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
51Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng A Comparison of Weak Completeness Notions. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Weak Completeness, Measure, Genericity, Completeness
46Irakli 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 J. Log. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
45Jacobo Torán Reductions to Graph Isomorphism. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Computational complexity, reducibilities, graph isomorphism
45Klaus Ambos-Spies, Levke Bentzien Separating NP-Completeness Notions under Strong Hypotheses. Search on Bibsonomy CCC The full citation details ... 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
40Andrea Sorbi Strong Positive Reducibilities. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
40Johann A. Makowsky Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Roland Sh. Omanadze, Andrea Sorbi Strong Enumeration Reducibilities. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D30
40Steven Homer Minimal degrees for polynomial reducibilities. Search on Bibsonomy J. ACM The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
34Alexey Stukachev On Mass Problems of Presentability. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte Randomness and Reducibility. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Bernd Borchert, Riccardo Silvestri The General Notion of a Dot-Operator. Search on Bibsonomy CCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
34Pierluigi Crescenzi A Short Guide to Approximation Preserving Reductions. Search on Bibsonomy CCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF approximation preserving reductions, computational complexity, complexity, combinatorial optimization
34Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman On Using Oracles That Compute Values. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
34Miroslaw Kowaluk, Klaus W. Wagner Vector Language: Simple Description of Hard Instances (Extended Abstract). Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
28Robert I. Soare Computability and Incomputability. Search on Bibsonomy CiE The full citation details ... 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
23Klaus Ambos-Spies, Rod Downey, Martin Monath Lowness properties for strong reducibilities and the computational power of maximal sets. Search on Bibsonomy Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
23Bjørn Kjos-Hanssen, David J. Webb Strong Medvedev Reducibilities and the KL-Randomness Problem. Search on Bibsonomy CiE The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Masaki Kobayashi Reducibilities of hyperbolic neural networks. Search on Bibsonomy Neurocomputing The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Roland Sh. Omanadze On the connections between wttwttwttwttwtt- and QQ[Math Processing Error]Q-reducibilities. Search on Bibsonomy J. Log. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Kenshi Miyabe Coherence of Reducibilities with Randomness Notions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Nadine Losert Multiple permitting and bounded turing reducibilities. Search on Bibsonomy 2018   RDF
23Alex Gavryushkin, Bakhadyr Khoussainov, Frank Stephan 0001 Reducibilities among equivalence relations induced by recursively enumerable structures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Kenshi Miyabe Reducibilities Relating to Schnorr Randomness. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov Wadge-like reducibilities on arbitrary quasi-Polish spaces. Search on Bibsonomy Math. Struct. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Luca Motto Ros, Philipp Schlicht Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces. Search on Bibsonomy Logic, Computation, Hierarchies The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Tomoyuki Yamakami Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. Search on Bibsonomy SOFSEM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan 0001, Guohua Wu Anti-complex sets and reducibilities with tiny use. Search on Bibsonomy J. Symb. Log. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Ji-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 IEICE Trans. Inf. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Klaus Ambos-Spies, Timur Bakibayev Nontriviality for exponential time w.r.t. weak reducibilities. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Tomoyuki Yamakami Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
23Iskander Sh. Kalimullin Algorithmic reducibilities of algebraic structures. Search on Bibsonomy J. Log. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
23Barbara F. Csima, Rod Downey, Keng Meng Ng Limits on jump inversion for strong reducibilities. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
23Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi Immunity properties and strong positive reducibilities. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
23Luca Motto Ros Baire reductions and good Borel reducibilities. Search on Bibsonomy J. Symb. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Arno Pauly On the (semi)lattices induced by continuous reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Luca Motto Ros Beyond Borel-amenability: Scales and superamenable reducibilities. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Klaus Ambos-Spies, Timur Bakibayev Nontriviality for Exponential Time w.r.t. Weak Reducibilities. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Luca Motto Ros Borel-amenable reducibilities for sets of reals. Search on Bibsonomy J. Symb. Log. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Arno Pauly On the (semi)lattices induced by continuous reducibilities Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
23Victor L. Selivanov Hierarchies and reducibilities on regular languages related to modulo counting. Search on Bibsonomy RAIRO Theor. Informatics Appl. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Victor L. Selivanov Fine hierarchies and m-reducibilities in theoretical computer science. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23Sebastian Bab, Arfst Nickelsen One query reducibilities between partial information classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Felipe Cucker On sparseness, reducibilities, and complexity. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Sebastian Bab, Arfst Nickelsen One Query Reducibilities Between Partial Information Classes. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Valeriy K. Bulitko, Vadim Bulitko On existence of complete sets for bounded reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23Valeriy K. Bulitko Post's Problem for Reducibilities of Bounded Complexity. Search on Bibsonomy Math. Log. Q. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Shin 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 Theory Comput. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Wolfgang Merkle Lattice Embeddings for Abstract Bounded Reducibilities. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Wolfgang Merkle, Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Shin 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 STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Timothy H. McNicholl Intrinsic Reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
23Shin 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 Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
23Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Klaus Ambos-Spies Polynomial Time Reducibilities and Degrees. Search on Bibsonomy Handbook of Computability Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Piergiorgio Odifreddi Reducibilities. Search on Bibsonomy Handbook of Computability Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Cristian Calude, André Nies Chaitin Omega Numbers and Strong Reducibilities. Search on Bibsonomy J. Univers. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Phil Watson Embeddings in the Strong Reducibilities Between 1 and npm. Search on Bibsonomy Math. Log. Q. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Wolfgang Merkle A generalized account of resource bounded reducibilities. Search on Bibsonomy 1997   RDF
23Manindra Agrawal On the Isomorphism Conjecture for Weak Reducibilities. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
23Anuj Dawar Generalized Quantifiers and Logical Reducibilities. Search on Bibsonomy J. Log. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
23Pavol Duris, José D. P. Rolim Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
23Manindra Agrawal On the Isomorphism Problem for Weak Reducibilities. Search on Bibsonomy SCT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
23Judy Goldsmith, Deborah Joseph, Paul Young Using Self-Reducibilities to Characterize Polynomial Time Search on Bibsonomy Inf. Comput. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
23K. Ganesan 0001, Steven Homer Complete Problems and Strong Polynomial Reducibilities. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
23Jianer Chen Characterizing Parallel Hierarchies by Reducibilities. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23Ricard Gavaldà, José L. Balcázar Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23Shouwen Tang, Ronald V. Book Polynomial-Time Reducibilities and "Almost All" Oracle Sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23Shouwen Tang, Ronald V. Book Reducibilities on tally and sparse sets. Search on Bibsonomy RAIRO Theor. Informatics Appl. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23José L. Balcázar Adaptive Logspace and Depth-Bounded Reducibilities. Search on Bibsonomy SCT The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23Ronald V. Book, Shouwen Tang Characterizing Polynomial Complexity Classes by Reducibilities. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
23Andrzej Orlicki Correction to "Strong Reducibilities of Enumerations and Partial Enumerated Algebras". Search on Bibsonomy Math. Log. Q. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
23Klaus Ambos-Spies Honest Polynomial Time Reducibilities and the P = ? NP Problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
23Richard Beigel, William I. Gasarch, James C. Owings Nondeterministic Bounded Query Reducibilities. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
23Ker-I Ko Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets Search on Bibsonomy Inf. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
23K. Ganesan 0001, Steven Homer Complete Problems and Strong Polynomial Reducibilities. Search on Bibsonomy STACS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
23Andrzej Orlicki Strong Reducibilities of Enumerations and Partial Enumerated Algebras. Search on Bibsonomy Math. Log. Q. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Ronald V. Book Sparse Sets, Tally Sets, and Polynomial Reducibilities. Search on Bibsonomy MFCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Ricard Gavaldà, José L. Balcázar Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. Search on Bibsonomy MFCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Ker-I Ko Distinguishing bounded reducibilities by sparse sets. Search on Bibsonomy SCT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Luc Longpré, Paul Young Cook is faster than Karp: a study of reducibilities in NP. Search on Bibsonomy SCT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Jim Kadin Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy. Search on Bibsonomy 1988   RDF
23Klaus Ambos-Spies Minimal Pairs for Polynomial Time Reducibilities. Search on Bibsonomy Computation Theory and Logic The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
23Klaus Ambos-Spies Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. Search on Bibsonomy SCT The full citation details ... 1987 DBLP  BibTeX  RDF
23Richard Beigel Query-limited reducibilities. Search on Bibsonomy 1987   RDF
23Klaus Ambos-Spies Randomness, Relativizations, and Polynomial Reducibilities. Search on Bibsonomy SCT The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
23Ker-I Ko Reducibilities on Real Numbers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
23Steven Homer Minimal Degrees for Honest Polynomial Reducibilities Search on Bibsonomy FOCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
23Piergiorgio Odifreddi Forcing and Reducibilities. Search on Bibsonomy J. Symb. Log. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
23Piergiorgio Odifreddi Forcing and Reducibilities. III. Forcing in Fragments of Set Theory. Search on Bibsonomy J. Symb. Log. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
23Piergiorgio Odifreddi Forcing and Reducibilities. II. Forcing in Fragments of Analysis. Search on Bibsonomy J. Symb. Log. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 133 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license