期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
The Min Label s-t Cut problem is a fundamental problem in combinatorial optimization. This problem comes from many applications in real world, for exa......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
This paper investigates the model of probabilistic program with delays (PPD) that consists of a few program blocks. Performing each block has an addit......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
Cell-like P systems with symport/antiport rules are computing models inspired by the conservation law, in the sense that they compute by changing the ......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
The Deutsch-Jozsa algorithm is essentially faster than any possible deterministic classical algorithm for solving a promise problem that is in fact a ......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
The PQ-tree is a fundamental data structure that has also been used in comparative genomics to model ancestral genomes with some uncertainty. To quant......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
Fuzzy extractors derive strong keys from noisy sources. Their security is usually defined information-theoretically, with gaps between known negative ......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
We define and explore a notion of unique prime factorization for constraint functions, and use this as a new tool to prove a complexity classification......
期刊： INFORMATION AND COMPUTATION, 2020; 275 ()
In a casino where arbitrarily small bets are admissible, any betting strategy M can be modified into a saving strategy that, not only is successful on......
期刊： INFORMATION AND COMPUTATION, 2020; 271 ()
Functional decomposition is the process of resolving a functional relationship into its constituent parts in such a way that the original function can......
期刊： INFORMATION AND COMPUTATION, 2020; 271 ()
Given an n x n sparse symmetric matrix with m nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values, so called fil......
期刊： INFORMATION AND COMPUTATION, 2020; 271 ()
Suppose that the outcomes of a roulette table are not entirely random, in the sense that there exists a successful betting strategy. Is there a succes......
期刊： INFORMATION AND COMPUTATION, 2019; 264 ()
For any n >= 3 and q >= 3, we prove that the EQUALITY function (=(n)) on n variables over a domain of size q cannot be realized by matchgates un......
期刊： INFORMATION AND COMPUTATION, 2019; 266 ()
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity par......
期刊： INFORMATION AND COMPUTATION, 2019; 267 ()
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC(0). Among others, we derive su......
期刊： INFORMATION AND COMPUTATION, 2019; 268 ()
Checking whether a pushdown automaton is simulated - in the sense of a simulation pre-order - by a finite-state automaton is EXPTIME-complete. This pa......
