Sciweavers

3713 search results - page 72 / 743
» Quantum Information Theory
Sort
View
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
STACS
2009
Springer
14 years 2 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
SOFSEM
2009
Springer
14 years 6 days ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
13 years 7 months ago
On the Genus Distribution of (p, q, n)-Dipoles
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...
Terry I. Visentin, Susana W. Wieler
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
Ed Blakey