Sciweavers

5608 search results - page 66 / 1122
» On the Theory of Matchgate Computations
Sort
View
SSS
2010
Springer
118views Control Systems» more  SSS 2010»
14 years 12 months ago
Modeling and Analyzing Periodic Distributed Computations
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
Anurag Agarwal, Vijay K. Garg, Vinit A. Ogale
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 1 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
NC
2011
201views Neural Networks» more  NC 2011»
14 years 8 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
EATCS
2002
46views more  EATCS 2002»
15 years 1 months ago
Understanding the Mulmuley-Sohoni Approach to P vs. NP
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
Kenneth W. Regan
FCS
2006
15 years 2 months ago
The Church-Turing-Deutsch Principle in Quantum Computation
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...
P. Prashant