Browsing by Subject "Boolean circuits"

Sort by: Order: Results:

  • Connectivity of Boolean satisfiability 
    Schwerdtfeger, Konrad W. (Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2016)
    [no abstract]
  • Descriptive complexity of circuit-based counting classes 
    Haak, Anselm (Hannover : Institutionelles Repositorium der Leibniz Universität Hannover, 2021)
    In this thesis, we study the descriptive complexity of counting classes based on Boolean circuits. In descriptive complexity, the complexity of problems is studied in terms of logics required to describe them. The focus ...