Sciweavers

1322 search results - page 209 / 265
» Unsound Theorem Proving
Sort
View
ACS
2007
13 years 9 months ago
Components of the Fundamental Category II
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...
Eric Goubault, Emmanuel Haucourt
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CPC
2007
105views more  CPC 2007»
13 years 8 months ago
Packing Cliques in Graphs with Independence Number 2
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
Raphael Yuster
IM
2007
13 years 8 months ago
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as In-Degree values. This ...
Nelly Litvak, Werner R. W. Scheinhardt, Yana Volko...
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck