Hochschulschrift
Conjunctive queries, arithmetic circuits and counting complexity
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
31 cm
- Umfang
-
XI,221 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Paderborn, Univ., Diss., 2013 (Nicht für den Austausch)
- Urheber
-
Mengel, Stefan
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
- 11.06.2025, 14:30 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek.
Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Mengel, Stefan
Ähnliche Objekte (12)
Conjunctive queries, arithmetic circuits and counting complexity
Learning with Small Data: Subgraph Counting Queries
Highly Automated Formal Verification of Arithmetic Circuits
Counting Salem Numbers of Arithmetic Hyperbolic 3-Orbifolds
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Exploiting d-DNNFs for Repetitive Counting Queries on Feature Models
Counting and configurations : problems in combintorics, arithmetic, and geometry
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Counting, sampling and integrating: algorithms and complexity
Descriptive complexity of circuit-based counting classes
On the Enumeration Complexity of Unions of Conjunctive Queries
Conjunctive queries, arithmetic circuits and counting complexity
Learning with Small Data: Subgraph Counting Queries
Highly Automated Formal Verification of Arithmetic Circuits
Counting Salem Numbers of Arithmetic Hyperbolic 3-Orbifolds
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Exploiting d-DNNFs for Repetitive Counting Queries on Feature Models
Counting and configurations : problems in combintorics, arithmetic, and geometry
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Counting, sampling and integrating: algorithms and complexity
Descriptive complexity of circuit-based counting classes
On the Enumeration Complexity of Unions of Conjunctive Queries
Conjunctive queries, arithmetic circuits and counting complexity
Learning with Small Data: Subgraph Counting Queries
Highly Automated Formal Verification of Arithmetic Circuits
Counting Salem Numbers of Arithmetic Hyperbolic 3-Orbifolds
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Exploiting d-DNNFs for Repetitive Counting Queries on Feature Models
Counting and configurations : problems in combintorics, arithmetic, and geometry
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Counting, sampling and integrating: algorithms and complexity
Descriptive complexity of circuit-based counting classes