1888 search results - page 188 / 378 » Proof theory and computational analysis |
88
Voted
FOCS
2009
IEEE
15 years 7 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...
97
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
113
Voted
TPHOL
2007
IEEE
15 years 7 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
100
click to vote
DRM
2007
Springer
15 years 7 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
106
Voted
ATAL
2000
Springer
15 years 5 months ago
2000
Springer
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...