612 search results - page 103 / 123 » Hardness assumptions in the foundations of theoretical compu... |
TLCA
1997
Springer
13 years 12 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
DIS
2006
Springer
13 years 9 months ago
2006
Springer
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
JAIR
2011
12 years 10 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...