Search results for "autoreducibility"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang	Non-mitotic Sets.	FSTTCS	2007	DBLP DOI BibTeX RDF
66	Harry Buhrman, Lance Fortnow, Leen Torenvliet	Using Autoreducibility to Separate Complexity Classes.	FOCS	1995	DBLP DOI BibTeX RDF	autoreducibility, doubly exponential space, Turing complete sets, logarithmic space, computational complexity, set theory, oracle, complexity theory, Turing machines, Turing machine, complexity classes, structural properties, polynomial space, diagonalization
53	Todd Ebert, Wolfgang Merkle	Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits.	MFCS	2002	DBLP DOI BibTeX RDF
47	Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang	Redundancy in Complete Sets.	STACS	2006	DBLP DOI BibTeX RDF
47	Richard Beigel, Lance Fortnow, Frank Stephan 0001	Infinitely-Often Autoreducible Sets.	ISAAC	2003	DBLP DOI BibTeX RDF
30	John M. Hitchcock, Hadi Shafei	Autoreducibility of NP-Complete Sets under Strong Hypotheses.	Comput. Complex.	2018	DBLP DOI BibTeX RDF
30	Shuji Isobe, Eisuke Koizumi	Autoreducibility and Completeness for Partial Multivalued Functions.	IEICE Trans. Inf. Syst.	2017	DBLP DOI BibTeX RDF
30	Christian Glaßer, Maximilian Witek	Autoreducibility and mitoticity of logspace-complete sets for NP and other classes.	Inf. Comput.	2017	DBLP DOI BibTeX RDF
30	Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek	Introduction to Autoreducibility and Mitoticity.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
30	John M. Hitchcock, Hadi Shafei	Autoreducibility of NP-Complete Sets.	Electron. Colloquium Comput. Complex.	2016	DBLP BibTeX RDF
30	John M. Hitchcock, Hadi Shafei	Autoreducibility of NP-Complete Sets.	CoRR	2016	DBLP BibTeX RDF
30	John M. Hitchcock, Hadi Shafei	Autoreducibility of NP-Complete Sets.	STACS	2016	DBLP DOI BibTeX RDF
30	Christian Glaßer, Maximilian Witek	Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes.	MFCS (2)	2014	DBLP DOI BibTeX RDF
30	Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek	Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions.	Electron. Colloquium Comput. Complex.	2013	DBLP BibTeX RDF
30	Christian Glaßer, Maximilian Witek	Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes.	Electron. Colloquium Comput. Complex.	2013	DBLP BibTeX RDF
30	Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek	Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions.	ICALP (1)	2013	DBLP DOI BibTeX RDF
30	Piotr Faliszewski, Mitsunori Ogihara	On the Autoreducibility of Functions.	Theory Comput. Syst.	2010	DBLP DOI BibTeX RDF
30	Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang	Autoreducibility, mitoticity, and immunity.	J. Comput. Syst. Sci.	2007	DBLP DOI BibTeX RDF
30	Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang	Autoreducibility, Mitoticity, and Immunity	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
30	Piotr Faliszewski, Mitsunori Ogihara	Separating the Notions of Self- and Autoreducibility.	MFCS	2005	DBLP DOI BibTeX RDF
30	Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang	Autoreducibility, Mitoticity, and Immunity.	MFCS	2005	DBLP DOI BibTeX RDF
30	Todd Ebert, Wolfgang Merkle, Heribert Vollmer	On the Autoreducibility of Random Sequences.	SIAM J. Comput.	2003	DBLP DOI BibTeX RDF
30	Todd Ebert, Wolfgang Merkle, Heribert Vollmer	On the Autoreducibility of Random Sequences	Electron. Colloquium Comput. Complex.	2002	DBLP BibTeX RDF
30	Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet	Separating Complexity Classes Using Autoreducibility.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
30	Todd Ebert, Heribert Vollmer	On the Autoreducibility of Random Sequences.	MFCS	2000	DBLP DOI BibTeX RDF
23	Christian Glaßer	Space-Efficient Informational Redundancy.	ISAAC	2008	DBLP DOI BibTeX RDF
23	Harumichi Nishimura, Tomoyuki Yamakami	An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).	MFCS	2004	DBLP DOI BibTeX RDF	Algorithmic argument, nonadaptive query, quantum computation, query complexity, advice
23	Wolfgang Merkle, Nenad Mihailovic	On the Construction of Effective Random Sets.	MFCS	2002	DBLP DOI BibTeX RDF
23	Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann 0001, Frank Stephan 0001	Hausdorff Dimension in Exponential Time.	CCC	2001	DBLP DOI BibTeX RDF