PSEUDO BOOLEAN OPTIMIZATION
Experts
- Libor Barto
- Andrei A. Bulatov
- Michael Pinsker
- Manuel Bodirsky
- Eugene C. Freuder
- Andrei A. Krokhin
- Marcin Kozik
- Vasco M. Manquinho
- Víctor Dalmau
- Richard J. Wallace
- Tomoyuki Yamakami
- Miguel A. Salido
- Michael Kompatscher
- Miroslav Olsák
- João P. Marques Silva
- Federico Barber
- Oliver Kullmann
- Renato Tinós
- Martin Grohe
- Antoine Mottet
- Stanislav Zivný
- Gregory Z. Gutin
- Inês Lynce
- Laura Climent
- Martin C. Cooper
- Hubie Chen
- Peter Jonsson
- Ho-fung Leung
- Benoît Larose
- Victor Lagerkvist
- Anders Yeo
- Jakub Oprsal
- Venkatesan Guruswami
- Zineb Habbas
- Guillaume Escamocher
- Aarthi Sundaram
- Yuan Zhou
- Miklos Santha
- Philippe Jégou
Venues
- CoRR
- CP
- AAAI
- Electron. Colloquium Comput. Complex.
- Theor. Comput. Sci.
- ECAI
- Artif. Intell.
- ICTAI
- FOCS
- LICS
- SAT
- ICALP
- SIAM J. Comput.
- IJCAI
- ICALP (1)
- Complexity of Constraints
- Inf. Comput.
- Discret. Appl. Math.
- Log. Methods Comput. Sci.
- MFCS
- SODA
- Ann. Math. Artif. Intell.
- SAC
- ICCV
- CSL
- Inf. Process. Lett.
- GECCO
- CPAIOR
- Eur. J. Oper. Res.
- AAAI/IAAI
- Constraints An Int. J.
- Dagstuhl Reports
- STACS
- DATE
- FUZZ-IEEE
- Commun. ACM
- Appl. Intell.
- Theory Comput.
- The Constraint Satisfaction Problem: Complexity and Approximability
Related Topics
Related Keywords
Popularity
No popularities found. Try to change the filters.
Popularity Trend