1007 search results - page 40 / 202 » The Complexity of Futile Questioning |
148
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
137
click to vote
EUROCRYPT
2005
Springer
15 years 8 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
102
click to vote
TARK
2005
Springer
15 years 8 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
125
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
110
click to vote
DAM
2008
15 years 3 months ago
2008
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...