Sciweavers

11345 search results - page 118 / 2269
» Foundations of Computer Science
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Lan...
MFPS
1993
15 years 10 months ago
Some Quasi-Varieties of Iteration Theories
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
Stephen L. Bloom, Zoltán Ésik
FOSSACS
2010
Springer
16 years 1 months ago
A Semantic Foundation for Hidden State
Abstract. We present the first complete soundness proof of the antiframe rule, a recently proposed proof rule for capturing information hiding in the presence of higher-order stor...
Jan Schwinghammer, Hongseok Yang, Lars Birkedal, F...
DAGSTUHL
2001
15 years 7 months ago
Constructive Foundations for Featherweight Java
In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli...
Thomas Studer
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio