Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
Andrey Frolov, Iskander Sh. Kalimullin, Russell Mi...
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...