159 search results - page 25 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
SIAMCOMP
2010
14 years 8 months ago
2010
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
CONCUR
2004
Springer
15 years 2 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
105
Voted
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...