3825 search results - page 187 / 765 » The Language of Time: A Reader |
180
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
144
click to vote
LCPC
2005
Springer
15 years 12 months ago
2005
Springer
Programming network processors remains a challenging task since their birth until recently when high-level programming environments for them are emerging. By employing domain speci...
189
click to vote
COMPSAC
2002
IEEE
15 years 11 months ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
146
click to vote
INDIASE
2009
ACM
15 years 11 months ago
2009
ACM
We present an approach to automating some of the quality assurance review of software requirements documents, and promoting best practices for requirements documentation. The syst...
165
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...