Start Search Over

Active Search Criteria:

Displaying items 1 - 10 of 32
sorted by

1 Quasi-Polynomial Tractability

Author(s):
Gnewuch, Michael; Wozniakowski, Henryk
Date:
2010
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:10503

2 Tractability of the Fredholm problem of the second kind

Author(s):
Werschulz, Arthur G.; Wozniakowski, Henryk
Date:
2010
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:10515

3 Tractability of multivariate approximation over a weighted unanchored Sobolev space: Smoothness sometimes hurts

Author(s):
Werschulz, Arthur G.; Wozniakowski, Henryk
Date:
2008
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29572

4 Generalized Tractability for Multivariate Problems: Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability

Author(s):
Gnewuch, Michael; Wozniakowski, Henryk
Date:
2007
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29533

5 Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem

Author(s):
Papageorgiou, Anargyros; Wozniakowski, Henryk
Date:
2005
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29171

6 Tractability of Quasilinear Problems. I: General Results

Author(s):
Werschulz, Arthur G.; Wozniakowski, Henryk
Date:
2005
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29386

7 Tractability of quasilinear problems. II: Second-order elliptic problems

Author(s):
Werschulz, Arthur G.; Wozniakowski, Henryk
Date:
2005
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29416

8 Surface Approximation May Be Easier Than Surface Integration

Author(s):
Werschulz, Arthur G.; Wozniakowski, Henryk
Date:
2001
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29271

9 What is the complexity of volume calculation?

Author(s):
Werschulz, Arthur G.; Wozniakowski, Henryk
Date:
2000
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29409

10 What is the complexity of surface integration?

Author(s):
Wozniakowski, Henryk; Werschulz, Arthur G.
Date:
1999
Subject:
Computer science
Content Type:
Technical reports
Publisher:
Department of Computer Science, Columbia University
Permanent URL:
http://hdl.handle.net/10022/AC:P:29305

Powered by the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services.