Sciweavers

11949 search results - page 278 / 2390
» Some results on (a:b)-choosability
Sort
View
ICALP
2004
Springer
15 years 7 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
MFCS
2004
Springer
15 years 7 months ago
A Protocol for Serializing Unique Strategies
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
Marcel Crâsmaru, Christian Glaßer, Ken...
IPPS
2003
IEEE
15 years 7 months ago
Parallel LAN/WAN Heuristics for Optimization
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...
Enrique Alba, Gabriel Luque
FOCS
2002
IEEE
15 years 6 months ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
Vikraman Arvind, Piyush P. Kurur
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 6 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans