Sciweavers

2145 search results - page 426 / 429
» Lax Logical Relations
Sort
View
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
IPL
2007
105views more  IPL 2007»
13 years 7 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
IPM
2007
156views more  IPM 2007»
13 years 7 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...
TIT
2008
140views more  TIT 2008»
13 years 7 months ago
A Resource Framework for Quantum Shannon Theory
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...
Igor Devetak, Aram Wettroth Harrow, Andreas J. Win...