Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
114
Voted
DM
2002
84
views
more
DM 2002
»
On the refined lecture hall theorem
15 years 2 months ago
Download
www.math.psu.edu
Abstract. A lecture hall partition of length n is a sequence (1, 2, . . . , n) of nonnegative integers satisfying 0 1/1
Ae Ja Yee
Real-time Traffic
DM 2002
|
Hall Partitions
|
Lecture Hall Partition
|
Nonnegative Integers
|
claim paper
Related Content
»
An IsabelleBased Theorem Prover for VDMSL
more »
Post Info
More Details (n/a)
Added
18 Dec 2010
Updated
18 Dec 2010
Type
Journal
Year
2002
Where
DM
Authors
Ae Ja Yee
Comments
(0)
Researcher Info
DM 1998 Study Group
Computer Vision