4. Computer Science
  5. Discrete Mathematics

Nadia Creignou

Computer Science – Discrete Mathematics

Scientist

Rate now
  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientist

Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Complexity Classifications for Propositional Abduction in Post's Framework

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Phase Transition for Random Quantified XOR-Formulas

Computer Science – Artificial Intelligence
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The threshold for random (1,2)-QSAT

Computer Science – Discrete Mathematics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Nadia Creignou does not yet have a rating. At this time, there are no reviews or comments for this scientist.

If you have personal experience with Nadia Creignou, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nadia Creignou will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-P-60781

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.

Canada

 Charities
 Companies
 MP Candidates
 Patents
 Employee Salary Disclosure

World

 Places of the World
 Scientific Papers

United States

 Banks
 Companies
 Counties
 Patents
 Employee Salary Disclosure