Projective DNF Formulae and Their Revision

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-45167-9_45
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Projective Representations of $S_n$: Ring Structure and Inductive Formulae

Banach Center Publications
1990English

Polynomial Rings and Their Projective Modules

Nagoya Mathematical Journal
Mathematics
1989English

Index Formulae for Stark Units and Their Solutions

Pacific Journal of Mathematics
Mathematics
2013English

Recurrence Formulae on Cone Extreme Points and Their Applications to Dynamic Programming

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1979English

The Complexity of DNF of Parities

2016English

Learnability of DNF With Representation-Specific Queries

2013English

Disjoint DNF Tautologies With Conflict Bound Two

Journal on Satisfiability, Boolean Modeling and Computation
2007English

The Minimum Equivalent DNF Problem and Shortest Implicants

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2001English

Multiplication Formulae for theE-functions Regarded as Functions of Their Parameters

Pacific Journal of Mathematics
Mathematics
1959English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy