Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
78 | Xizhong Zheng |
Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
c.e. sets, c.e. reals, bounded c.e. reals, Ershov’s Hierarchy |
53 | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
On the Effective Enumerability of NP Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Sanjay Jain 0001, Steffen Lange, Sandra Zilles |
Gold-Style and Query Learning Under Various Constraints on the Target Class. |
ALT |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Ulisses Ferreira |
The sets of real and complex numbers are denumerable. |
SIGACT News |
2005 |
DBLP DOI BibTeX RDF |
cantor, foundation of mathematics, foundations of computer science, numbers and sets, real, transfinite, computability, enumerability, mathematics, number theory, philosophy, halting problem |
27 | Mikhail N. Rybakov, Dmitry Shkatov |
Recursive enumerability and elementary frame definability in predicate modal logic. |
J. Log. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Mikhail N. Rybakov, Dmitry Shkatov |
Recursive enumerability and elementary frame definability in predicate modal logic. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
27 | Paul Shafer, Andrea Sorbi |
Comparing the degrees of enumerability and the closed Medvedev degrees. |
Arch. Math. Log. |
2019 |
DBLP DOI BibTeX RDF |
|
27 | Gerald E. Sacks |
On the non-Enumerability of l. |
J. Symb. Log. |
2016 |
DBLP DOI BibTeX RDF |
|
27 | Antti Kuusisto |
Team Semantics and Recursive Enumerability. |
SOFSEM (Student Research Forum Papers / Posters) |
2015 |
DBLP BibTeX RDF |
|
27 | Makoto Kanazawa, Ryo Yoshinaka |
Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars. |
FG |
2015 |
DBLP DOI BibTeX RDF |
|
27 | Antti Kuusisto |
Team Semantics and Recursive Enumerability. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
27 | Mingzhong Cai, Richard A. Shore |
Domination, forcing, array nonrecursiveness and relative recursive enumerability. |
J. Symb. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Mingzhong Cai |
Array nonrecursiveness and relative recursive enumerability. |
J. Symb. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Wei Wang 0150 |
Relative enumerability and 1-genericity. |
J. Symb. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Peter Damaschke |
Fixed-Parameter Enumerability of Cluster Editing and Related Problems. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Iskander Sh. Kalimullin |
Enumeration Degrees and Enumerability of Familes. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Fouad B. Chedid |
Parameterized Enumerability for the Database Theorist. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
27 | Alina Beygelzimer, Mitsunori Ogihara |
The enumerability of P collapses P to NC. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Peter Damaschke |
On the Fixed-Parameter Enumerability of Cluster Editing. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Alina Beygelzimer, Mitsunori Ogihara |
The Enumerability of P Collapses P to NC. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Alina Beygelzimer, Mitsunori Ogihara |
The (Non)Enumerability of the Determinant and the Rank. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Till Tantau |
On structural similarities of finite automata and Turing machine enumerability classes. |
|
2003 |
RDF |
|
27 | Alina Beygelzimer, Mitsunori Ogihara |
On the Enumerability of the Determinant and the Rank |
Electron. Colloquium Comput. Complex. |
2002 |
DBLP BibTeX RDF |
|
27 | Alina Beygelzimer, Mitsunori Ogihara |
On the Enumerability of the Determinant and the Rank. |
IFIP TCS |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Antonín Kucera 0002, Theodore A. Slaman |
Randomness and Recursive Enumerability. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Shamil Ishmukhametov |
On relative enumerability of Turing degrees. |
Arch. Math. Log. |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Stephan Wehner |
On Recursive Enumerability with Finite Repetitions. |
J. Symb. Log. |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Xizhong Zheng |
Binary Enumerability of Real Numbers. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman |
Relative Enumerability in the Difference Hierarchy. |
J. Symb. Log. |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Éric Sopena |
Expanding Graph Relabeling Systems have the Power of Recursive Enumerability. |
Fundam. Informaticae |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Stephan Wehner |
On injective enumerability of recursively enumerable classes of cofinite sets. |
Arch. Math. Log. |
1995 |
DBLP DOI BibTeX RDF |
|
27 | Peter A. Cholak, Peter G. Hinman |
Iterated relative recursive enumerability. |
Arch. Math. Log. |
1994 |
DBLP DOI BibTeX RDF |
|
27 | Masahiro Kumabe |
Relative Recursive Enumerability of Generic Degrees. |
J. Symb. Log. |
1991 |
DBLP DOI BibTeX RDF |
|
27 | Loredana Biacino, Giangiacomo Gerla |
Decidability, Recursive Enumerability and Kleene Hierarchy For L-Subsets. |
Math. Log. Q. |
1989 |
DBLP DOI BibTeX RDF |
|
27 | Loredana Biacino, Giangiacomo Gerla |
Decidability and Recursive Enumerability for Fuzzy Subsets. |
IPMU |
1988 |
DBLP DOI BibTeX RDF |
|
27 | Gerald E. Sacks |
The limits of E-recursive enumerability. |
Ann. Pure Appl. Log. |
1986 |
DBLP DOI BibTeX RDF |
|
27 | Peter van Emde Boas, Paul M. B. Vitányi |
A note on the recursive enumerability of some classes of recursively enumerable languages. |
Inf. Sci. |
1978 |
DBLP DOI BibTeX RDF |
|
27 | Bernd J. Stephan |
Compactness and recursive enumerability in intensional logic. |
Math. Log. Q. |
1975 |
DBLP DOI BibTeX RDF |
|
27 | Forbes D. Lewis |
The Enumerability and Invariance of Complexity Classes. |
J. Comput. Syst. Sci. |
1971 |
DBLP DOI BibTeX RDF |
|
27 | Hans Hermes |
Enumerability, decidability, computability - an introduction to the theory of recursive functions. |
|
1969 |
RDF |
|
27 | Vaclav Edvard Benes |
On the Consistency of an Axiom of Enumerability. |
J. Symb. Log. |
1955 |
DBLP DOI BibTeX RDF |
|
27 | Paul Bernays |
A System of Axiomatic Set Theory: Part III. Infinity and Enumerability. Analysis. |
J. Symb. Log. |
1942 |
DBLP DOI BibTeX RDF |
|
25 | Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller |
Spectra of Algebraic Fields and Subfields. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
Computability, algebraic, field, spectrum, computable model theory |
25 | Konstantinos Drakakis, Scott T. Rickard |
Costas permutations in the continuum. |
CISS |
2008 |
DBLP DOI BibTeX RDF |
|