706 search results - page 106 / 142 » On a quasi-ordering on Boolean functions |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
ICDT
2003
ACM
14 years 28 days ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
TACAS
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
IWSSD
2000
IEEE
14 years 3 days ago
2000
IEEE
This paper reports on a preliminary investigation into applying work on graphic animation of behavioral models to an air traffic control case study – the National Air Traffic Se...
COCO
2000
Springer
14 years 1 days ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...