default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Savický
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i16]Petr Savický:
On CNF formulas irredundant with respect to unit clause propagation. CoRR abs/2309.01750 (2023)- 2022
- [j33]Petr Kucera
, Petr Savický:
Propagation complete encodings of smooth DNNF theories. Constraints An Int. J. 27(3): 327-359 (2022) - 2021
- [c19]Petr Kucera, Petr Savický:
Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. AAAI 2021: 3832-3840 - 2020
- [j32]Petr Kucera, Petr Savický:
Bounds on the Size of PC and URC Formulas. J. Artif. Intell. Res. 69: 1395-1420 (2020) - [c18]Petr Kucera, Petr Savický:
On the size of CNF formulas with high propagation strength. ISAIM 2020 - [i15]Petr Kucera, Petr Savický:
Bounds on the size of PC and URC formulas. CoRR abs/2001.00819 (2020)
2010 – 2019
- 2019
- [j31]Petr Kucera, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. Theor. Comput. Sci. 762: 51-73 (2019) - [i14]Petr Kucera, Petr Savický:
Propagation complete encodings of smooth DNNF theories. CoRR abs/1909.06673 (2019) - 2018
- [j30]Jirí Síma, Petr Savický:
Quasi-periodic β-expansions and cut languages. Theor. Comput. Sci. 720: 1-23 (2018) - [i13]Petr Kucera, Petr Savický:
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings. CoRR abs/1811.09435 (2018) - 2017
- [c17]Petr Savický, Petr Kucera:
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract). IJCAI 2017: 5055-5059 - [c16]Jirí Síma, Petr Savický:
Cut Languages in Rational Bases. LATA 2017: 311-322 - [c15]Petr Kucera, Petr Savický, Vojtech Vorel:
A Lower Bound on CNF Encodings of the At-Most-One Constraint. SAT 2017: 412-428 - [i12]Petr Kucera, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. CoRR abs/1704.08934 (2017) - 2016
- [j29]Petr Savický, Petr Kucera:
Generating Models of a Matched Formula With a Polynomial Delay. J. Artif. Intell. Res. 56: 379-402 (2016) - [j28]Zuzana Haniková, Petr Savický:
Term satisfiability in FLew-algebras. Theor. Comput. Sci. 631: 1-15 (2016) - [c14]Petr Savický, Petr Kucera:
Generating models of a matched formula with a polynomial delay. ISAIM 2016 - 2015
- [i11]Zuzana Haniková, Petr Savický:
Term satisfiability in FL$_\mathrm{ew}$-algebras. CoRR abs/1501.02250 (2015) - 2013
- [i10]Petr Savický:
Boolean functions with a vertex-transitive group of automorphisms. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j27]Ondrej Cepek, Petr Kucera, Petr Savický:
Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. 160(4-5): 365-382 (2012)
2000 – 2009
- 2009
- [c13]Petr Savický, Jirí Vomlel:
Triangulation Heuristics for BN2O Networks. ECSQARU 2009: 566-577 - 2008
- [j26]Petr Savický, Marko Robnik-Sikonja:
Learning Random Numbers: a MATLAB Anomaly. Appl. Artif. Intell. 22(3): 254-265 (2008) - [j25]Zuzana Haniková, Petr Savický:
Distinguishing standard SBL-algebras with involutive negations by propositional formulas. Math. Log. Q. 54(6): 579-596 (2008) - 2007
- [j24]Petr Savický, Jirí Vomlel:
Exploiting tensor rank-one decomposition in probabilistic inference. Kybernetika 43(5): 747-764 (2007) - [c12]Jakub Dvorák, Petr Savický:
Softening Splits in Decision Trees Using Simulated Annealing. ICANNGA (1) 2007: 721-729 - 2006
- [j23]Petr Savický, Roberto Cignoli, Francesc Esteva, Lluís Godo, Carles Noguera:
On Product Logic with Truth-constants. J. Log. Comput. 16(2): 205-225 (2006) - 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) - 2003
- [c11]Petr Savický, Johannes Fürnkranz:
Combining Pairwise Classifiers with Stacking. IDA 2003: 219-229 - 2002
- [j20]Petr Savický, Jaroslava Hlavácová:
Measures of Word Commonness. J. Quant. Linguistics 9(3): 215-231 (2002) - [c10]Petr Savický, Jan Klaschka:
Optimally Trained Regression Trees and Occam's Razor. COMPSTAT 2002: 479-484 - [i9]Petr Savický:
On determinism versus unambiquous nondeterminism for decision trees. Electron. Colloquium Comput. Complex. TR02 (2002) - 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
- [j19]Petr Savický:
On random orderings of variables for parity ordered binary decision diagrams. Random Struct. Algorithms 16(3): 233-239 (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
1990 – 1999
- 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
- [j15]Petr Savický:
Complexity and Probability of Some Boolean Formulas. Comb. Probab. Comput. 7(4): 451-463 (1998) - [j14]Vera Kurková, Petr Savický, Katerina Hlavácková:
Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Networks 11(4): 651-659 (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) - [i6]Petr Savický:
A probabilistic nonequivalence test for syntactic (1,+k)-branching programs. Electron. Colloquium Comput. Complex. TR98 (1998) - [i5]Petr Savický:
On Random Orderings of Variables for Parity OBDDs. Electron. Colloquium Comput. Complex. TR98 (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) - [c7]Katerina Hlavácková, Vera Kurková, Petr Savický:
Upper Bounds on the Approximation Rates of Real-valued Boolean Functions by Neural Networks. ICANNGA 1997: 495-499 - [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) - [i3]Petr Savický:
Complexity and Probability of some Boolean Formulas. 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
- [j8]Petr Savický:
Bent functions and random boolean formulas. Discret. Math. 147(1-3): 211-234 (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) - [j6]Petr Savický:
Improved Boolean Formulas for the Ramsey Graphs. Random Struct. Algorithms 6(4): 407-416 (1995) - [c3]Hanno Lefmann, Petr Savický:
Some Typical Properties of Large AND/OR Boolean Formulas. MFCS 1995: 237-246 - 1994
- [j5]Petr Savický:
On the Bent Boolean Functions That are Symmetric. Eur. J. Comb. 15(4): 407-410 (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) - 1990
- [j2]Petr Savický:
Random boolean formulas representing any boolean function with asymptotically equal probability. Discret. Math. 83(1): 95-103 (1990)
1980 – 1989
- 1988
- [j1]Pavel Pudlák, Vojtech Rödl, Petr Savický:
Graph Complexity. Acta Informatica 25(5): 515-535 (1988) - [c1]Petr Savický:
Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract). MFCS 1988: 512-517
Coauthor Index
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 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
