|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2906 occurrences of 1696 keywords
|
|
|
Results
Found 5974 publication records. Showing 5974 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
72 | Nick Bezhanishvili |
Frame Based Formulas for Intermediate Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 90(2), pp. 139-159, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
frame based formulas, locally tabular logics, Intermediate logics |
72 | Dana Angluin, Lisa Hellerstein, Marek Karpinski |
Learning Read-Once Formulas with Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(1), pp. 185-210, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
?-formulas, exact identification, polynomial-time learning, read-once formulas, interpolation, membership queries, equivalence queries |
67 | Ran Raz, Amir Yehudayoff |
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 273-282, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
67 | Haixia Jia, Cristopher Moore, Bart Selman |
From Spin Glasses to Hard Satisfiable Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT (Selected Papers ![In: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 199-210, 2004, Springer, 3-540-27829-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
67 | Robert Demolombe |
Syntactical Characterization of a Subset of Domain-Independent Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(1), pp. 71-94, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
relational model |
67 | Miodrag M. Spalevic |
A note on generalized averaged Gaussian formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 46(3), pp. 253-264, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Averaged gaussian quadrature formulas, Gauss-Kronrod quadrature formulas |
66 | Allen Van Gelder, Rodney W. Topor |
Safety and Translation of Relational Calculus Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 16(2), pp. 235-278, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
allowed formulas, evaluable formulas, existential normal, relational algebra, query translation, relational calculus, domain independence |
66 | Daniel J. Bernstein, Tanja Lange 0001 |
Inverted Edwards Coordinates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings, pp. 20-27, 2007, Springer, 978-3-540-77223-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Edwards coordinates, inverted Edwards coordinates, side-channel countermeasures, unified addition formulas, strongly unified addition formulas, Elliptic curves, addition, explicit formulas, doubling |
62 | Robert A. Di Paola |
The Solvability of the Decision Problem for Classes of Proper Formulas and Related Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 20(1), pp. 112-126, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
57 | James R. Ezick |
An optimizing compiler for batches of temporal logic formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2004, Boston, Massachusetts, USA, July 11-14, 2004, pp. 183-194, 2004, ACM, 1-58113-820-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
model checking, temporal logic, optimizing compiler |
52 | Ran Raz |
Tensor-rank and lower bounds for arithmetic formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 659-666, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits |
52 | Uwe Bubeck, Hans Kleine Büning |
Dependency Quantified Horn Formulas: Models and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 198-211, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Jingfen Zhang, Wen Gao 0001, Jinjin Cai, Simin He 0001, Rong Zeng, Runsheng Chen |
Predicting Molecular Formulas of Fragment Ions with Isotope Patterns in Tandem Mass Spectra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 2(3), pp. 217-230, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Isotope patterns, peptide sequencing, tandem mass spectra |
51 | Ruymán Cruz-Barroso, Pablo González-Vera, Francisco Perdomo-Pío |
An application of Szego polynomials to the computation of certain weighted integrals on the real line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 52(3), pp. 273-293, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Gaussian quadrature formulas, Szeg? polynomials, Szeg? quadrature formulas, Interpolatory type quadrature formulas, Error bounds |
51 | Daniel J. Bernstein, Tanja Lange 0001 |
Faster Addition and Doubling on Elliptic Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings, pp. 29-50, 2007, Springer, 978-3-540-76899-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multi-scalar multiplication, side-channel countermeasures, unified addition formulas, complete addition formulas, performance evaluation, Elliptic curves, register allocation, scalar multiplication, efficient implementation, addition, explicit formulas, doubling |
47 | Judy Goldsmith, Matthias Hagen, Martin Mundhenk |
Complexity of DNF and Isomorphism of Monotone Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 410-421, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
47 | Edgar Altamirano, Gonzalo Escalada-Imaz |
Finding Tractable Formulas in NNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic ![In: Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, pp. 493-507, 2000, Springer, 3-540-67797-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
47 | Tai Joon Park, Allen Van Gelder |
Partitioning Methods for Satisfiability Testing on Large Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings, pp. 748-762, 1996, Springer, 3-540-61511-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
47 | Allen Van Gelder, Rodney W. Topor |
Safety and Correct Translation of Relational Calculus Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California, USA, pp. 313-327, 1987, ACM, 0-89791-223-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
47 | Marko Samer, Stefan Szeider |
Backdoor Sets of Quantified Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 42(1), pp. 77-97, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Backdoor sets, Variable dependencies, Parameterized complexity, Quantified Boolean formulas |
47 | Eugene M. Luks, Amitabha Roy 0001 |
The Complexity of Symmetry-Breaking Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 41(1), pp. 19-45, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
lex-leader formulas, symmetry in search, symmetry-breaking |
46 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 44(7-8), pp. 509-523, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
46 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 396-409, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
46 | Gultekin Özsoyoglu, Huaqing Wang |
A Relational Calculus with Set Operators, Its Safety and Equivalent Graphical Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(9), pp. 1038-1052, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
set comparison, set manipulation, Codd relational calculus, RC/S queries, RC query, evaluable formulas, allowed formulas, RC/S* query, algorithms, relational databases, computer graphics, query languages, safety, database theory, Query-by-Example, relational calculus, graphical languages, set operators, QBE |
42 | Yoshinori Hijikata, Hideki Hashimoto, Shogo Nishida |
Search Mathematical Formulas by Mathematical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (8) ![In: Human Interface and the Management of Information. Designing Information Environments, Symposium on Human Interface 2009, Held as Part of HCI International 2009, San Diego, CA, USA, July 19-24, 2009, Procceedings, Part I, pp. 404-411, 2009, Springer, 978-3-642-02555-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
mathematical formula, search engine, index, inverted file, MathML |
42 | Stefan Porschen, Tatjana Schmidt |
On Some SAT-Variants over Linear Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pp. 449-460, 2009, Springer, 978-3-540-95890-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
not-all-equal satisfiability, exact satisfiability, linear formula, linear hypergraph, bicolorability |
42 | Stefan Szeider |
Generalizations of matched CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 223-238, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
matched formula, deficiency, biclique cover, P 2 -completeness, NP-completeness, bipartite graph, polynomial hierarchy, SAT problem |
42 | Jianming Jin, Xionghu Han, Qingren Wang |
Mathematical Formulas Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 7th International Conference on Document Analysis and Recognition (ICDAR 2003), 2-Volume Set, 3-6 August 2003, Edinburgh, Scotland, UK, pp. 1138-1141, 2003, IEEE Computer Society, 0-7695-1960-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 1-15, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
42 | Cheong Youn, Lawrence J. Henschen, Jiawei Han 0001 |
Classification of Recursive Formulas in Deductive Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 1-3, 1988., pp. 320-328, 1988, ACM Press, 978-0-89791-268-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
41 | Luca Pulina, Armando Tacchella |
A self-adaptive multi-engine solver for quantified Boolean formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 14(1), pp. 80-116, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Self-adaptive multi-engine solver, AQME, Quantified Boolean formulas |
41 | Stefan Erickson, Michael J. Jacobson Jr., Ning Shang, Shuo Shen, Andreas Stein |
Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIFI ![In: Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings, pp. 202-218, 2007, Springer, 978-3-540-73073-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
reduced divisor, infrastructure and distance, Cantor’s algorithm, cryptographic key exchange, efficient implementation, hyperelliptic curve, explicit formulas |
41 | Vladimir Lifschitz, Alexander A. Razborov |
Why are there so many loop formulas? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(2), pp. 261-268, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
loop formulas, stable models, P-completeness, Answer sets |
41 | Alejandro Fernández-Margarit, Francisco Félix Lara Martín |
Induction, minimization and collection for Deltan+1(T)-formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(4), pp. 505-542, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
n+1, Induction, Collection, formulas |
41 | Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz |
The satisfiability problem in regular CNF-formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 2(3), pp. 116-123, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Multiple-valued regular CNF-formulas, benchmarks, threshold, satisfiability problem |
41 | Peter E. Tischer, Gopal K. Gupta 0002 |
An Evaluation of Some New Cyclic Linear Multistep Formulas for Stiff ODEs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 11(3), pp. 263-270, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
cyclic linear multistep formulas, stiff differential equations |
41 | Howard Aizenstein, Leonard Pitt |
Exact Learning of Read-Twice DNF Formulas (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 170-179, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
read-twice DNF formulas, protocol, polynomial-time algorithm, Boolean formulas, membership queries, equivalence queries, disjunctive normal form, exact learning |
41 | Stefan Porschen, Ewald Speckenmeyer |
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT (Selected Papers ![In: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 251-262, 2004, Springer, 3-540-27829-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability |
41 | Orna Kupferman, Moshe Y. Vardi |
Π2 ∩ Σ2 ≡ AFMC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 697-713, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
41 | Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi |
Homogenization and the polynomial calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 11(3-4), pp. 91-108, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q17 |
41 | Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi |
Homogenization and the Polynominal Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 926-937, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | Qingshun Zhang, Daoyun Xu |
The Existence of Unsatisfiable Formulas in k-LCNF for k>=3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 616-623, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Jianhua Zhao, Xuandong Li, Tao Zheng, Guoliang Zheng |
Remove Irrelevant Atomic Formulas for Timed Automaton Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 21(1), pp. 41-51, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
model checking, formal method, timed automaton |
37 | Stefan Porschen, Ewald Speckenmeyer, Bert Randerath |
On Linear CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 212-225, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square |
37 | Uwe Bubeck, Hans Kleine Büning, Xishun Zhao |
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 386-392, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Jianhua Zhao, Xuandong Li, Tao Zheng, Guoliang Zheng |
Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers, pp. 34-45, 2003, Springer, 3-540-21671-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Afef Kacem, Abdel Belaïd, Mohamed Ben Ahmed |
Automatic extraction of printed mathematical formulas using fuzzy logic and propagation of context. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Document Anal. Recognit. ![In: Int. J. Document Anal. Recognit. 4(2), pp. 97-108, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Mathematic formula extraction, Symbol labeling, Context propagation, Fuzzy logic, Document segmentation |
37 | Víctor Dalmau |
Boolean Formulas are Hard to Learn for most Gate Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings, pp. 301-312, 1999, Springer, 3-540-66748-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
37 | Peter Heusch |
The Complexity of the Falsifiability Problem for Pure Implicational Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 221-226, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Subject classification algorithms and data structures, logic in computer science |
36 | Marat D. Ramazanov, Dzhangir Y. Rakhmatullin |
Parallel Algorithms of Numeric Integration Using Lattice Cubature Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 10th International Conference, PaCT 2009, Novosibirsk, Russia, August 31-September 4, 2009. Proceedings, pp. 147-152, 2009, Springer, 978-3-642-03274-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximate integration, calculus mathematics, functional analysis, cubature formulas |
36 | Maurice J. Jansen, Kenneth W. Regan |
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 470-481, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives |
36 | Eugene Goldberg |
Testing satisfiability of CNF formulas by computing a stable set of points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 65-89, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
stable set of points, symmetric CNF formulas, satisfiability problem |
36 | Vincent Astier, Marcus Tressl |
Axiomatization of local-global principles for pp-formulas in spaces of orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(1), pp. 77-95, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Spaces of orderings, Special groups, Positive-primitive formulas, Local-global principles, Isotropy theorem, Model theory, Quadratic forms |
36 | Albert Atserias |
On sufficient conditions for unsatisfiability of random formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 281-311, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Random CNF formulas, propositional resolution, satisfiability, datalog, phase transitions, pebble games |
36 | Ran Raz |
Multi-linear formulas for permanent and determinant are of super-polynomial size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 633-641, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
arithmetic formulas, computational complexity, lower bounds, circuit complexity, algebraic complexity |
36 | Wolfgang Bibel, Elmar Eder |
Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(2), pp. 320-344, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
connection-graph resolution, decomposition of unsatisfiable formulas, semantic trees, regular graphs, strong completeness |
36 | Viktor Kuncak, Martin C. Rinard |
Boolean Algebra of Shape Analysis Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 5th International Conference, VMCAI 2004, Venice, Italy, January 11-13, 2004, Proceedings, pp. 59-72, 2004, Springer, 3-540-20803-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Carlos Ansótegui, Felip Manyà |
New Logical and Complexity Results for Signed-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan, pp. 181-187, 2003, IEEE Computer Society, 0-7695-1918-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Randal E. Bryant, Steven M. German, Miroslav N. Velev |
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 2(1), pp. 93-134, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
processor verfication, decision procedures, uninterpreted functions |
36 | Yaniv Bargury, Johann A. Makowsky |
The Expressive Power of Transitive Closue and 2-way Multihead Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings, pp. 1-14, 1991, Springer, 3-540-55789-X. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
35 | Sudeshna Dasgupta, Vijay Chandru |
Minimal Unsatisfiable Sets: Classification and Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computer Science - ASIAN 2004, Higher-Level Decision Making, 9th Asian Computing Science Conference, Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004, Proceedings, pp. 330-342, 2004, Springer, 3-540-24087-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimal Unsatisfiable Sets, satisfiability, propositional logic, Boolean formulas |
35 | Keith W. Miller 0001, Larry J. Morell, Robert E. Noonan, Stephen K. Park, David M. Nicol, Branson W. Murrill, Jeffrey M. Voas |
Estimating the Probability of Failure When Testing Reveals No Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 18(1), pp. 33-43, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
failure probability estimation, random testing results, input distribution, prior assumptions, failure estimate, discrete sample space statistical model, Bayesian prior assumptions, life-critical applications, probability, program testing, Bayes methods, formulas |
35 | Cindy Eisner, Dana Fisman, John Havlicek |
A topological characterization of weakness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 1-8, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
safety component, semantically weak and strong formulas, syntactically weak and strong formulas, temporal weakness and strength, weak and strong components, safety, liveness |
31 | Guohua Liu |
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings, pp. 444-449, 2009, Springer, 978-3-642-04237-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Daniel Johannsen, Igor Razgon, Magnus Wahlström |
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 80-85, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Pascal Koiran, Klaus Meer |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 252-263, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer |
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 22-23 May 2008, Dallas, Texas, USA, pp. 100-105, 2008, IEEE Computer Society, 978-0-7695-3155-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Helly property, complexity, satisfiability, many-valued logic, propositional logic |
31 | Marko Samer, Stefan Szeider |
Backdoor Sets of Quantified Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings, pp. 230-243, 2007, Springer, 978-3-540-72787-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Kai Lin, David Chen 0002, R. Geoff Dromey, Chengzheng Sun |
Maintaining constraints expressed as formulas in collaborative systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CollaborateCom ![In: Proceedings of the 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing, White Plains, New York, USA, November 12-15, 2007, pp. 318-327, 2007, IEEE Computer Society / ICST, 1-4244-1317-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Masahito Hayashi |
General formulas for fixed-length quantum entanglement concentration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(5), pp. 1904-1921, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Uriel Feige, Jeong Han Kim, Eran Ofek |
Witnesses for non-satisfiability of dense random 3CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 497-508, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Husam Abu-Haimed, David L. Dill, Sergey Berezin |
A Refinement Method for Validity Checking of Quantified First-Order Formulas in Hardware Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, 6th International Conference, FMCAD 2006, San Jose, California, USA, November 12-16, 2006, Proceedings, pp. 145-152, 2006, IEEE Computer Society, 0-7695-2707-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Salamah Salamah, Ann Q. Gates, Steve Roach, Oscar Mondragon |
Verifying Pattern-Generated LTL Formulas: A Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 12th International SPIN Workshop, San Francisco, CA, USA, August 22-24, 2005, Proceedings, pp. 200-220, 2005, Springer, 3-540-28195-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Wei Xiao, Eng-Wee Chionh |
Formal Power Series and Loose Entry Formulas for the Dixon Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWMM/GIAE ![In: Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers, pp. 72-82, 2004, Springer, 3-540-26296-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Miroslav N. Velev |
Efficient translation of boolean formulas to CNF in formal verification of microprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, Yokohama, Japan, January 27-30, 2004, pp. 310-315, 2004, IEEE Computer Society, 0-7803-8175-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Uriel Feige, Eran Ofek |
Easily Refutable Subformulas of Large Random 3CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 519-530, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Andrei A. Bulatov, Hubie Chen, Víctor Dalmau |
Learnability of Relatively Quantified Generalized Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings, pp. 365-379, 2004, Springer, 978-3-540-23356-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Jan Chomicki |
Preference formulas in relational queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 28(4), pp. 427-466, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
query optimization, relational algebra, preferences, Preference queries |
31 | Lisa Hellerstein, Vijay Raghavan 0002 |
Exact learning of DNF formulas using DNF hypotheses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 465-473, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
representations of boolean functions, algorithms, certificates, complexity theory, computational learning theory, disjunctive normal form, DNF |
31 | Kenichi Toyozumi, Kensaku Mori, Yasuhito Suenaga, Takahiro Suzuki |
A System for Real-time Recognition of Handwritten Mathematical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 10-13 September 2001, Seattle, WA, USA, pp. 1059-1063, 2001, IEEE Computer Society, 0-7695-1263-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Jerry L. Prince |
Convolution backprojection formulas for 3-D vector tomography with application to MRI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 5(10), pp. 1462-1472, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Neil V. Murray, Erik Rosenthal |
Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Methodologies for Intelligent Systems, 7th International Symposium, ISMIS '93, Trondheim, Norway, June 15-18, 1993, Proceedings, pp. 275-284, 1993, Springer, 3-540-56804-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Harry B. Hunt III, Richard Edwin Stearns |
Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings, pp. 277-290, 1986, Springer, 3-540-16078-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
31 | Ran Raz |
Multi-linear formulas for permanent and determinant are of super-polynomial size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(2), pp. 8:1-8:17, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
arithmetic formulas, lower bounds, circuit complexity, algebraic complexity |
31 | Gabriel Aranda-López, Susana Nieva, Fernando Sáenz-Pérez, Jaime Sánchez-Hernández |
Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, September 7-9, 2009, Coimbra, Portugal, pp. 117-128, 2009, ACM, 978-1-60558-568-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hereditary harrop formulas, constraints, prolog, deductive databases, fixpoint semantics, stratification |
31 | K. Subramani 0001 |
Optimal length tree-like resolution refutations for 2SAT formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 5(2), pp. 316-320, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
2SAT formulas, tree-like proofs, Resolution |
31 | Stephen Bique |
Useful formulas for multidimensional arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the 2003 Conference on APL: Stretching the Mind, APL 2003, San Diego, California, USA, June 11-14, 2003, pp. 43-47, 2003, ACM, 1-58113-668-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
problem specification, program, calculus, formulas |
31 | Edith Hemaspaandra, Gerd Wechsung |
The Minimization Problem for Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 575-584, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
computational complexity, minimization, propositional logic, Boolean formulas, polynomial hierarchy |
31 | Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol |
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 363-376, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Ran Raz, Iddo Tzameret |
The Strength of Multilinear Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 407-457, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17, 13P10 |
31 | Klaus Denecke, Dara Phusanga |
Hyperformulas and Solid Algebraic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 90(2), pp. 263-286, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
AMS subject classification 03B50, 08A46, 08A30 |
31 | Antonio Di Nola, Ada Lettieri |
On normal forms in Lukasiewicz logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(6), pp. 795-823, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
McNaughton function, Separation of variables |
30 | Amir Shpilka, Ilya Volkovich |
Read-once polynomial identity testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 507-516, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits |
30 | Yuesheng Li |
The Inversion of Multiscale Convolution Approximation and Average of Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 19(1-3), pp. 293-306, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
average of distributions, EB-splines, inversion formulas, multiscale convolution approximations, wavelets |
30 | Paul Beame, Toniann Pitassi |
Simplified and Improved Resolution Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 274-282, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
resolution lower bounds, randomly generated formulas, random formulas, randomly chosen 3-CNF formula, lower bounds, computability, pigeonhole principle |
30 | Howard Aizenstein, Lisa Hellerstein, Leonard Pitt |
Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 523-532, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
disjunctive normal, nonlearnability, polynomial-time membership, read-thrice DNF formulas, membership, boolean formulas, equivalence queries, exact learning |
30 | Mike Paterson, Nicholas Pippenger, Uri Zwick |
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 642-650, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
multiplication circuits, multiple addition, shallowest possible circuits, shortest possible formulas, occurrence matrix, shortest multiple carry-save addition formulas, delay matrix, multiple carry-save adders, multiplication, symmetric Boolean functions, carry-save addition |
26 | GuoJun Wang, QiaoLin Duan |
Theory of (n) truth degrees of formulas in modal logic and a consistency theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 52(1), pp. 70-83, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
(n) truth degrees, consistency theorem, (n) modality similarity degrees, (n) modality logic metric space, temporal logic, modal logic, approximate reasoning |
26 | Hiroki Morizumi |
Limiting Negations in Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 701-712, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Hans Kleine Büning, Xishun Zhao, Uwe Bubeck |
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 391-397, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 5974 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|