551 search results - page 71 / 111 » Natural proofs |
161
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
127
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
185
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
144
click to vote
TABLEAUX
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
175
Voted
FUN
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...