We’re rewarding the question askers & reputations are being recalculated! Read more.

Profile Activity

Xavier Labouze

Network profile

Reputation

965

985
950
915

2016
2017
2018
2019

Top tag

sat

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

1

7

24

Newest

Yearling

Next badge

12/30

Impact

0 posts edited

0 helpful flags

100 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Questions (14)

Votes Activity Newest

12	Unique SAT vs Exactly $m$ models
11	Consequences of $NP=coNP$ and $P\ne NP$?
10	About Inverse 3-SAT
10	A variant of Critical SAT in DP
8	Transform a CNF into an equivalent 3-CNF defined on the same variables

View more →

Reputation (965)

This user has no recent positive reputation changes

View more →

Answers (5)

Votes Activity Newest

3	About Inverse 3-SAT
2	Unique $k$-SAT benchmarks
2	Complexity of the $(3,2)_s$ SAT problem?
1	Surveys in other languages than English
-1	A variant of Critical SAT in DP

Tags (17)

3 sat × 15	1 soft-question × 2
3 reference-request × 5	0 lo.logic × 4
2 cc.complexity-theory × 18	0 counting-complexity × 3
1 np-hardness × 5	0 reductions × 2
1 big-picture × 2	0 polynomial-hierarchy × 2

View more →

Accounts (10)

	Theoretical Computer Science	965 rep	1 gold badge7 silver badges24 bronze badges
	Computer Science	469 rep	2 silver badges9 bronze badges
	Cross Validated	233 rep	1 gold badge2 silver badges9 bronze badges
	Language Learning	189 rep	5 bronze badges
	Mathematics	125 rep	9 bronze badges

Badges (23)

Recent Class Name

Yearling × 4	Curious
Notable Question	Constituent
Popular Question × 4	Caucus
Nice Question × 4	Revival
Self-Learner	Promoter

View more →

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (100)

all time			by type
98	up		41	question
2	down		59	answer

Theoretical Computer Science Stack Exchange works best with JavaScript enabled