Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

2002, Volume 293  
| General information | Contents |


Computational complexity theory. Part VII


Systems of pair of $q$-distant representatives and graph colorings
P. A. Golovach 		5–25
Public-key cryptography and invariant theory
D. Yu. Grigor'ev 		26–38
On non-abelian homomorphic public-key cryptosystems
D. Yu. Grigor'ev, I. N. Ponomarenko 		39–58
Blocks in $k$-connected graphs
D. V. Karpov 		59–93
Solution lifting method for handling Meta-variables in the TH$\exists$OREM$\forall$ system
B. Yu. Konev, T. Jebelean 		94–117
An upper bound $O(2^{0.16254n})$ for Exact 3-Satisfiability: a simpler proof
A. S. Kulikov 		118–128
A $2^{|E|/4}$-time Algorithm for MAX-CUT
A. S. Kulikov, S. S. Fedin 		129–138
Hard satisfiable formulas for DPLL-type algorithms
S. I. Nikolenko 		139–148
Intertible infinitary calculus without loop rules for a restricted FTL
R. Pliuškevičius 		149–180
Записки научных семинаров ПОМИ
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026