Sciweavers

2446 search results - page 360 / 490
» Choiceless Polynomial Time
Sort
View
JALC
2006
133views more  JALC 2006»
13 years 7 months ago
Power and Efficiency of Minimal Parallelism in Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
Tseren-Onolt Ishdorj
JAR
2006
97views more  JAR 2006»
13 years 7 months ago
Decidability Issues for Extended Ping-Pong Protocols
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
Hans Hüttel, Jirí Srba
DAM
2007
88views more  DAM 2007»
13 years 7 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
JGT
2006
60views more  JGT 2006»
13 years 7 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
JSAT
2006
92views more  JSAT 2006»
13 years 7 months ago
A Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel