1450 search results - page 18 / 290 » On the Complexity of Hardness Amplification |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
RTSS
2003
IEEE
14 years 28 days ago
2003
IEEE
Real-time systems are growing in complexity and realtime and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing ne...
FPL
2007
Springer
14 years 1 months ago
2007
Springer
Modern platform FPGAs integrate fine-grained reconfigurable logic with processor cores and allow the creation of complete configurable systems-on-chip. However, design methodol...
FUN
2007
Springer
14 years 1 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...