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
72
click to vote
CIE
2005
Springer
73
views
Applied Computing
»
more
CIE 2005
»
Symmetric Enumeration Reducibility
15 years 8 months ago
Download
www.amsta.leeds.ac.uk
Charles M. Harris
Real-time Traffic
CIE 2005
|
claim paper
Related Content
»
A Schur function identity related to the 1enumeration of selfcomplementary plane partition...
»
Combinatorial method in the coset enumeration of symmetrically generated groups
»
Enumeration of balanced symmetric functions over GFp
»
HallLittlewood polynomials and fixed point enumeration
»
The settlingtime reducibility ordering
»
Computably Enumerable Sets and QuasiReducibility
»
The number of equivalence classes of symmetric sign patterns
»
A set theoretic framework for enumerating matches in surveys and its application to reduci...
»
Enumeration Reducibility with Polynomial Time Bounds
more »
Post Info
More Details (n/a)
Added
26 Jun 2010
Updated
26 Jun 2010
Type
Conference
Year
2005
Where
CIE
Authors
Charles M. Harris
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision