XSAT and NAE-SAT of linear CNF classes (Englisch)
- Neue Suche nach: Porschen, Stefan
- Neue Suche nach: Schmidt, Tatjana
- Neue Suche nach: Speckenmeyer, Ewald
- Neue Suche nach: Wotzlaw, Andreas
- Neue Suche nach: Porschen, Stefan
- Neue Suche nach: Schmidt, Tatjana
- Neue Suche nach: Speckenmeyer, Ewald
- Neue Suche nach: Wotzlaw, Andreas
In:
Discrete Applied Mathematics
;
167
;
1-14
;
2013
-
ISSN:
- Aufsatz (Zeitschrift) / Elektronische Ressource
-
Titel:XSAT and NAE-SAT of linear CNF classes
-
Beteiligte:Porschen, Stefan ( Autor:in ) / Schmidt, Tatjana ( Autor:in ) / Speckenmeyer, Ewald ( Autor:in ) / Wotzlaw, Andreas ( Autor:in )
-
Erschienen in:Discrete Applied Mathematics ; 167 ; 1-14
-
Verlag:
- Neue Suche nach: Elsevier B.V.
-
Erscheinungsdatum:24.10.2013
-
Format / Umfang:14 pages
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis – Band 167
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
XSAT and NAE-SAT of linear CNF classesPorschen, Stefan / Schmidt, Tatjana / Speckenmeyer, Ewald / Wotzlaw, Andreas et al. | 2013
- 15
-
Counting inequivalent monotone Boolean functionsStephen, Tamon / Yusun, Timothy et al. | 2013
- 25
-
Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearityWang, Qichun / Tan, Chik How et al. | 2013
- 33
-
Graphs with two trivial critical idealsAlfaro, Carlos A. / Valencia, Carlos E. et al. | 2013
- 45
-
List backbone colouring of graphsBu, Yuehua / Finbow, Stephen / Liu, Daphne Der-Fen / Zhu, Xuding et al. | 2013
- 52
-
Fixed-parameter algorithms for the cocoloring problemCampos, Victor / Klein, Sulamita / Sampaio, Rudini / Silva, Ana et al. | 2013
- 61
-
Choice identification of a graphChang, Ting-Pang / Tong, Li-Da et al. | 2013
- 72
-
Upper bounds on the average eccentricityDankelmann, Peter / Mukwembi, Simon et al. | 2013
- 80
-
Book drawings of complete bipartite graphsde Klerk, Etienne / Pasechnik, Dmitrii V. / Salazar, Gelasio et al. | 2013
- 94
-
Bondage number of grid graphsDettlaff, Magda / Lemańska, Magdalena / Yero, Ismael G. et al. | 2013
- 100
-
The packing coloring of distance graphsEkstein, Jan / Holub, Přemysl / Togni, Olivier et al. | 2013
- 100
-
The packing coloring of distance graphsEkstein, Jan et al. | 2014
- 107
-
Coloring graphs without short cycles and long induced pathsGolovach, Petr A. / Paulusma, Daniël / Song, Jian et al. | 2013
- 121
-
A formulation of the wide partition conjecture using the atom problem in discrete tomographyGuíñez, Flavio et al. | 2013
- 131
-
On Nash-solvability in pure stationary strategies of the deterministic -person games with perfect information and mean or total effective costGurvich, Vladimir et al. | 2014
- 131
-
On Nash-solvability in pure stationary strategies of the deterministic -person games with perfect information and mean or total effective costGurvich, Vladimir / Oudalov, Vladimir et al. | 2013
- 144
-
Edge-intersection graphs of grid paths: The bend-numberHeldt, Daniel / Knauer, Kolja / Ueckerdt, Torsten et al. | 2013
- 163
-
Cycles in cube-connected cycles graphsHsu, Lih-Hsing / Ho, Tung-Yang / Ho, Yen-Hsun / Tsay, Chey-Woei et al. | 2013
- 172
-
Exact performance of MULTIFIT for nonsimultaneous machinesHwang, Hark-Chin / Lim, Kyungkuk et al. | 2013
- 188
-
Constructing formally self-dual codes overKaradeniz, Suat / Dougherty, Steven T. / Yildiz, Bahattin et al. | 2013
- 188
-
Constructing formally self-dual codes overKaradeniz, Suat et al. | 2014
- 197
-
Relationship between the edge-Wiener index and the Gutman index of a graphKnor, Martin / Potočnik, Primož / Škrekovski, Riste et al. | 2013
- 202
-
Steady state analysis of timed event graphs with time window constraintsLee, Tae-Eog / Park, Seong-Ho / Jung, Chihyun et al. | 2013
- 217
-
The second Zagreb indices of unicyclic graphs with given degree sequencesLiu, Muhuo / Liu, Bolian et al. | 2013
- 222
-
Which -trees are cover–incomparability graphs?Maxová, Jana et al. | 2014
- 222
-
Which -trees are cover–incomparability graphs?Maxová, Jana / Dubcová, Miroslava / Pavlíková, Pavla / Turzík, Daniel et al. | 2013
- 228
-
Recognition of probe proper interval graphsNussbaum, Yahav et al. | 2013
- 239
-
The intersection spectrum of hooked Skolem sequences and applicationsShalaby, Nabil / Silvesan, Daniela et al. | 2013
- 261
-
Maximally edge-connected graphs and Zeroth-order general Randic index for 0<@a<1Su, G. / Xiong, L. / Su, X. et al. | 2014
- 261
-
Maximally edge-connected graphs and Zeroth-order general Randić index forSu, Guifu / Xiong, Liming / Su, Xiaofeng et al. | 2013
- 261
-
Maximally edge-connected graphs and Zeroth-order general Randić index forSu, Guifu et al. | 2014
- 269
-
Piece selection algorithms for layered video streaming in P2P networksSzkaliczki, Tibor / Eberhard, Michael / Hellwagner, Hermann / Szobonya, László et al. | 2013
- 280
-
On packing colorings of distance graphsTogni, Olivier et al. | 2013
- 290
-
Acyclic edge coloring of graphsWang, Tao / Zhang, Yaqiong et al. | 2013
- 304
-
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degreeYang, Weihua / Tian, Yingzhi / Li, Hengzhe / Li, Hao / Guo, Xiaofeng et al. | 2013
- 310
-
Distances between sets based on set commonalityHoradam, K.J. / Nyblom, M.A. et al. | 2013
- 315
-
The Erdős webgraph serverÖrdög, Rafael / Bánky, Dániel / Szerencsi, Balázs / Juhász, Péter / Grolmusz, Vince et al. | 2013
- 315
-
The Erdos webgraph serverOrdog, R. / Banky, D. / Szerencsi, B. / Juhasz, P. / Grolmusz, V. et al. | 2014
- v
-
Contents| 2014