Boolean functional synthesis: hardness and practical algorithms (Q2050108): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10703-020-00352-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3093494889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Parallel Boolean Functional Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Boolean unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5802117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in Boolean rings and Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exponential Time Hypothesis and the Parameterized Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable negation normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric solutions of Boolean equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: BDD-Based Boolean Functional Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifier Elimination via Functional Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean unification - the story so far / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Determinization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding and extending incremental determinization for 2QBF / rank
 
Normal rank

Latest revision as of 11:45, 26 July 2024

scientific article
Language Label Description Also known as
English
Boolean functional synthesis: hardness and practical algorithms
scientific article

    Statements

    Boolean functional synthesis: hardness and practical algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 August 2021
    0 references
    Boolean functional synthesis
    0 references
    Skolem functions
    0 references
    expansion-based algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers