| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 10
reviews
|
|
|
 |
|
|
|
|
A mathematical theory of resources
Coecke B., Fritz T., Spekkens R. Information and Computation 25059-86, 2016. Type: Article
Many of the physical sciences ultimately deal with resources. The important questions are: Can a given resource be converted into another? And if so, how? Examples abound:...
|
Apr 12 2017 |
|
|
|
|
|
|
Quadratic maps are hard to sample
Viola E. ACM Transactions on Computation Theory 8(4): 1-4, 2016. Type: Article
A quadratic map is a function of the form f (x) = ax2 + bx + c, or more generally,...
|
Jul 26 2016 |
|
|
|
|
|
|
Better answers to real questions
Košta M., Sturm T., Dolzmann A. Journal of Symbolic Computation 74(C): 255-275, 2016. Type: Article
Many scientific problems can be phrased as existential formulas over the real numbers. For example: For a fixed parameter a, are there x≥y such that x
|
Dec 18 2015 |
|
|
|
|
|
|
Real or natural number interpretation and their effect on complexity
Bonfante G., Deloup F., Henrot A. Theoretical Computer Science 585(C): 25-40, 2015. Type: Article
To prove that a program terminates, one typically finds an invariant that strictly decreases with each executed instruction. In rewriting theory, the program becomes a term, and the invariant a so-called interpretation: a function from...
|
Jul 29 2015 |
|
|
|
|
|
|
Paraconsistency properties in degree-preserving fuzzy logics
Ertola R., Esteva F., Flaminio T., Godo L., Noguera C. Soft Computing 19(3): 531-546, 2015. Type: Article
Logic, in its many shapes and forms, is indispensible when proving rigorously that any computational situation in question does or does not possess some desirable property in question. Two particular types of logic are fuzzy logic and ...
|
Apr 16 2015 |
|
|
|
|
|
|
Matrix calculus for classical and quantum circuits
De Vos A., De Baerdemacker S. ACM Journal on Emerging Technologies in Computing Systems 11(2): 1-11, 2014. Type: Article
Excepting the final measurement, quantum computations are reversible computations. Quantum computers are infamously hard to construct, but reversible computers are easy (by seminal results of Toffoli). This paper aims to rigorously est...
|
Dec 17 2014 |
|
|
|
|
|
|
Safety and liveness, weakness and strength, and the underlying topological relations
Eisner C., Fisman D., Havlicek J. ACM Transactions on Computational Logic 15(2): 1-44, 2014. Type: Article
Many temporal logics include weak and strong versions of operators: a strong one guarantees that a property eventually holds while a weak one does not. This paper characterizes which operators form a weak/strong pair, making precise th...
|
Sep 5 2014 |
|
|
|
|
|
|
On the computational complexity of membership problems for the completely positive cone and its dual
Dickinson P., Gijben L. Computational Optimization and Applications 57(2): 403-415, 2014. Type: Article
All kinds of combinatorial optimization problems can be formulated in terms of matrices with nonnegative entries, and can therefore be tackled using copositive programming. A matrix is copositive when it remains nonnegative under conju...
|
May 7 2014 |
|
|
|
|
|
|
On the density of triangles and squares in regular finite and unimodular random graphs
Harangi V. Combinatorica 33(5): 531-548, 2013. Type: Article
Graphs are the subject of many questions in combinatorics. For example, the following question by Erdös was settled only recently: How many 5-cycles can there be in a graph without 3-cycles? This paper addresses a similar prob...
|
Apr 11 2014 |
|
|
|
|
|
|
A hybrid model through the fusion of type-2 fuzzy logic systems and extreme learning machines for modelling permeability prediction
Olatunji S., Selamat A., Abdulraheem A. Information Fusion 1629-45, 2014. Type: Article
The simplest computational models in artificial intelligence are so-called single hidden-layer feed-forward neural networks. These neural networks have to be trained, but the slow learning rate of simple algorithms makes this time-cons...
|
Feb 12 2014 |
|
|
|
|
|
| |
|
|
| |
|
|
