14704 search results - page 2588 / 2941 » computing 2007 |
131
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
135
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
124
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
123
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
164
click to vote
CONCUR
2007
Springer
15 years 11 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...