Sciweavers

20 search results - page 3 / 4
» Theoretical and Computational Properties of Preference-based...
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
COMPLEX
2009
Springer
13 years 5 months ago
Temperature-Induced Domain Shrinking in Ising Ferromagnets Frustrated by a Long-Range Interaction
Abstract. We investigate a spin model in which a ferromagnetic shortrange interaction competes with a long-range antiferromagnetic interaction decaying spatially as 1 rd+ , d being...
Alessandro Vindigni, Oliver Portmann, Niculin Sara...
CSR
2007
Springer
14 years 1 months ago
Proving Church's Thesis
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
Yuri Gurevich
ICALP
2009
Springer
14 years 7 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
RANDOM
2001
Springer
13 years 11 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...