-
1
Dominance: consistently comparing computational complexity
Published 2008Subjects: “…Computer science (mathematics)…”
Report -
2
An analogue solution to the problem of factorization
Published 2007Subjects: “…Computer science (mathematics)…”
Report -
3
Numerical algorithms based on analytic function values at roots of unity
Published 2013“…These questions exhibit in the purest form certain algorithmic issues that arise across computational science in areas including integral equations, partial differential equations, and large-scale linear algebra. …”
Report -
4
The Complexity of Constraint Satisfaction: An Algebraic Approach
Published 2004“…Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. …”
Report -
5
The Expressive Power of Binary Submodular Functions
Published 2008“…This problem has been considered within several different contexts in computer science, including computer vision, artificial intelligence, and pseudo-Boolean optimisation. …”
Report -
6
Big Toy Models: Representing Physical Systems As Chu Spaces
Published 2009“…This approach has often been fruitful in Logic and Theoretical Computer Science. Rather than seeking to construct a simplified toy model, we aim for a 'big toy model', in which both quantum and classical systems can be faithfully representedandemdash;as well as, possibly, more exotic kinds of systems. …”
Report -
7
Social, ethical, and legal issues in presence research and applications: EC report for Peach FP6 Coordination Action
Published 2009“…Powered by recent advances in disciplines like neuroscience, cognitive science, computer science and psychology, Presence technologies are therefore bound to change the world as we experience it.…”
Report -
8
-
9
-
10
-
11
-
12
-
13
-
14
-
15
-
16
Xs are for Trajectory Evaluation‚ Booleans are for Theorem Proving (Extended Version)
Published 2000Report -
17
-
18
-
19
-
20