Results 1 to 10 of about 1,747,380 (192)
Automata in SageMath---Combinatorics meet Theoretical Computer Science [PDF]
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved ...
Heuberger, Clemens +2 more
core +4 more sources
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges [PDF]
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Bredereck, Robert +5 more
core +3 more sources
Eigenvectors of random matrices: A survey [PDF]
Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is random.Comment ...
O'Rourke, Sean, Vu, Van, Wang, Ke
core +3 more sources
Computational Complexity in Electronic Structure [PDF]
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
Specifying and Verifying Properties of Space - Extended Version [PDF]
The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems distributed in ...
Ciancia, Vincenzo +3 more
core +2 more sources
Quantum communication, and indeed quantum information in general, has changed the way we think about quantum physics. In 1984 and 1991, the first protocol for quantum cryptography and the first application of quantum non-locality, respectively, attracted
A Acin +90 more
core +3 more sources
On the residual solvability of generalized free products of solvable groups
In this paper, we study the residual solvability of the generalized free product of solvable groups.Comment: Discrete Mathematics & Theoretical Computer Science, Vol 13 ...
Kahrobaei, Delaram, Majewicz, Stephen
core +2 more sources
Complexity vs Energy: Theory of Computation and Theoretical Physics [PDF]
This paper is a survey dedicated to the analogy between the notions of {\it complexity} in theoretical computer science and {\it energy} in physics. This analogy is not metaphorical: I describe three precise mathematical contexts, suggested recently, in ...
Manin, Yuri I.
core +1 more source
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases.
Molinari, A., Montanari, A., Peron, A.
core +1 more source
The skewness of computer science [PDF]
Computer science is a relatively young discipline combining science, engineering, and mathematics. The main flavors of computer science research involve the theoretical development of conceptual models for the different aspects of computing and the more ...
Franceschet, Massimo
core +1 more source

