2446 search results - page 75 / 490 » Choiceless Polynomial Time |
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
DNA
2006
Springer
13 years 11 months ago
2006
Springer
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
DCFS
2011
12 years 7 months ago
2011
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
PKC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...