Results 1 to 10 of about 2,119,152 (235)
Computational Complexity in Electronic Structure [PDF]
, 2012 In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations.
Aaronson +80 more
core +3 more sources
Enabling decentralized wireless index coding in practice [PDF]
, 2019 Index coding is a problem in theoretical computer science and network information theory that studies the optimal coding scheme for transmitting multiple messages across a network to receivers with different side information.
Mahler, Timothy Austin
core +1 more source
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
The French Conception of Information science. "Une exception française"? [PDF]
, 2012 International audienceThe French conception of Information science is often contrasted to the Anglophone one, which is perceived as different and rooted mainly in Shannon's mathematical theory of communication.
Ibekwe-Sanjuan, Fidelia
core +4 more sources
Quantum Hamiltonian Complexity
, 2015 Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint ...
Gharibian, Sevag +3 more
core +1 more source
The asymptotic induced matching number of hypergraphs: balanced binary strings [PDF]
, 2019 We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$.
Arunachalam, Srinivasan +2 more
core +2 more sources
Around Kolmogorov complexity: basic notions and results
, 2015 Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic.
A Nies, M Li, RG Downey
core +2 more sources