1007 search results - page 38 / 202 » The Complexity of Futile Questioning |
TAMC
2010
Springer
14 years 2 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
NETWORK
2008
13 years 9 months ago
2008
One of the most compelling social questions, which until now was left unanswered by current technology, is "Who's that?" This question is usually asked about a new ...
SIGIR
2012
ACM
12 years 3 days ago
2012
ACM
Media studies concerns the study of production, content, and/or reception of various types of media. Today’s continuous production and storage of media is changing the way media...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...