2-Xor Revisited: Satisfiability and Probabilities of Functions
- 11 February 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 76 (4) , 1035-1076
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- OeAD-GmbH (F01/2015)
- ANR Boole
- ANR Boole
- PHC Amadeus
- PHC Amadeus
- Austrian Science Fund (F5004)
- Austrian Science Fund (F5003-N15)
- ANR Magnum
- PEPS HYDrATA
- OeAD-GmbH (F01/2015)
This publication has 28 references indexed in Scilit:
- The growing tree distribution on Boolean functions.2011
- The Boolean functions computed by random Boolean formulas or how to grow the right functionRandom Structures & Algorithms, 2005
- Coarse and Sharp Transitions for Random Generalized Satisfyability Problems2004
- And/Or Trees RevisitedCombinatorics, Probability and Computing, 2004
- Smooth and sharp thresholds for random{k}-XOR-CNF satisfiabilityRAIRO - Theoretical Informatics and Applications, 2003
- Approximating the Satisfiability Threshold for Random k-XOR-formulasCombinatorics, Probability and Computing, 2003
- Random maps, coalescing saddles, singularity analysis, and Airy phenomenaRandom Structures & Algorithms, 2001
- Satisfiability threshold for random XOR-CNF formulasDiscrete Applied Mathematics, 1999
- The asymptotic number of labeled connected graphs with a given number of vertices and edgesRandom Structures & Algorithms, 1990
- Advanced Combinatorics1974