4131 search results - page 10 / 827 » Compactness in Topology and Computation |
APAL
2006
14 years 11 months ago
2006
Given a space X, J in an elementary submodel M of H(), define XM to be X M with the topology generated by {U M : U J M}. It is established, using anti-large-cardinals assumptio...
SIAMCOMP
2008
14 years 11 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
103
click to vote
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
86
Voted
MOC
2010
14 years 6 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...