Остановите войну!
for scientists:
default search action
Petr Savický
- > Home > Persons > Petr Savický
Publications
- 2018
- [j30]Jirí Síma, Petr Savický:
Quasi-periodic β-expansions and cut languages. Theor. Comput. Sci. 720: 1-23 (2018) - 2017
- [c16]Jirí Síma, Petr Savický:
Cut Languages in Rational Bases. LATA 2017: 311-322 - 2005
- [j22]Matthias Krause, Petr Savický, Ingo Wegener:
On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201(2): 160-177 (2005) - [j21]Petr Savický, Detlef Sieling:
A hierarchy result for read-once branching programs with restricted parity nondeterminism. Theor. Comput. Sci. 340(3): 594-605 (2005) - 2001
- [i8]Petr Savický, Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j18]Petr Savický, Stanislav Zák:
A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theor. Comput. Sci. 238(1-2): 347-362 (2000) - [j17]Petr Savický, Jirí Sgall:
DNF tautologies with a limited number of occurrences of every variable. Theor. Comput. Sci. 238(1-2): 495-498 (2000) - [c9]Petr Savický, Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. MFCS 2000: 650-659 - 1999
- [j16]Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
On P versus NP cap co-NP for decision trees and read-once branching programs. Comput. Complex. 8(4): 357-370 (1999) - [c8]Matthias Krause, Petr Savický, Ingo Wegener:
Approximations by OBDDs and the Variable Ordering Problem. ICALP 1999: 493-502 - [i7]Matthias Krause, Petr Savický, Ingo Wegener:
Approximations by OBDDs and the variable ordering problem. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j13]Petr Savický, Alan R. Woods:
The number of Boolean functions computed by formulas of a given size. Random Struct. Algorithms 13(3-4): 349-382 (1998) - 1997
- [j12]Petr Savický, Ingo Wegener:
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. Acta Informatica 34(4): 245-256 (1997) - [j11]Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Check Matrices. Des. Codes Cryptogr. 12(2): 107-130 (1997) - [j10]Hanno Lefmann, Petr Savický:
Some typical properties of large AND/OR Boolean formulas. Random Struct. Algorithms 10(3): 337-351 (1997) - [j9]Petr Savický, Stanislav Zák:
A Lower Bound on Branching Programs Reading Some Bits Twice. Theor. Comput. Sci. 172(1-2): 293-301 (1997) - [c6]Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. MFCS 1997: 319-326 - [c5]Petr Savický, Stanislav Zák:
A Hierarchy for (1, +k)-Branching Programs with Respect of k. MFCS 1997: 478-487 - [i4]Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c4]Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract). COCOON 1996: 41-49 - [i2]Petr Savický, Stanislav Zák:
A large lower bound for 1-branching programs. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Petr Savický, Stanislav Zák:
A hierarchy for (1,+k)-branching programs with respect to k. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j7]Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický:
On the Average Case Circuit Delay of Disjunction. Parallel Process. Lett. 5: 275-280 (1995) - [c3]Hanno Lefmann, Petr Savický:
Some Typical Properties of Large AND/OR Boolean Formulas. MFCS 1995: 237-246 - 1994
- [c2]Petr Savický, Ingo Wegener:
Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. FSTTCS 1994: 390-401 - 1993
- [j4]Jan Kratochvíl, Petr Savický, Zsolt Tuza:
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. SIAM J. Comput. 22(1): 203-210 (1993) - [j3]Pavel Pudlák, Petr Savický:
On shifting networks. Theor. Comput. Sci. 116(2): 415-419 (1993) - 1988
- [j1]Pavel Pudlák, Vojtech Rödl, Petr Savický:
Graph Complexity. Acta Informatica 25(5): 515-535 (1988)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint