1772 search results - page 219 / 355 » Classifying Problems into Complexity Classes |
125
click to vote
SOFSEM
2000
Springer
15 years 4 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
CJTCS
1999
15 years 12 days ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
90
Voted
BMCBI
2006
15 years 23 days ago
2006
Background: The number and the arrangement of subunits that form a protein are referred to as quaternary structure. Quaternary structure is an important protein attribute that is ...
121
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
118
click to vote
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...