Princeton University
|
Princeton Engineering
Academics
Course Schedule
Course Catalog
Graduate Program
Undergraduate Programs
Interdisciplinary Programs
Research
Research Areas
Research Projects
Public Lectures and Colloquia
Technical Reports
People
Faculty
Researchers
Technical Staff
Administrative Staff
Graduate Students
Undergraduate Students
Alumni/ae
Connect
Collaborations
Industrial Affiliates
Libraries
Jobs
About
Contact Us
News and Events
Department Information
Visit Us
Home
::
Research
::
Technical Reports
::
Karpinski, Marek
Technical Reports
Display by Author:
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
M
|
N
|
O
|
P
|
Q
|
R
|
S
|
T
| U |
V
|
W
|
X
|
Y
|
Z
Search by
Report Title
Author
Year
TR Number
for:
6 matches found for
Karpinski, Marek
:
Karpinski, Marek
Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks
, TR-526-96, October 1996
A Lower Bound for Randomized Algebraic Decision Trees
, TR-527-96, October 1996
On the Power of Randomized Branching Programs
, TR-531-96, October 1996
Randomized Omega (n^2) Lower Bound for Knapsack
, TR-538-96, December 1996
Correctness of Constructing Optimal Alphabetic Trees Revisited
, TR-539-96, December 1996
Approximating Dense Cases of Covering Problems
, TR-542-97, December 1996