135 search results - page 7 / 27 » Fixed-Point Definability and Polynomial Time |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We study the learning models defined in [AKST97]: Learning with equivalence and limited membership queries and learning with equivalence and malicious membership queries. We show ...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
CAISE
2008
Springer
13 years 9 months ago
2008
Springer
Web service business protocols are of importance to both clients and providers, as they model the external behaviour of services. However, the business protocol is not always publ...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...