2412 search results - page 345 / 483 » Which Problems Have Strongly Exponential Complexity |
97
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
153
Voted
ICCAD
2002
IEEE
15 years 11 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
126
click to vote
ECAL
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Inspired by the recent advances in evolutionary biology, we have developed a self-organising, self-adaptable cellular system for multitask learning. The main aim of our p...
134
click to vote
SENSYS
2003
ACM
15 years 7 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
117
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...