1101 search results - page 182 / 221 » Forcing in proof theory |
163
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
182
click to vote
FSE
2006
Springer
15 years 10 months ago
2006
Springer
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large ...
162
click to vote
TPHOL
2000
IEEE
15 years 10 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
168
click to vote
DLS
2008
15 years 8 months ago
2008
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
218
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...