Research Interests:
Research Interests:
Research Interests:
Research Interests:
... The following lectures covered reductions (1 h), in-troduction to complexity (1 h), Turing machines and unde-cidability (2 h), Cook-Levin theorem (1 h), NP ... In both courses we used the AlViE system [1] to present the visualizations... more
... The following lectures covered reductions (1 h), in-troduction to complexity (1 h), Turing machines and unde-cidability (2 h), Cook-Levin theorem (1 h), NP ... In both courses we used the AlViE system [1] to present the visualizations of two reductions in the following way. ...
KTH har sedan 2005 arbetat med det automatiserade och webbaserade rättningssystemet Kattis som stöd vid undervisning på programmeringskurser. Detta verktyg möjliggör en ny metodik kring laborationer: testdriven utbildning. Vi har sett... more
KTH har sedan 2005 arbetat med det automatiserade och webbaserade rättningssystemet Kattis som stöd vid undervisning på programmeringskurser. Detta verktyg möjliggör en ny metodik kring laborationer: testdriven utbildning. Vi har sett stora pedagogiska fördelar med ...
Research Interests:
Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. Therefore, unless P=NP, these problems do not admit any polynomial... more
Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. Therefore, unless P=NP, these problems do not admit any polynomial time approximation scheme on input graphs of degree bounded by three.
Research Interests:
Research Interests: Artificial Intelligence, Machine Learning, Computational Complexity, Combinatorial Optimization, Operations Research, and 14 moreMotor Learning, Pattern Recognition, Theoretical Computer Science, Neural Network, Discriminant Analysis, Mathematical Sciences, Approximation, Linear System, Linear Systems, Waste minimisation, Boolean Satisfiability, Perceptron, Classifier, and Minimization
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
ELSEVIER Information Processing Letters 49 (1994) 309318 Information Processing Letters Maximum bounded Hmatching is MAX SNPcomplete Viggo Kann Department of Numerical Analysis and Computing Science, The Royal Institute of Technology,... more
ELSEVIER Information Processing Letters 49 (1994) 309318 Information Processing Letters Maximum bounded Hmatching is MAX SNPcomplete Viggo Kann Department of Numerical Analysis and Computing Science, The Royal Institute of Technology, S100 44 Stockholm, Sweden ( ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Abstract. We consider the combinatorial problem MAXFLS which consists, given a system of linear relations, of finding a maximum feasi-ble subsystem, that is a solution satisfying as many relations as possible. The approximability of this... more
Abstract. We consider the combinatorial problem MAXFLS which consists, given a system of linear relations, of finding a maximum feasi-ble subsystem, that is a solution satisfying as many relations as possible. The approximability of this general problem is investigated for the ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
... by Johan Carlberger , Viggo Kann. Proc. 4:th conference of the International Quantitative Linguistics Association (Qualico-2000. Add To MetaCart. ...
Research Interests:
Research Interests:
Skip to main content. CERN Logo CERN Document Server. Related links. CDS; Indico; Library; Bulletin; EDMS. Main navigation links: Search; Submit; Help; Your CDS: Your Alerts; Your Baskets; Your Searches. login. Home > Articles ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
... Download: http://www.cs.helsinki.fi/njc/njc1_papers/number3/ CACHED: Download as a PDF. by Viggo Kann. Add To MetaCart. ... BibTeX | Add To MetaCart. @MISC{Kann_nordicjournal, author = {Viggo Kann}, title = {Nordic Journal of... more
... Download: http://www.cs.helsinki.fi/njc/njc1_papers/number3/ CACHED: Download as a PDF. by Viggo Kann. Add To MetaCart. ... BibTeX | Add To MetaCart. @MISC{Kann_nordicjournal, author = {Viggo Kann}, title = {Nordic Journal of Computing 1(1994), 317331. ...