MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Jonas Holmerin" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

ATOM

Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate within 2-ε
by Jonas Holmerin — 2001 — In Proceedings of the 34th Annual ACM Symposium on Theory of Computing
…Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within 2 Jonas Holmerin Royal…
Cited by 11 (3 self) – Add To MetaCart

Clique Is Hard To Approximate Within ...
by Lars Engebretsen, Jonas Holmerin — 2000 — In Automata, languages and programming (Geneva
…Clique Is Hard To Approximate Within n 1−o(1) Lars Engebretsen and Jonas Holmerin Royal Institute…
Add To MetaCart

Improved Approximation Hardness of Maximum CSP
by Lars Engebretsen, Lars Engebretsen, Lars Engebretsen, Jonas Holmerin, Jonas Holmerin, Jonas Holmerin — 2005 — In Proceedings of the 22th Symposium on Theoretical Aspects of Computer Science
… and Improved Approximation Hardness of Maximum CSP Lars Engebretsen Jonas Holmerin TRITA-NA-0409 Lars…
Add To MetaCart

On Probabilistic Proof Systems and Hardness of Approximation
by Jonas Holmerin, Kollegiesalen Valhallavgen — 2002
…On Probabilistic Proof Systems and Hardness of Approximation Jonas Holmerin Stockholm 2002 Doctoral…
Cited by 1 (0 self) – Add To MetaCart

Clique Is Hard To Approximate Within n 1-o(1)
by Lars Engebretsen, Jonas Holmerin — 2000 — In Automata, languages and programming (Geneva
…Clique Is Hard To Approximate Within n 1 o(1) Lars Engebretsen and Jonas Holmerin Royal Institute…
Cited by 10 (2 self) – Add To MetaCart

Towards Optimal Lower Bounds For Clique and Chromatic Number
by Lars Engebretsen, Jonas Holmerin
… Holmerin 2 1 MIT Laboratory for Computer Science 200 Technology Square, NE43-369 Cambridge, Massachusetts…
Cited by 10 (1 self) – Add To MetaCart

Data Field Haskell
by Jonas Holmerin, Björn Lisper — 1999
…Data Field Haskell Jonas Holmerin 1 and Bjorn Lisper 2 1 Department of Numerical Analysis…
Cited by 2 (1 self) – Add To MetaCart

Development of Parallel Algorithms in Data Field Haskell
by Jonas Holmerin, Bjorn Lisper — 2000 — Proc. Euro-Par 2000, volume 1900 of Lecture Notes in Comput. Sci
…Development of Parallel Algorithms in Data Field Haskell ? Jonas Holmerin 1 and Bjorn Lisper 2…
Cited by 1 (1 self) – Add To MetaCart

Development and Verification of Parallel Algorithms in the Data Field Model
by Björn Lisper, Jonas Holmerin — 2000 — Proc. 2nd Int. Workshop on Constructive Methods for Parallel Programming
… and Jonas Holmerin 2 1 Dept. of Computer Engineering, Malardalen University, P.O. Box 883, S-721 23…
Cited by 1 (1 self) – Add To MetaCart

Three-Query PCPs with Perfect Completeness over non-Boolean Domains
by Lars Engebretsen, Jonas Holmerin — 2002 — In Proceedings of the 18th IEEE Conference on Computational Complexity
… Holmerin Department of Numerical Analysis and Computer Science Royal Institute of Technology SE-100 44…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB