On computing Boolean connectives of characteristic functions

DOI10.1007/BF01303054MaRDI QIDQ4835862zbMATH OpenOpenAlexWikidataFDO

Authors Richard Chang, Jim Kadin

Publication date 8 June 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01303054

zbMATH Keywords

Boolean hierarchyNP complete setsquery hierarchies

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Numerical computation of characteristic polynomials of Boolean functions and its applications
• Approximate evaluations of characteristic polynomials of Boolean functions
• On connected Boolean functions
• Characterizing Negabent Boolean Functions over Finite Fields
• The complexity of Boolean functions in different characteristics
• Character analogue of the Boole summation formula with applications
• Characteristic polynomials and spectra of Boolean graphs
• Equational characterizations of Boolean function classes
• On the multiplicative complexity of some Boolean functions
• A combinatorial characterization of Boolean algebras

Cites work

• scientific article; zbMATH DE number 4033067 (Why is no real title available?)
• scientific article; zbMATH DE number 17529 (Why is no real title available?)
• A comparison of polynomial time reducibilities
• Bounded queries to SAT and the Boolean hierarchy
• Graph isomorphism is in the low hierarchy
• On unique satisfiability and the threshold behavior of randomized reductions
• Polynomial terse sets
• Some connections between bounded query classes and non-uniform complexity.
• The Boolean Hierarchy I: Structural Properties
• The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
• The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
• The complexity of facets (and some facets of complexity)
• The complexity of optimization problems
• The difference and truth-table hierarchies for NP
• The strong exponential hierarchy collapses
• \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP

Cited in

(25)

• Characterization of Boolean valued star and mega lattice functions
• The computational complexity of ideal semantics
• Numerical computation of characteristic polynomials of Boolean functions and its applications
• A relationship between difference hierarchies and relativized polynomial hierarchies
• Lower bounds for kernelizations and other preprocessing procedures
• Lower bounds for kernelizations and other preprocessing procedures
• scientific article; zbMATH DE number 493087 (Why is no real title available?)
• Complexity of Stability.
• Completeness results for graph isomorphism.
• Parameterized random complexity
• Intersection suffices for Boolean hierarchy equivalence
• Commutative queries
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Trading properties and Alexandrov kernels for Boolean functions
• Characterizing Negabent Boolean Functions over Finite Fields
• Character analogue of the Boole summation formula with applications
• Bounded queries, approximations, and the Boolean hierarchy
• Approximate evaluations of characteristic polynomials of Boolean functions
• The 1-versus-2 queries problem revisited
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
• Complexity of stability
• The 1-Versus-2 Queries Problem Revisited
• Characteristics of multiple viewpoints in abstract argumentation
• Two queries
• Relativized logspace and generalized quantifiers over finite ordered structures

This page was built for publication: On computing Boolean connectives of characteristic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835862)