Sciweavers

551 search results - page 85 / 111
» Natural proofs
Sort
View
BIRTHDAY
2008
Springer
13 years 10 months ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 10 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
AAAI
2006
13 years 10 months ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
GRAPHICSINTERFACE
2004
13 years 10 months ago
Remote Collaboration Using Augmented Reality Videoconferencing
This paper describes an Augmented Reality (AR) Videoconferencing System, which is a novel remote collaboration tool combining a desktop-based AR system and a videoconference modul...
István Barakonyi, Tamer Fahmy, Dieter Schma...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 8 months ago
Complexity dichotomy on partial grid recognition
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Vinícius G. P. de Sá, Guilherme Dias...