612 search results - page 11 / 123 » Hardness assumptions in the foundations of theoretical compu... |
TCS
2011
13 years 2 months ago
2011
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
IJCINI
2007
13 years 7 months ago
2007
: Cognitive informatics (CI) studies the natural intelligence and internal information processing mechanisms of the brain, as well as the processes involved in perception and cogni...
RANDOM
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...