182 search results - page 4 / 37 » A Theory of Strict P-completeness |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
CATS
2007
13 years 9 months ago
2007
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
ICDT
2011
ACM
12 years 11 months ago
2011
ACM
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
JUCS
2000
13 years 7 months ago
2000
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...