[Lecture Notes in Computer Science] STACS 2004 Volume 2996 || The Complexity of Satisfiability Problems over Finite Lattices
β Scribed by Diekert, Volker; Habib, Michel
- Book ID
- 118062935
- Publisher
- Springer Berlin Heidelberg
- Year
- 2004
- Weight
- 212 KB
- Category
- Article
- ISBN
- 3540247491
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This Book Constitutes The Refereed Proceedings Of The 31st International Symposium On Mathematical Foundations Of Computer Science, Mfcs 2006. The Book Presents 62 Revised Full Papers Together With The Full Papers Or Abstracts Of 7 Invited Talks. All Current Aspects In Theoretical Computer Science A
The Refereed Post-proceedings Of The International Conference On Computational Intelligence And Security Are Presented In This Volume. The 116 Papers Were Submitted To Two Rounds Of Careful Review. Papers Cover Bio-inspired Computing, Evolutionary Computation, Learning Systems And Multi-agents, Cryp
The 13th International Conference On Implementation And Application Of - Tomata (ciaa 2008) Was Held At San Francisco State University, San Francisco, July 21β24, 2008. This Volume Of Lecture Notes In Computer Science Contains The Papers That Were Presented At Ciaa 2008, As Well As The Abstracts Of