Sciweavers

77 search results - page 16 / 16
» Configurable variable length code with genetic algorithms
Sort
View
POPL
2009
ACM
14 years 5 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 5 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur