Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

62

Voted

TCS
2008

155views Theoretical Computer Science» more TCS 2008»

The complexity of Tarski's fixed point theorem

15 years 2 months ago

The complexity of Tarski's fixed point theorem

Download www.csie.ntu.edu.tw

Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti

Real-time Traffic

TCS 2008 | Theoretical Computer Science |

claim paper

Related Content

» FixedPoint Definability and Polynomial Time

» FixedPoint Definability and Polynomial Time on Chordal Graphs and Line Graphs

» The intensional content of Rices theorem

» Magic Functions A Technique to Optimize Extended Datalog Recursive Programs

» A statistical mechanical interpretation of algorithmic information theory

» A Classification of Viruses Through Recursion Theorems

» Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents

» Verifying Topological Indices for HigherOrder Rank Deficiencies

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TCS
Authors	Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti

Comments (0)