30 search results - page 2 / 6 » Compile-time Computation of Polytime Functions |
SAT
2009
Springer
14 years 17 days ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
RTA
2009
Springer
14 years 17 days ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
RSP
1999
IEEE
13 years 10 months ago
1999
IEEE
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
CRYPTO
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
FSTTCS
2005
Springer
13 years 11 months 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...