4940 search results - page 9 / 988 » On the Complexity of Universal Programs |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
ICSE
2004
IEEE-ACM
14 years 7 months ago
2004
IEEE-ACM
Financial companies, engineering firms and even scientists create increasingly larger spreadsheets and spreadsheet programs. The creators of large spreadsheets make errors and mus...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...