2214 search results - page 91 / 443 » Complexity of Reasoning |
120
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
132
click to vote
LACL
2005
Springer
15 years 8 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
114
click to vote
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
127
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
137
click to vote
ISMB
1993
15 years 4 months ago
1993
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...