Homepage
  • english
  • česky

Přihlášení

Přihlaste se účtem své organizace prostřednictvím eduID.

  • Publications
  • Institute
    • About us
    • Organigram
    • Management
    • Advisory Board
    • Annual reports and budgets
    • Information by 106/1999 Coll.
    • Whistleblowing
    • Exhibition of comp. technology
    • Privacy Policy
  • Research
    • Projects
    • Research subject
    • Awards
    • Best Publication Competition
    • Popularization
  • News
  • Applications
    • Transfer department
    • Applied Informatics
    • Competencies
    • References
  • Events
  • Library
    • About Library
    • Scientific Sources
    • Publications
    • Petr Hájek Library
  • Jobs
    • Job Offers
    • Topics for PhD studies
    • Radius Internships
  • Contacts
  • Departments
  • People
Homepage

Přihlášení

Přihlaste se účtem své organizace prostřednictvím eduID.

english česky
  • Publications
  • Institute
    • About us
    • Organigram
    • Management
    • Advisory Board
    • Annual reports and budgets
    • Information by 106/1999 Coll.
    • Whistleblowing
    • Exhibition of comp. technology
    • Privacy Policy
  • Research
    • Projects
    • Research subject
    • Awards
    • Best Publication Competition
    • Popularization
  • News
  • Applications
    • Transfer department
    • Applied Informatics
    • Competencies
    • References
  • Events
  • Library
    • About Library
    • Scientific Sources
    • Publications
    • Petr Hájek Library
  • Jobs
    • Job Offers
    • Topics for PhD studies
    • Radius Internships
  • Contacts
  • Departments
  • People
  1. Home /
  2. Research /
  3. Projects /
  4. Institute for Theoretical Computer Science

Institute for Theoretical Computer Science

Období: 2005 — 2011
Poskytovatel: GA MŠk
Financování: 1M

Publikace projektu

  • randtoolbox: Toolbox for Pseudo and Quasi Random Number Generation (2009)
  • Neuronové sítě jako modely analogových výpočtů (2006)
  • On the NP-Completeness of Some Graph Cluster Measures (2005)
  • Feasible Disjunction Property and Feasible Interpolation in Modal Logic (2007)
  • An Explicit Polynomial Size Hitting Set for Restricted 1-Branching Programs Width 3 (2005)
  • A Characterization of Hitting Sets for 1-Branching Programs of Width 3 (Revised Version) (2009)
  • A Characterization of Hitting Sets for 1 Branching Programs of Width 3 (2008)
  • Representation of Continuous Archimedean Radial Fuzzy Systems (2004)
  • Boolean Functions with a Simple Certificate for CNF Complexity. (2010)
  • Residuated Logics based on Strict Triangular Norms with an Involutive Negation (2006)
  • On Product Logic with Truth-Constants (2006)
  • Computational Complexity of t-norm based Propositional Fuzzy Logics with Rational Truth Constants (2006)
  • Formal Systems of Fuzzy Logic and their Fragments (2007)