88 search results - page 11 / 18 » Reducing hard SAT instances to polynomial ones |
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
ECCC
2007
13 years 7 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Mobile WiMAX is one of the most promising technologies for broadband wireless communication. The IEEE 802.16e standard for Mobile WiMAX, the enhanced version of the IEEE 802.16 ...
TCS
2002
13 years 7 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...