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
click to vote
ACS
2008
89
views
Distributed And Parallel Com...
»
more
ACS 2008
»
A Priestley Sum of Finite Trees is Acyclic
15 years 3 months ago
Download
iti.mff.cuni.cz
We show that the Priestley sum of finite trees contains no cyclic finite poset.
Richard N. Ball, Ales Pultr, Jirí Sichler
Real-time Traffic
ACS 2008
|
Cyclic Finite Poset
|
Distributed And Parallel Computing
|
Priestley Sum
|
claim paper
Post Info
More Details (n/a)
Added
08 Dec 2010
Updated
08 Dec 2010
Type
Journal
Year
2008
Where
ACS
Authors
Richard N. Ball, Ales Pultr, Jirí Sichler
Comments
(0)
Researcher Info
Distributed And Parallel Computing Study Group
Computer Vision