484 search results - page 16 / 97 » Computing Hilbert Class Polynomials |
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...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...