« first day (4850 days earlier)
← previous day
00:00 - 02:00
02:00 - 03:00
03:00 - 12:00
l4m2
2:11 AM
CMC
Solve some NPC for n=10000
popularity-contest
Notice that 3-SAT with first n^0.01 rules is an answer, so this is not pure code-golf
Seggan
@RydwolfPrograms even after reading this, i did the same thing
@RydwolfPrograms yeah thats why i dont do this stuff (as in i have feelings towards people but i prefer not acting upon them)
(for now at least)
l4m2
2:41 AM
Round towards negative is ⌊⌋, is there symbol round towards 0?
Bubbler
@l4m2 modern SAT solvers are really fast. benchmarks from SAT competition include testcases with 10000+ variables and 10^6+ clauses
l4m2
@Bubbler Fast for average input, slow for constructed ones
Bubbler
well sure, there is adversary input for any solver
but the testcases are from real world scenarios and being fast on them is practically important
00:00 - 02:00
02:00 - 03:00
03:00 - 12:00
« first day (4850 days earlier)
← previous day
all rooms
Transcript for
May
9
May
10
The Nineteenth Byte
The Nineteenth Byte: General discussion for
codegolf.stackexc...
16
2
join this room
about this room
00:00
06:00
12:00
18:00
all times are UTC
site design / logo © 2024 Stack Exchange Inc;
legal
mobile