983 search results - page 96 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
111
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
115
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
114
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
142
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
126
click to vote
VDA
2010
15 years 5 months ago
2010
This paper presents the concept of Monotone Boolean Function Visual Analytics (MBFVA) and its application to the medical domain. The medical application is concerned with discover...