107 search results - page 17 / 22 » Polynomially Bounded Matrix Interpretations |
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...
FSTTCS
2005
Springer
14 years 7 days ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
VMCAI
2005
Springer
14 years 5 days ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
CP
1997
Springer
13 years 11 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...