128 search results - page 8 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
STOC
2010
ACM
14 years 8 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
ICIC
2007
Springer
14 years 1 months ago
2007
Springer
Humans can easily recognize complex objects even if values of their attributes are imprecise and often inconsistent. It is not clear how the brain processes uncertain visual inform...
AI
2008
Springer
13 years 6 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...