Skip to main content
SpringerLink
Log in

Probabilities of 2-Xor Functions

  • Conference paper
LATIN 2014: Theoretical Informatics (LATIN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8392))

Included in the following conference series:

Abstract

The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses x ⊕ y, is satisfiable. We consider here a refinement of this question, namely the probability that a random expression computes a specific Boolean function. The answer involves a description of 2-Xor expressions as multigraphs, and uses classical methods of analytic combinatorics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Creignou, N., Daudé, H.: Satisfiability threshold for random XOR-CNF formulas. Discrete Applied Mathematics 96-97, 41–53 (1999)

    Article  Google Scholar 

  2. Creignou, N., Daudé, H.: Smooth and sharp thresholds for random k-XOR-CNF satisfiability. Theor. Inform. Appl. 37(2), 127–147 (2003)

    Article  MathSciNet  Google Scholar 

  3. Creignou, N., Daudé, H., Dubois, O.: Approximating the satisfiability threshold for random k-XOR-formulas. Combin. Probab. Comput. 12(2), 113–126 (2003)

    MATH  MathSciNet  Google Scholar 

  4. Creignou, N., Daudé, H.: Coarse and sharp transitions for random generalized satisfiability problems. In: Mathematics and Computer Science III. Trends Math, pp. 507–516. Birkhäuser, Basel (2004)

    Chapter  Google Scholar 

  5. Creignou, N., Daudé, H., Egly, U.: Phase transition for random quantified XOR-formulas. J. Artif. Intell. Res. 29, 1–18 (2007)

    MATH  Google Scholar 

  6. Daudé, H., Ravelomanana, V.: Random 2XorSat phase transition. Algorithmica 59(1), 48–65 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pittel, B., Yeum, J.A.: How frequently is a system of 2-linear equations solvable? Electronic Journal of Combinatorics 17 (2010)

    Google Scholar 

  8. Janson, S., Knuth, D., Luczak, T., Pittel, B.: The birth of the giant component. Random Structures and Algorithms 4(3), 233–358 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Banderier, C., Flajolet, P., Schaeffer, G., Soria, M.: Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Struct. Algorithms 19(3-4), 194–246 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  11. Bender, E.A., Canfield, E.R., McKay, B.D.: The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures and Algorithm 1, 129–169 (1990)

    Article  MathSciNet  Google Scholar 

  12. Pittel, B., Wormald, N.C.: Counting connected graphs inside-out. J. Comb. Theory, Ser. B 93(2), 127–172 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bender, E.A., Canfield, E.R., McKay, B.D.: The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Struct. Algorithms 1(2), 127–170 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sorbonne Paris Cité, LIAFA, UMR 7089, Univ. Paris Diderot, 75013, Paris, France

    Élie de Panafieu

  2. PRISM, Univ. of Versailles, France

    Danièle Gardy

  3. Institute of Discrete Mathematics and Geometry, TU Wien, Austria

    Bernhard Gittenberger & Markus Kuba

Authors
  1. Élie de Panafieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danièle Gardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernhard Gittenberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Markus Kuba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Facultad de Ingeniería, Instituto de Computación, Universidad de la República, Julio Herrera y Reissig 565, 11300, Montevideo, Uruguay

    Alberto Pardo  & Alfredo Viola  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Panafieu, É., Gardy, D., Gittenberger, B., Kuba, M. (2014). Probabilities of 2-Xor Functions. In: Pardo, A., Viola, A. (eds) LATIN 2014: Theoretical Informatics. LATIN 2014. Lecture Notes in Computer Science, vol 8392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54423-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54423-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54422-4

  • Online ISBN: 978-3-642-54423-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation