Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

3

APAL
2005

favoriteEmaildiscussreport

57views more APAL 2005»

Enumerations in computable structure theory

13 years 4 months ago

Enumerations in computable structure theory

Download qcpages.qc.cuny.edu

Sergei S. Goncharov, Valentina S. Harizanov, Julia

Real-time Traffic

APAL 2005 |

claim paper

Related Content

» Undecidability of the structure of the Solovay degrees of ce reals

» Computably Enumerable Sets and QuasiReducibility

» Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees

» On the Theory of Pfaffian Orientations II Tjoins kcuts and Duality of Enumeration

» Exhaustive Search Combinatorial Optimization and Enumeration Exploring the Potential of Ra...

» Enumerating Homomorphisms

» The analytic computability of the Shannon transform for a large class of random matrix cha...

» Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration

» Universality and Cellular Automata

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	APAL
Authors	Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell Miller, Reed Solomon

Comments (0)